oj.uz

Submission #14821

# Submission time Handle Problem Language Result Execution time Memory
14821 2015-06-28T07:21:02 Z eaststar Treasure (different grader from official contest) (CEOI13_treasure2) C++
100 / 100
 0 ms 1232 KB 
#include "treasure.h"
int s[110][110];
void findTreasure(int N){
    int i,j;
    for(i=N;i>0;--i){
        for(j=N;j>0;--j){
            if(i>N/2){
                if(j>N/2)s[i][j]=countTreasure(1,1,i,j);
                else s[i][j]=s[i][N]-countTreasure(1,j+1,i,N);
            }
            else{
                if(j>N/2)s[i][j]=s[N][j]-countTreasure(i+1,1,N,j);
                else s[i][j]=-s[N][N]+s[i][N]+s[N][j]+countTreasure(i+1,j+1,N,N);
            }
        }
    }
    for(i=1;i<=N;++i){
        for(j=1;j<=N;++j)if(s[i][j]-s[i-1][j]-s[i][j-1]+s[i-1][j-1])Report(i,j);
    }
}

Compilation message

grader.c: In function 'int main()':
grader.c:63:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         my_assert(strlen(A[i]+1) == N, "each line of the map must contain N zeroes or ones (before loop)");
                                  ^

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1232 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 0 ms 1232 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 0 ms 1232 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 0 ms 1232 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 0 ms 1232 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 0 ms 1232 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 0 ms 1232 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 0 ms 1232 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 0 ms 1232 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 0 ms 1232 KB Output is correct - N = 100, K = 43760000, score = 10