oj.uz

Submission #111884

# Submission time Handle Problem Language Result Execution time Memory
111884 2019-05-16T15:51:19 Z RezwanArefin01 Treasure (different grader from official contest) (CEOI13_treasure2) C++17
100 / 100
 4 ms 384 KB 
#include "treasure.h"

int s[101][101]; 

void findTreasure(int N) {
    for(int i = N; i >= 1; --i) {
        for(int j = N; j >= 1; --j) {
            if(i > N / 2 && j > N / 2) {
                s[i][j] = countTreasure(1, 1, i, j); 
            }
            if(i > N / 2 && j <= N / 2) {
                s[i][j] = s[i][N] - countTreasure(1, j + 1, i, N); 
            }
            if(i <= N / 2 && j > N / 2) {
                s[i][j] = s[N][j] - countTreasure(i + 1, 1, N, j); 
            }
            if(i <= N / 2 && j <= N / 2) {
                s[i][j] = countTreasure(i + 1, j + 1, N, N) + s[i][N] + s[N][j] - s[N][N];
            }
        }
    }
    for(int i = 1; i <= N; ++i) {
        for(int j = 1; j <= N; ++j) {
            if(s[i][j] - s[i - 1][j] - s[i][j - 1] + s[i - 1][j - 1]) {
                Report(i, j);
            }
        }
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 2 ms 256 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 2 ms 256 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 2 ms 384 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 2 ms 384 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 3 ms 384 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 3 ms 384 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 2 ms 384 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 2 ms 384 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 4 ms 384 KB Output is correct - N = 100, K = 43760000, score = 10