oj.uz

Submission #1087485

# Submission time Handle Problem Language Result Execution time Memory
1087485 2024-09-12T18:25:15 Z juicy Treasure (different grader from official contest) (CEOI13_treasure2) C++17
100 / 100
 1 ms 440 KB 
#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);
      }
    }
  }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 0 ms 348 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 0 ms 348 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 0 ms 348 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 0 ms 344 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 0 ms 440 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 0 ms 348 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 0 ms 344 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 0 ms 348 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 1 ms 348 KB Output is correct - N = 100, K = 43760000, score = 10