| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 78579 | stefdasca | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 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;
bool a[102][102];
void Divide(int L1, int C1, int L2, int C2, int qt)
{
if(qt == (L2 - L1 + 1) * (C2 - C1 + 1))
{
for(int i = L1; i <= L2; ++i)
for(int j = C1; j <= C2; ++j)
Report(i, j);
return;
}
int midd = (L1 + L2) / 2;
int midd2 = (C1 + C2) / 2;
int rasp[5], sum = 0;
cout << L1 << " " << C1 << " " << midd << " " << midd2 << endl;
cin >> rasp[1];
sum += rasp[1];
if(rasp[1] != 0)
Divide(L1, C1, midd, midd2, rasp[1]);
if(sum == qt)
return;
cout << L1 << " " << midd2 + 1 << " " << midd << " " << C2 << endl;
cin >> rasp[2];
sum += rasp[2];
if(rasp[2] != 0)
Divide(L1, midd2 + 1, midd, C2, rasp[2]);
if(sum == qt)
return;
cout << midd + 1 << " " << C1 << " " << L2 << " " << midd2 << endl;
cin >> rasp[3];
if(rasp[3] != 0)
Divide(midd + 1, C1, L2, midd2, rasp[3]);
sum += rasp[3];
if(sum == qt)
return;
if(qt - sum != 0)
Divide(midd + 1, midd2 + 1, L2, C2, qt - sum);
}
void findTreasure(N)
{
int sol;
cout << 1 << " " << 1 << " " << n << " " << n << endl;
cin >> sol;
Divide(1, 1, n, n,sol);
cout << "END" << endl;
}