# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94704 | 2019-01-23T06:24:03 Z | tgc333 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 2 ms | 376 KB |
#include <iostream> #include "treasure.h" using namespace std; int map[100][100] = { 0 }; void findTreasure(int N) { int x = 1; int y = 1; int cnt = countTreasure(y, x, N, N); for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (countTreasure(i, j, i, j)) map[i][j] = 1; } } for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { if (map[i][j] == 1) Report(i, j); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 5, K = 626, score = 0 |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 10, K = 10001, score = 0 |
3 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 15, K = 50626, score = 0 |
4 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 16, K = 65537, score = 0 |
5 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 55, K = 9150626, score = 0 |
6 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 66, K = 18974737, score = 0 |
7 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 77, K = 35153042, score = 0 |
8 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 88, K = 59969537, score = 0 |
9 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 99, K = 96059602, score = 0 |
10 | Incorrect | 2 ms | 376 KB | Output isn't correct - N = 100, K = 100000001, score = 0 |