oj.uz

답안 #54745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
54745 2018-07-05T00:20:49 Z gs18115 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 3 ms 740 KB 
#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.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 2 ms 484 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 2 ms 484 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 2 ms 484 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 2 ms 484 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 2 ms 492 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 2 ms 620 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 2 ms 740 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 3 ms 740 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 2 ms 740 KB Output is correct - N = 100, K = 43760000, score = 10