# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
224292 | MKopchev | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 6 ms | 512 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>
#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);
}
*/
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |