oj.uz

Submission #667922

# Submission time Handle Problem Language Result Execution time Memory
667922 2022-12-02T11:36:11 Z 600Mihnea Treasure (different grader from official contest) (CEOI13_treasure2) C++17
80 / 100
 1 ms 468 KB 
#include "treasure.h"
#include <bits/stdc++.h>

using namespace std;

int ask(int r1, int c1, int r2, int c2)
{
  if (r1 > r2 || c1 > c2)
  {
    return 0;
  }
  return countTreasure(r1, c1, r2, c2);
}

const int N = 100 + 7;
int ul[N][N];
int ur[N][N];
int dl[N][N];
int dr[N][N];

void findTreasure(int n)
{
  int total = ask(1, 1, n, n);
  int half = (n + 1) / 2;
  for (int i = 1; i <= half; i++)
  {
    for (int j = 1; j <= half; j++)
    {
      dr[i][j] = ask(i, j, n, n); /// pe [1, half] and [1, half]
    }
  }
  for (int i = half; i <= n; i++)
  {
    for (int j = 1; j <= half; j++)
    {
      ur[i][j] = ask(1, j, i, n); /// pe [half + 1, n] and [1, half]
    }
  }

  for (int i = half; i <= n; i++)
  {
    for (int j = half; j <= n; j++)
    {
      ul[i][j] = ask(1, 1, i, j); /// pe [half + 1, n] and [half + 1, n]
    }
  }

  for (int i = 1; i <= half + 1; i++)
  {
    for (int j = half; j <= n; j++)
    {
      dl[i][j] = ask(i, 1, n, j); /// pe [1, half] and [half + 1, n]
    }
  }

  for (int i = 1; i <= half; i++)
  {
    for (int j = 1; j < half; j++)
    {
      dl[i][j] = dl[i][n] - dr[i][j + 1];
    }
  }

  for (int i = half; i <= n; i++)
  {
    for (int j = 1; j < half; j++)
    {
      ul[i][j] = ul[i][n] - ur[i][j + 1];
    }
  }

  for (int i = 1; i <= half - 1; i++)
  {
    for (int j = 1; j <= n; j++)
    {
      ul[i][j] = ul[n][j] - dl[i + 1][j];
    }
  }


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

Compilation message

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:23:7: warning: unused variable 'total' [-Wunused-variable]
   23 |   int total = ask(1, 1, n, n);
      |       ^~~~~

Subtask #1
80.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 212 KB Output is partially correct - N = 5, K = 415, score = 8
2 Partially correct 1 ms 340 KB Output is partially correct - N = 10, K = 5378, score = 8
3 Partially correct 0 ms 340 KB Output is partially correct - N = 15, K = 25165, score = 8
4 Partially correct 0 ms 340 KB Output is partially correct - N = 16, K = 32459, score = 8
5 Partially correct 1 ms 340 KB Output is partially correct - N = 55, K = 4141915, score = 8
6 Partially correct 1 ms 340 KB Output is partially correct - N = 66, K = 8542284, score = 8
7 Partially correct 1 ms 340 KB Output is partially correct - N = 77, K = 15756859, score = 8
8 Partially correct 1 ms 468 KB Output is partially correct - N = 88, K = 26803175, score = 8
9 Partially correct 1 ms 468 KB Output is partially correct - N = 99, K = 42825076, score = 8
10 Partially correct 1 ms 468 KB Output is partially correct - N = 100, K = 44579003, score = 8