# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45037 | TAMREF | Untitled (GCJ18Q_gogopher) | C++17 | 86 ms | 1816 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
bool q[21][1005][1005];
inline bool full(int f, int r, int c){
return q[f][r-1][c-1] & q[f][r-1][c] & q[f][r-1][c+1] & q[f][r][c-1] & q[f][r][c] & q[f][r][c+1] & q[f][r+1][c-1] & q[f][r+1][c] & q[f][r+1][c+1];
}
int main(){
int T, A; scanf("%d",&T);
for(int f = 1; f <= T; f++){
scanf("%d",&A);
int cx = 1, cy = 1, xtr = 2, ytr = 2;
for(int loop = 1;;++loop){
if(cx == 0 && cy == 0) break;
if(cx == -1 && cy == -1){
//fprintf(stderr,"We're doomed\n");
exit(0);
}
//fprintf(stderr,"%d\n",loop);
printf("%d %d\n",xtr,ytr);
fflush(stdout);
scanf("%d %d",&cx,&cy);
q[f][cx][cy] = 1;
if(full(f,xtr,ytr)){
xtr += 3;
if(xtr > 999){
xtr = 2;
ytr += 3;
}
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |