oj.uz

Submission #362688

# Submission time Handle Problem Language Result Execution time Memory
362688 2021-02-04T05:55:50 Z nighthallo Treasure (different grader from official contest) (CEOI13_treasure2) C++14
10 / 100
 1 ms 380 KB 
#include "treasure.h"

void findTreasure (int N) {
    int arr[101][101];

    for(int i = 1 ; i <= N ; i++){
        for(int j = 1 ; j <= N ; j++){
            arr[i][j] = countTreasure(i, j, i, j);
        }
    }
    for(int i = 1 ; i <= N ; i++){
        for(int j = 1 ; j <= N ; j++){
            if(arr[i][j] == 1){
                Report(i, j);
            }
        }
    }
}

Subtask #1
10.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 380 KB Output is partially correct - N = 5, K = 625, score = 1
2 Partially correct 0 ms 364 KB Output is partially correct - N = 10, K = 10000, score = 1
3 Partially correct 0 ms 364 KB Output is partially correct - N = 15, K = 50625, score = 1
4 Partially correct 0 ms 364 KB Output is partially correct - N = 16, K = 65536, score = 1
5 Partially correct 0 ms 364 KB Output is partially correct - N = 55, K = 9150625, score = 1
6 Partially correct 1 ms 364 KB Output is partially correct - N = 66, K = 18974736, score = 1
7 Partially correct 1 ms 364 KB Output is partially correct - N = 77, K = 35153041, score = 1
8 Partially correct 1 ms 364 KB Output is partially correct - N = 88, K = 59969536, score = 1
9 Partially correct 1 ms 364 KB Output is partially correct - N = 99, K = 96059601, score = 1
10 Partially correct 1 ms 364 KB Output is partially correct - N = 100, K = 100000000, score = 1