# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7028 | 2014-07-12T16:28:50 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;i<=N;i++)for(j=N/2;j<=N;j++)a[i][j]=countTreasure(1,1,i,j); for(i=1;i<N/2;i++)for(j=N/2;j<=N;j++)a[i][j]=a[N][j]-countTreasure(i+1,1,N,j); for(i=N/2;i<=N;i++)for(j=1;j<=N;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 | Incorrect | 0 ms | 1224 KB | Invalid Access |
2 | Incorrect | 0 ms | 1224 KB | Invalid Access |
3 | Incorrect | 0 ms | 1224 KB | Invalid Access |
4 | Incorrect | 0 ms | 1224 KB | Invalid Access |
5 | Incorrect | 0 ms | 1224 KB | Invalid Access |
6 | Incorrect | 0 ms | 1224 KB | Invalid Access |
7 | Incorrect | 0 ms | 1224 KB | Invalid Access |
8 | Incorrect | 0 ms | 1224 KB | Invalid Access |
9 | Incorrect | 0 ms | 1224 KB | Invalid Access |
10 | Incorrect | 0 ms | 1224 KB | Invalid Access |