Submission #54745

#	Time	Username	Problem	Language	Result	Execution time	Memory
54745		gs18115	보물 찾기 (CEOI13_treasure2)	C++14	100 / 100	3 ms	740 KiB

treasure

#include"treasure.h"
#include<cstdlib>
#include<vector>
using namespace std;
vector<pair<int,int> >V;
int P[123][123];
void findTreasure(int N)
{
  int i,j;
  int mid=N>>1;
  for(i=N;i>0;i--)
  {
    for(j=N;j>0;j--)
    {
      if(i>mid&&j>mid)
        P[i][j]=countTreasure(1,1,i,j);
      else if(i>mid)
        P[i][j]=P[i][N]-countTreasure(1,j+1,i,N);
      else if(j>mid)
        P[i][j]=P[N][j]-countTreasure(i+1,1,N,j);
      else
        P[i][j]=P[i][N]+P[N][j]-P[N][N]+countTreasure(i+1,j+1,N,N);
    }
  }
  for(i=N;i>0;i--)
    for(j=N;j>0;j--)
      if(P[i][j]-P[i-1][j]-P[i][j-1]+P[i-1][j-1])
        V.push_back(make_pair(i,j));
  for(auto I:V)
    Report(I.first,I.second);
  return;
}

• Subtask 1: 100 / 100