제출 #78582

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
78582		stefdasca	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	0 / 100	2 ms	524 KiB

treasure

#include<bits/stdc++.h>
#include "treasure.h"
using namespace std;
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, sum = 0;
    cout << L1 << " " << C1 << " " << midd << " " << midd2 << endl;
    cin >> rasp;
    sum += rasp;
    if(rasp != 0)
        Divide(L1, C1, midd, midd2, rasp);
    if(sum == qt)
        return;
    cout << L1 << " " << midd2 + 1 << " " << midd << " " << C2 << endl;
    cin >> rasp;
    sum += rasp;
    if(rasp != 0)
        Divide(L1, midd2 + 1, midd, C2, rasp);
    if(sum == qt)
        return;
    cout << midd + 1 << " " << C1 << " " << L2 << " " << midd2 << endl;
    cin >> rasp;
    if(rasp != 0)
        Divide(midd + 1, C1, L2, midd2, rasp);
    sum += rasp;
    if(sum == qt)
        return;
    if(qt - sum != 0)
        Divide(midd + 1, midd2 + 1, L2, C2, qt - sum);
}
void findTreasure(int N)
{
    int sol;
    cout << 1 << " " << 1 << " " << N << " " << N << endl;
    cin >> sol;
    Divide(1, 1, N, N, sol);
    cout << "END" << endl;
    return;
}

• Subtask 1: 0 / 100