Submission #155049

#TimeUsernameProblemLanguageResultExecution timeMemory
155049kitohaTreasure (different grader from official contest) (CEOI13_treasure2)C++14
100 / 100
2 ms504 KiB
#include "treasure.h" const int MAXN = 150; int sum[MAXN][MAXN]; void findTreasure(int N) { for (int i = N; i >= 1; i--) { for (int j = N; j >= 1; j--) { if (i > N / 2 && j > N / 2) { sum[i][j] = countTreasure(1, 1, i, j); } else if (i > N / 2 && j <= N / 2) { sum[i][j] = sum[i][N] - countTreasure(1, j+1, i, N); } else if (i <= N / 2 && j > N / 2) { sum[i][j] = sum[N][j] - countTreasure(i + 1, 1, N, j); } else if (i <= N / 2 && j <= N / 2) { sum[i][j] = sum[N][j] + sum[i][N] + countTreasure(i + 1, j + 1, N, N) - sum[N][N]; } } } for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { int tmp = sum[i][j] - sum[i][j - 1] - sum[i - 1][j] + sum[i - 1][j - 1]; if (tmp) { Report(i, j); } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...