# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39585 | 2018-01-16T16:26:59 Z | cheater2k | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 2128 KB |
#include "treasure.h" #include <bits/stdc++.h> using namespace std; const int MAX = 105; int a[MAX][MAX]; void findTreasure(int n) { for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) a[i][j] = countTreasure(1, 1, i, j); } for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { if (a[i][j] - a[i - 1][j] - a[i][j - 1] + a[i - 1][j - 1]) { Report(i, j); } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 5, K = 425, score = 8 |
2 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 10, K = 7075, score = 4 |
3 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 15, K = 36450, score = 4 |
4 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 16, K = 47296, score = 4 |
5 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 55, K = 6782050, score = 4 |
6 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 66, K = 14090571, score = 4 |
7 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 77, K = 26140961, score = 4 |
8 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 88, K = 44642224, score = 4 |
9 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 99, K = 71566902, score = 4 |
10 | Partially correct | 0 ms | 2128 KB | Output is partially correct - N = 100, K = 74507500, score = 4 |