oj.uz

답안 #27228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
27228 2017-07-11T07:25:47 Z TAMREF 보물 찾기 (CEOI13_treasure2) C++11
10 / 100
 0 ms 1260 KB 
#include "treasure.h"
int x[10001], y[10001], t;
void findTreasure (int N) {
    int i,j;
    for(i=1;i<=N;i++){
        for(j=1;j<=N;j++){
            if(countTreasure(i,j,i,j)){
                x[t]=i,y[t++]=j;
            }
        }
    }
    for(i=0;i<t;i++) Report(x[i],y[i]);
}

Compilation message

grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
                                  ^

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 1260 KB Output is partially correct - N = 5, K = 625, score = 1
2 Partially correct 0 ms 1260 KB Output is partially correct - N = 10, K = 10000, score = 1
3 Partially correct 0 ms 1260 KB Output is partially correct - N = 15, K = 50625, score = 1
4 Partially correct 0 ms 1260 KB Output is partially correct - N = 16, K = 65536, score = 1
5 Partially correct 0 ms 1260 KB Output is partially correct - N = 55, K = 9150625, score = 1
6 Partially correct 0 ms 1260 KB Output is partially correct - N = 66, K = 18974736, score = 1
7 Partially correct 0 ms 1260 KB Output is partially correct - N = 77, K = 35153041, score = 1
8 Partially correct 0 ms 1260 KB Output is partially correct - N = 88, K = 59969536, score = 1
9 Partially correct 0 ms 1260 KB Output is partially correct - N = 99, K = 96059601, score = 1
10 Partially correct 0 ms 1260 KB Output is partially correct - N = 100, K = 100000000, score = 1