forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathB.cpp
More file actions
51 lines (42 loc) · 1.41 KB
/
B.cpp
File metadata and controls
51 lines (42 loc) · 1.41 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
#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))
using namespace std;
int m, n, k, t;
int a[1011];
int main() {
ios :: sync_with_stdio(false);
while (cin >> m >> n >> k >> t) {
FOR(i,1,k) {
int u, v; cin >> u >> v; --u; --v;
a[i] = u * n + v;
}
FOR(i,1,t) {
int res = 0;
int u, v; cin >> u >> v; --u; --v;
int cur = u * n + v;
int cnt = 0;
FOR(j,1,k) {
if (cur == a[j]) {
res = -1;
break;
}
else if (cur > a[j]) ++cnt;
}
if (res < 0) puts("Waste");
else {
cur -= cnt;
if (cur % 3 == 0) puts("Carrots");
else if (cur % 3 == 1) puts("Kiwis");
else puts("Grapes");
}
}
}
return 0;
}