朱宸宇 • 2年前
using namespace std; int n,m,k,t; int a,b; struct node {
int x,y;
}e[40005]; bool check(int c,int d) {
for (int i=1; i<=k; i++)
if (c==e[i].x && d==e[i].y)
return true;
return false;
} bool cmp(node n1,node n2) {
if (n1.x != n2.x) return n1.x < n2.x;
return n1.y < n2.y;
} int main() {
scanf("%d%d%d%d",&n,&m,&k,&t);
for (int i=1; i<=k; i++) cin>>e[i].x>>e[i].y;
sort (e+1,e+k+1,cmp);
for (int i=1; i<=t; i++)
{
cin>>a>>b;
int cnt=(a-1)*m+b;
if (check(a,b)) printf("Waste\n");
else
{
for (int j=1; j<=k; j++)
{
if (e[j].x<a || e[j].x==a && e[j].y<b) cnt--;
else break;
}
if (cnt%3==1) printf("Carrots");
else if (cnt%3==2) printf("Kiwis");
else if (cnt%3==0) printf("Grapes");
printf("\n");
}
}
return 0;
}
评论: