oj.uz

Submission #27227

# Submission time Handle Problem Language Result Execution time Memory
27227 2017-07-11T07:25:08 Z TAMREF Treasure (different grader from official contest) (CEOI13_treasure2) C
3 / 100
 0 ms 1184 KB 
#include "treasure.h"
int x[101], y[101], t;
void findTreasure (int N) {
    int i,j;
    for(i=1;i<=N;i++){
        for(j=1;j<=N;j++){
            if(countTreasure(i,j,i,j)){
                x[t]=i,y[t++]=j;
            }
        }
    }
    for(i=0;i<t;i++) Report(x[i],y[i]);
}

Subtask #1
3.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 1184 KB Output is partially correct - N = 5, K = 625, score = 1
2 Partially correct 0 ms 1184 KB Output is partially correct - N = 10, K = 10000, score = 1
3 Partially correct 0 ms 1184 KB Output is partially correct - N = 15, K = 50625, score = 1
4 Incorrect 0 ms 1184 KB Invalid Access
5 Runtime error 0 ms 1184 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 0 ms 1184 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 0 ms 1184 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 0 ms 1184 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 0 ms 1184 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 0 ms 1184 KB Execution killed with signal 11 (could be triggered by violating memory limits)