# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119322 | minhtung0404 | 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.
//https://oj.uz/problem/view/CEOI13_treasure2
#include<bits/stdc++.h>
const int N = 105;
using namespace std;
int a[N][N];
int n, sum[N][N], ans[N][N], cnt;
int ask(int r1, int c1, int r2, int c2){
if (r1 > r2) swap(r1, r2);
if (c1 > c2) swap(c1, c2);
// return a[r2][c2] - a[r1-1][c2] - a[r2][c1-1] - a[r1-1][c1-1];
cout << r1 << " " << c1 << " " << r2 << " " << c2 << endl;
// cnt++;
int res; cin >> res;
return res;
}
int main(){
cin >> n;
for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) cin >> a[i][j], a[i][j] += a[i-1][j] + a[i][j-1] - a[i-1][j-1];
int half = n / 2;
for (int i = half; i <= n; i++) for (int j = half; j <= n; j++) sum[i][j] = ask(1, 1, i, j);
for (int i = half+1; i <= n; i++) for (int j = half+1; j <= n; j++) ans[i][j] = sum[i][j] - sum[i-1][j] - sum[i][j-1] + sum[i-1][j-1];
for (int i = half; i <= n; i++) for (int j = 1; j <= half+1; j++) sum[i][j] = ask(1, n, i, j);
for (int i = half+1; i <= n; i++) for (int j = 1; j <= half; j++) ans[i][j] = sum[i][j] - sum[i-1][j] - sum[i][j+1] + sum[i-1][j+1];
for (int i = 1; i <= half+1; i++) for (int j = half; j <= n; j++) sum[i][j] = ask(n, 1, i, j);
for (int i = 1; i <= half; i++) for (int j = half+1; j <= n; j++) ans[i][j] = sum[i][j] - sum[i+1][j] - sum[i][j-1] + sum[i+1][j-1];
for (int i = 1; i <= half+1; i++) for (int j = 1; j <= half+1; j++) sum[i][j] = ask(n, n, i, j);
for (int i = 1; i <= half; i++) for (int j = 1; j <= half; j++) ans[i][j] = sum[i][j] - sum[i+1][j] - sum[i][j+1] + sum[i+1][j+1];
cout << "END" << endl;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
cout << ans[i][j];
}
cout << endl;
}
// cout << (cnt <= 7 * n * n * n * n / 16 + n * n);
}