# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39441 | 2018-01-15T07:46:14 Z | smu201111192 | Treasure (different grader from official contest) (CEOI13_treasure2) | C++14 | 0 ms | 2168 KB |
#include "treasure.h" #include <cstdio> #include <iostream> int dp[105][105]; int chk[105][105]; int g(int y1,int x1,int y2,int x2){ return dp[y2][x2] - dp[y1-1][x2] - dp[y2][x1-1] + dp[y1-1][x1-1]; } void findTreasure (int N) { //if(cnt > 0) Report (1, 1); if(N <= 5){ for(int i=1;i<=N;i++){ for(int j=1;j<=N;j++){ int cnt = countTreasure(i, j, i, j); chk[i][j] = 1; } } for(int i=1;i<=N;i++){ for(int j=1;j<=N;j++){ if(chk[i][j]) Report(i,j); } } return; } for(int i=1;i<=N;i++){ for(int j=1;j<=N;j++){ int cnt = countTreasure(1,1,i,j); dp[i][j] = cnt; } } for(int i=1;i<=N;i++){ for(int j=1;j<=N;j++){ if(g(i,j,i,j)){ Report(1,1); } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2168 KB | Invalid Access |
2 | Incorrect | 0 ms | 2168 KB | Invalid Access |
3 | Incorrect | 0 ms | 2168 KB | Invalid Access |
4 | Incorrect | 0 ms | 2168 KB | Invalid Access |
5 | Incorrect | 0 ms | 2168 KB | Invalid Access |
6 | Incorrect | 0 ms | 2168 KB | Invalid Access |
7 | Incorrect | 0 ms | 2168 KB | Invalid Access |
8 | Incorrect | 0 ms | 2168 KB | Invalid Access |
9 | Incorrect | 0 ms | 2168 KB | Invalid Access |
10 | Incorrect | 0 ms | 2168 KB | Invalid Access |