제출 #224359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
224359		MKopchev	보물 찾기 (CEOI13_treasure2)	C++14	100 / 100	9 ms	1024 KiB

treasure

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

const int nmax=100+42;

int n;
/*
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;
}
*/
map< pair< pair<int,int>, pair<int,int> > ,int> seen;

int ask(int x1,int y1,int x2,int y2)
{
    if(x1>x2||y1>y2)return 0;

    pair< pair<int,int>, pair<int,int> > state={{x1,y1},{x2,y2}};

    if(seen.count(state)==0)seen[state]=countTreasure(x1,y1,x2,y2);

    return seen[state];
}

int pref[nmax][nmax];

void findTreasure(int N)
{
    n=N;

    for(int i=n;i>=1;i--)
        for(int j=n;j>=1;j--)
        {
            if(i>n/2&&j>n/2)pref[i][j]=ask(1,1,i,j);
            else if(i>n/2)pref[i][j]=pref[i][n]-ask(1,j+1,i,n);
            else if(i<=n/2&&j>n/2)pref[i][j]=pref[n][j]-ask(i+1,1,n,j);
            else pref[i][j]=pref[i][n]+pref[n][j]+ask(i+1,j+1,n,n)-pref[n][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])Report(i,j);
}
/*
int main()
{
    findTreasure(2);
}
*/

• Subtask 1: 100 / 100