oj.uz

Submission #27230

# Submission time Handle Problem Language Result Execution time Memory
27230 2017-07-11T08:17:38 Z TAMREF Treasure (different grader from official contest) (CEOI13_treasure2) C
44 / 100
 0 ms 1264 KB 
#include "treasure.h"
int mark[101][101],psum[101][101];
void findTreasure(int N){
    int i,j;
    for(i=1;i<=2*N;i++){
        for(j=i>N?i-N:1;j<(i>N?N+1:i);j++){
            psum[i-j][j]=countTreasure(1,1,i-j,j);
            mark[i-j][j]=psum[i-j][j]-psum[i-j-1][j]-psum[i-j][j-1]+psum[i-j-1][j-1];
        }
    }
    for(i=1;i<=N;i++)
        for(j=1;j<=N;j++)
            if(mark[i][j]) Report(i,j);
}

Subtask #1
44.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 1264 KB Output is partially correct - N = 5, K = 425, score = 8
2 Partially correct 0 ms 1264 KB Output is partially correct - N = 10, K = 7075, score = 4
3 Partially correct 0 ms 1264 KB Output is partially correct - N = 15, K = 36450, score = 4
4 Partially correct 0 ms 1264 KB Output is partially correct - N = 16, K = 47296, score = 4
5 Partially correct 0 ms 1264 KB Output is partially correct - N = 55, K = 6782050, score = 4
6 Partially correct 0 ms 1264 KB Output is partially correct - N = 66, K = 14090571, score = 4
7 Partially correct 0 ms 1264 KB Output is partially correct - N = 77, K = 26140961, score = 4
8 Partially correct 0 ms 1264 KB Output is partially correct - N = 88, K = 44642224, score = 4
9 Partially correct 0 ms 1264 KB Output is partially correct - N = 99, K = 71566902, score = 4
10 Partially correct 0 ms 1264 KB Output is partially correct - N = 100, K = 74507500, score = 4