oj.uz

답안 #362687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362687 2021-02-04T05:55:24 Z nighthallo 보물 찾기 (CEOI13_treasure2) C++14
0 / 100
 1 ms 364 KB 
#include "treasure.h"

void findTreasure (int N) {
    int arr[101][101];

    for(int i = 1 ; i <= N ; i++){
        for(int j = 1 ; j <= N ; j++){
            arr[i][j] = countTreasure(i, j, i, j);
        }
    }
    for(int i = 1 ; i <= N ; i++){
        for(int j = 1 ; j <= N ; j++){
            if(arr[101][101] == 1){
                Report(i, j);
            }
        }
    }
}

Compilation message

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:13:28: warning: array subscript 101 is above array bounds of 'int [101]' [-Warray-bounds]
   13 |             if(arr[101][101] == 1){
      |                ~~~~~~~~~~~~^

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 364 KB Error - not all of the treasure cells have been reported
2 Incorrect 0 ms 364 KB Error - not all of the treasure cells have been reported
3 Incorrect 0 ms 364 KB Error - not all of the treasure cells have been reported
4 Incorrect 1 ms 364 KB Error - not all of the treasure cells have been reported
5 Incorrect 1 ms 364 KB Error - not all of the treasure cells have been reported
6 Incorrect 0 ms 364 KB Error - not all of the treasure cells have been reported
7 Incorrect 1 ms 364 KB Error - not all of the treasure cells have been reported
8 Incorrect 1 ms 364 KB Error - not all of the treasure cells have been reported
9 Incorrect 1 ms 364 KB Error - not all of the treasure cells have been reported
10 Incorrect 1 ms 364 KB Error - not all of the treasure cells have been reported