Submission #1087479

#TimeUsernameProblemLanguageResultExecution timeMemory
1087479juicyTreasure (different grader from official contest) (CEOI13_treasure2)C++17
0 / 100
1 ms448 KiB
#include "treasure.h" #include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "debug.h" #else #define debug(...) 42 #endif int a[105][105]; void findTreasure(int n) { int m = n / 2; for (int i = n; i; --i) { for (int j = n; j; --j) { if (i <= m && j <= m) { a[i][j] = a[n][j] + a[i][n] + a[n][n] - countTreasure(i + 1, j + 1, n, n); } else if (i <= m && j > m) { a[i][j] = a[n][j] - countTreasure(i + 1, 1, n, j); } else if (j > m) { a[i][j] = countTreasure(1, 1, i, j); } else { a[i][j] = a[i][n] - countTreasure(1, j + 1, i, n); } } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (a[i][j] - a[i - 1][j] - a[i][j - 1] + a[i - 1][j - 1]) { Report(i, j); } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...