# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117210 | evpipis | Treasure (different grader from official contest) (CEOI13_treasure2) | C++17 | 0 ms | 0 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;
const int len = 105;
int pref[len][len], suf[len][len];
int ask(int a, int b, int c, int d){
printf("%d %d %d %d\n", a, b, c, d);
fflush(stdout);
int ans;
scanf("%d", &ans);
return ans;
}
int main(){
int n;
scanf("%d", &n);
int mid = n/2;
for (int i = mid; i <= n; i++)
for (int j = 1; j <= n; j++)
pref[i][j] = ask(1, 1, i, j);
for (int i = 1; i <= mid; i++)
for (int j = 1; j <= n; j++)
suf[i][j]= ask(i, j, n, n);
for (int i = 1; i < mid; i++)
for (int j = 1; j <= n; j++)
pref[i][j] = suf[1][j+1]+suf[i+1][1]-suf[i+1][j+1];
printf("END\n");
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
if (pref[i][j]-pref[i-1][j]-pref[i][j-1]+pref[i-1][j-1])
printf("1 ");
else
printf("0 ");
}
printf("\n");
}
fflush(stdout);
return 0;
}