oj.uz

Submission #5755

# Submission time Handle Problem Language Result Execution time Memory
5755 2014-05-16T11:05:35 Z baneling100 Treasure (different grader from official contest) (CEOI13_treasure2) C++
48 / 100
 0 ms 1224 KB 
#include "treasure.h"

int D[101][101];

void findTreasure(int N)
{
    int i, j, mid=N/2;

    for(i=N ; i>=1 ; i--)
        for(j=N ; j>=1 ; j--)
        {
            if(i<=mid && j<=mid)
                D[i][j]=D[i][N]+D[N][j]+countTreasure(i+1,j+1,N,N)-D[N][N];
            else
                D[i][j]=countTreasure(1,1,i,j);
        }
    for(i=1 ; i<=N ; i++)
        for(j=1 ; j<=N ; j++)
            if(D[i][j]-D[i-1][j]-D[i][j-1]+D[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
48.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1224 KB Output is partially correct - N = 5, K = 385, score = 8
2 Incorrect 0 ms 1224 KB Output is partially correct - N = 10, K = 6075, score = 8
3 Incorrect 0 ms 1224 KB Output is partially correct - N = 15, K = 31305, score = 4
4 Incorrect 0 ms 1224 KB Output is partially correct - N = 16, K = 40128, score = 4
5 Incorrect 0 ms 1224 KB Output is partially correct - N = 55, K = 5699485, score = 4
6 Incorrect 0 ms 1224 KB Output is partially correct - N = 66, K = 11790603, score = 4
7 Incorrect 0 ms 1224 KB Output is partially correct - N = 77, K = 21915817, score = 4
8 Incorrect 0 ms 1224 KB Output is partially correct - N = 88, K = 37316400, score = 4
9 Incorrect 0 ms 1224 KB Output is partially correct - N = 99, K = 59919651, score = 4
10 Incorrect 0 ms 1224 KB Output is partially correct - N = 100, K = 62257500, score = 4