Submission #111884

#TimeUsernameProblemLanguageResultExecution timeMemory
111884RezwanArefin01Treasure (different grader from official contest) (CEOI13_treasure2)C++17
100 / 100
4 ms384 KiB
#include "treasure.h" int s[101][101]; 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) { s[i][j] = countTreasure(1, 1, i, j); } if(i > N / 2 && j <= N / 2) { s[i][j] = s[i][N] - countTreasure(1, j + 1, i, N); } if(i <= N / 2 && j > N / 2) { s[i][j] = s[N][j] - countTreasure(i + 1, 1, N, j); } if(i <= N / 2 && j <= N / 2) { s[i][j] = countTreasure(i + 1, j + 1, N, N) + s[i][N] + s[N][j] - s[N][N]; } } } for(int i = 1; i <= N; ++i) { for(int j = 1; j <= N; ++j) { if(s[i][j] - s[i - 1][j] - s[i][j - 1] + s[i - 1][j - 1]) { Report(i, j); } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...