답안 #999300

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
999300	2024-06-15T09:36:38 Z	MilosMilutinovic	보물 찾기 (CEOI13_treasure2)	C++14	컴파일 오류	0 ms	0 KB

treasure

#include "treasure.h"
#include <bits/stdc++.h>
 
using namespace std;

const int MAX = 111;

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

Compilation message

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:16:21: error: 'Ask' was not declared in this scope
   16 |         val[i][j] = Ask(1, i, 1, j);
      |                     ^~~
treasure.cpp:18:33: error: 'Ask' was not declared in this scope
   18 |         val[i][j] = val[i][N] - Ask(1, j + 1, i, N);
      |                                 ^~~
treasure.cpp:20:33: error: 'Ask' was not declared in this scope
   20 |         val[i][j] = val[N][j] - Ask(i + 1, 1, N, j);
      |                                 ^~~
treasure.cpp:22:55: error: 'Ask' was not declared in this scope
   22 |         val[i][j] = -(total - val[i][N] - val[N][j] - Ask(i + 1, j + 1, N, N));
      |                                                       ^~~