oj.uz

Submission #667909

# Submission time Handle Problem Language Result Execution time Memory
667909 2022-12-02T10:53:33 Z 600Mihnea Treasure (different grader from official contest) (CEOI13_treasure2) C++17
44 / 100
 1 ms 340 KB 
#include "treasure.h"
#include <bits/stdc++.h>

using namespace std;

int ask(int r1, int c1, int r2, int c2)
{
  return countTreasure(r1, c1, r2, c2);
}

const int N = 100 + 7;
int du[N][N];

void findTreasure(int n)
{
  for (int i = 1; i <= n; i++)
  {
    for (int j = 1; j <= n; j++)
    {
      du[i][j] = ask(1, 1, i, j);
    }
  }
  for (int i = 1; i <= n; i++)
  {
    for (int  j = 1; j <= n; j++)
    {
      int val_ij = du[i][j] - du[i - 1][j] - du[i][j - 1] + du[i - 1][j - 1];
      if (val_ij)
      {
        Report(i, j);
      }
    }
  }
}

Subtask #1
44.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Output is partially correct - N = 5, K = 425, score = 8
2 Partially correct 1 ms 212 KB Output is partially correct - N = 10, K = 7075, score = 4
3 Partially correct 0 ms 212 KB Output is partially correct - N = 15, K = 36450, score = 4
4 Partially correct 1 ms 212 KB Output is partially correct - N = 16, K = 47296, score = 4
5 Partially correct 0 ms 340 KB Output is partially correct - N = 55, K = 6782050, score = 4
6 Partially correct 0 ms 340 KB Output is partially correct - N = 66, K = 14090571, score = 4
7 Partially correct 1 ms 340 KB Output is partially correct - N = 77, K = 26140961, score = 4
8 Partially correct 1 ms 340 KB Output is partially correct - N = 88, K = 44642224, score = 4
9 Partially correct 1 ms 340 KB Output is partially correct - N = 99, K = 71566902, score = 4
10 Partially correct 1 ms 340 KB Output is partially correct - N = 100, K = 74507500, score = 4