# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
475715 | 2021-09-23T19:11:25 Z | soba | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 1 ms | 332 KB |
#include "treasure.h" #include <bits/stdc++.h> //#include "grader.c" void findTreasure (int N) { int grid[N+1][N+1]; int prfx[N+1][N+1]={0}; int cnt , ans; for(int i = 1 ; i <=N ; i++) { for(int j = 1 ; j <= N ; j++) { cnt=countTreasure(1,1,i,j); prfx[i][j]=cnt; grid[i][j]=prfx[i][j]-prfx[i-1][j]-prfx[i][j-1]+prfx[i-1][j-1]; } } for(int i = 1 ; i <= N ; i++ ) { for(int j =1 ; j <= N ; j++) { if(grid[i][j]==1) Report(i, j); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Error - not all of the treasure cells have been reported |
2 | Partially correct | 0 ms | 296 KB | Output is partially correct - N = 10, K = 7075, score = 4 |
3 | Incorrect | 1 ms | 204 KB | Error - not all of the treasure cells have been reported |
4 | Incorrect | 0 ms | 204 KB | Error - not all of the treasure cells have been reported |
5 | Partially correct | 1 ms | 332 KB | Output is partially correct - N = 55, K = 6782050, score = 4 |
6 | Partially correct | 1 ms | 332 KB | Output is partially correct - N = 66, K = 14090571, score = 4 |
7 | Partially correct | 1 ms | 332 KB | Output is partially correct - N = 77, K = 26140961, score = 4 |
8 | Partially correct | 1 ms | 332 KB | Output is partially correct - N = 88, K = 44642224, score = 4 |
9 | Partially correct | 1 ms | 332 KB | Output is partially correct - N = 99, K = 71566902, score = 4 |
10 | Partially correct | 1 ms | 332 KB | Output is partially correct - N = 100, K = 74507500, score = 4 |