oj.uz

Submission #5751

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

int Check[101][101];

void Quad_Search(int ly, int lx, int ry, int rx)
{
    int midy=(ly+ry)/2, midx=(lx+rx)/2;

    if(ly==ry && lx==rx)
        Check[ly][lx]=1;
    else
    {
        if(countTreasure(ly,lx,midy,midx))
            Quad_Search(ly,lx,midy,midx);
        if(countTreasure(ly,midx+1,midy,rx))
            Quad_Search(ly,midx+1,midy,rx);
        if(countTreasure(midy+1,rx,ry,midx))
            Quad_Search(midy+1,rx,ry,midx);
        if(countTreasure(midy+1,midx+1,ry,rx))
            Quad_Search(midy+1,midx+1,ry,rx);
    }
}

void findTreasure(int N)
{
    int i, j;

    Quad_Search(1,1,N,N);
    for(i=1 ; i<=N ; i++)
        for(j=1 ; j<=N ; j++)
            if(Check[i][j])
                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
0.0 / 100.0

# 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