# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
39429 | 2018-01-15T06:22:47 Z | ykmyou | 보물 찾기 (CEOI13_treasure2) | C++14 | 0 ms | 1220 KB |
#include "treasure.h" const int N = 101; int tCnt[N][N]; void findTreasure (int n) { for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { tCnt[i][j] = countTreasure(1, 1, i, j); } } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (tCnt[i][j] - tCnt[i - 1][j] - tCnt[i][j - 1] + tCnt[i - 1][j - 1]) { Report(i, j); } } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 5, K = 425, score = 8 |
2 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 10, K = 7075, score = 4 |
3 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 15, K = 36450, score = 4 |
4 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 16, K = 47296, score = 4 |
5 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 55, K = 6782050, score = 4 |
6 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 66, K = 14090571, score = 4 |
7 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 77, K = 26140961, score = 4 |
8 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 88, K = 44642224, score = 4 |
9 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 99, K = 71566902, score = 4 |
10 | Partially correct | 0 ms | 1220 KB | Output is partially correct - N = 100, K = 74507500, score = 4 |