제출 #224292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
224292		MKopchev	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	44 / 100	6 ms	512 KiB

treasure

#include<bits/stdc++.h>
#include "treasure.h"
using namespace std;

const int nmax=100+42;

int n;

bool output[nmax][nmax];

int pref[nmax][nmax];
/*
int countTreasure(int x1,int y1,int x2,int y2)
{
    cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
    int ret;
    cin>>ret;
    return ret;
}

void Report(int i,int j)
{
    cout<<"treasure: "<<i<<" "<<j<<endl;
}
*/

void findTreasure(int N)
{
    n=N;

    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            pref[i][j]=countTreasure(1,1,i,j);

    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            int now=pref[i][j]-pref[i-1][j]-pref[i][j-1]+pref[i-1][j-1];
            output[i][j]=now;
        }


    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            if(output[i][j])Report(i,j);
}
/*
int main()
{
    findTreasure(2);
}
*/

• Subtask 1: 44 / 100