forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
65 lines (57 loc) · 1.5 KB
/
C.cpp
File metadata and controls
65 lines (57 loc) · 1.5 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
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
using namespace std;
bool mark[55][55];
int n, r;
void solve() {
int x, y; cin >> x >> y;
int dx, dy;
if (x == 0) {
dx = 1;
dy = 0;
}
else if (x == n+1) {
dx = -1;
dy = 0;
}
else if (y == 0) {
dx = 0;
dy = 1;
}
else {
dx = 0;
dy = -1;
}
REP(turn,10111) {
x += dx; y += dy;
if (mark[x][y]) {
swap(dx, dy);
dy = -dy;
}
if (x == 0 || x == n+1 || y == 0 || y == n+1) {
cout << x << ' ' << y << endl;
return ;
}
}
cout << 0 << ' ' << 0 << endl;
}
int main() {
ios :: sync_with_stdio(false);
int ntest; cin >> ntest;
while (ntest--) {
cin >> n >> r;
memset(mark, false, sizeof mark);
FOR(i,1,r) {
int x, y; cin >> x >> y; mark[x][y] = true;
}
solve();
}
}