-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1027B_NumbersOnTheChessboard.cpp
More file actions
56 lines (47 loc) · 1.22 KB
/
1027B_NumbersOnTheChessboard.cpp
File metadata and controls
56 lines (47 loc) · 1.22 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
//* 211690804 Jul/01/2023 14:48UTC+7 Minh4893IT B - Numbers on the Chessboard GNU C++14 Accepted 373 ms 0 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ss stringstream
#define uset unordered_set
#define umap unordered_map
#define mmap multimap
#define mset multiset
#define pq priority_queue
#define endl "\n"
#define LLMAX INT64_MAX
#define GET(var) getline(cin, var)
#define EACH(x, a) for (auto &x : a)
#define IF(cond, t, f) (cond ? t : f)
#define OFILE(finp, fout) freopen(finp, "r", stdin), freopen(fout, "w", stdout)
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie()
void solve()
{
int n, q;
cin >> n >> q;
while (q--)
{
int x, y;
cin >> y >> x;
if (n % 2 == 0)
{
if (x % 2 == y % 2)
cout << n / 2 * (y - 1) + (x + 1) / 2 << endl;
else
cout << n * n / 2 + n / 2 * (y - 1) + (x + 1) / 2 << endl;
}
else
{
if (x % 2 == y % 2)
cout << ((y - 1) * n + x) / 2 + 1 << endl;
else
cout << ((y - 1) * n + x) / 2 + n * n / 2 + 1 << endl;
}
}
}
signed main()
{
FAST_IO;
solve();
return 0;
}