# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7030 | 2014-07-12T16:31:36 Z | gs13068 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++ | 0 ms | 1224 KB |
#include "treasure.h" int a[101][101]; void findTreasure(int N) { int i,j,T; for(i=N/2+1;i<=N;i++)for(j=N/2+1;j<=N;j++)a[i][j]=countTreasure(1,1,i,j); for(i=1;i<=N/2;i++)for(j=N/2+1;j<=N;j++)a[i][j]=a[N][j]-countTreasure(i+1,1,N,j); for(i=N/2+1;i<=N;i++)for(j=1;j<=N/2;j++)a[i][j]=a[i][N]-countTreasure(1,j+1,i,N); for(i=1;i<=N/2;i++)for(j=1;j<=N/2;j++)a[i][j]=a[i][N]+a[N][j]+countTreasure(i+1,j+1,N,N)-a[N][N]; for(i=1;i<=N;i++)for(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 | Correct | 0 ms | 1224 KB | Output is correct - N = 5, K = 289, score = 10 |
2 | Correct | 0 ms | 1224 KB | Output is correct - N = 10, K = 4475, score = 10 |
3 | Correct | 0 ms | 1224 KB | Output is correct - N = 15, K = 22289, score = 10 |
4 | Correct | 0 ms | 1224 KB | Output is correct - N = 16, K = 28928, score = 10 |
5 | Correct | 0 ms | 1224 KB | Output is correct - N = 55, K = 4005289, score = 10 |
6 | Correct | 0 ms | 1224 KB | Output is correct - N = 66, K = 8305803, score = 10 |
7 | Correct | 0 ms | 1224 KB | Output is correct - N = 77, K = 15383161, score = 10 |
8 | Correct | 0 ms | 1224 KB | Output is correct - N = 88, K = 26244416, score = 10 |
9 | Correct | 0 ms | 1224 KB | Output is correct - N = 99, K = 42032201, score = 10 |
10 | Correct | 0 ms | 1224 KB | Output is correct - N = 100, K = 43760000, score = 10 |