Submission #94817

#TimeUsernameProblemLanguageResultExecution timeMemory
94817wogns1026Treasure (different grader from official contest) (CEOI13_treasure2)C++14
0 / 100
2 ms376 KiB
#include "treasure.h" struct Node { int x; int y; }; Node ans[10001]; int idx = 0; void findTreasure(int N) { int total = countTreasure(1, 1, N, N); int num = 0; for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (i <= N / 2 && j <= N / 2) { num = countTreasure(i, j, N, N) - (countTreasure(i + 1, j, N, N) + countTreasure(i, j + 1, N, N)) + countTreasure(i + 1, j + 1, N, N); if (num) ans[idx].x = i, ans[idx].y = j, idx++; } else if (i <= N / 2 && j > N / 2) { num = countTreasure(i, 1, N, j) - (countTreasure(i + 1, 1, N, j) + countTreasure(i, 1, N, j - 1)) + countTreasure(i + 1, 1, N, j - 1); if (num) ans[idx].x = i, ans[idx].y = j, idx++; } else if (i > N / 2 && j <= N / 2) { num = countTreasure(1, j, i, N) - (countTreasure(1, j, i - 1, N) + countTreasure(1, j + 1, i, N)) + countTreasure(1, j + 1, i - 1, N); if (num) ans[idx].x = i, ans[idx].y = j, idx++; } else if (i > N / 2 && j > N / 2) { num = countTreasure(1, 1, i, j) - (countTreasure(1, 1, i - 1, j) + countTreasure(1, 1, i, j - 1)) + countTreasure(1, 1, i - 1, j - 1); if (num) ans[idx].x = i, ans[idx].y = j, idx++; } } } for (int i = 0; i < idx; i++) { Report(ans[i].x, ans[i].y); } }

Compilation message (stderr)

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:12:6: warning: unused variable 'total' [-Wunused-variable]
  int total = countTreasure(1, 1, N, N);
      ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...