oj.uz

답안 #999307

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
999307 2024-06-15T09:40:17 Z MilosMilutinovic 보물 찾기 (CEOI13_treasure2) C++14
36 / 100
 1 ms 348 KB 
#include "treasure.h"
#include <bits/stdc++.h>
 
using namespace std;

const int MAX = 111;

int val[MAX][MAX];
 
void findTreasure(int N) {
  int mid = N / 2;
  for (int i = N; i >= 1; i--) {
    for (int j = N; j >= 1; j--) {
      if (i == 1 && j == 1) {
        continue;
      }
      if (i >= mid && j >= mid) {
        val[i][j] = countTreasure(1, 1, i, j);
      } else if (i >= mid && j < mid) {
        val[i][j] = val[i][N] - countTreasure(1, j + 1, i, N);
      } else if (i < mid && j >= mid) {
        val[i][j] = val[N][j] - countTreasure(i + 1, 1, N, j);
      } else {
        val[i][j] = -(val[N][N] - val[i][N] - val[N][j] - countTreasure(i + 1, j + 1, N, N));
      }
    }
  }
  int total = val[N][N];
  for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= N; j++) {
      if (i == 1 && j == 1) {
        continue;
      }
      int c = val[i][j] - val[i - 1][j] - val[i][j - 1] + val[i - 1][j - 1];
      if (c == 1) {
        Report(i, j);
        total -= 1;
      }
    }
  }
  if (total > 0) {
    Report(1, 1);
  }
}

Subtask #1
36.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Error - no treasure at (r, c) : r = 2, c = 1
2 Incorrect 0 ms 348 KB Error - not all of the treasure cells have been reported
3 Partially correct 0 ms 348 KB Output is partially correct - N = 15, K = 22596, score = 8
4 Correct 0 ms 348 KB Output is correct - N = 16, K = 28896, score = 10
5 Incorrect 0 ms 348 KB Error - no treasure at (r, c) : r = 2, c = 1
6 Correct 0 ms 348 KB Output is correct - N = 66, K = 8305671, score = 10
7 Partially correct 1 ms 344 KB Output is partially correct - N = 77, K = 15391900, score = 8
8 Incorrect 0 ms 348 KB Error - not all of the treasure cells have been reported
9 Incorrect 0 ms 348 KB Error - no treasure at (r, c) : r = 1, c = 2
10 Incorrect 0 ms 348 KB Error - not all of the treasure cells have been reported