Submission #246374

#TimeUsernameProblemLanguageResultExecution timeMemory
246374thecodingwizardTreasure (different grader from official contest) (CEOI13_treasure2)C++11
0 / 100
5 ms384 KiB
#include <bits/stdc++.h> #include "treasure.h" using namespace std; void findTreasure (int n) { int ps[n+1][n+1]; for (int i = n; i >= 1; i--) { for (int j = n; j >= 1; j--) { if (i>=n/2&&j>=n/2) { ps[i][j] = countTreasure(1, 1, i, j); } else if (i >= n/2) { ps[i][j] = ps[i][n] - countTreasure(1, j+1, i, n); } else if (j >= n/2) { ps[i][j] = ps[n][j] - countTreasure(i+1, 1, n, j); } else { ps[i][j] = ps[i][n] + ps[n][j] + countTreasure(i+1, j+1, n, n) - ps[n][n]; } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (ps[i][j] - ps[i-1][j] - ps[i][j-1] + ps[i-1][j-1] == 1) Report(i, j); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...