Submission #258636

#	Time	Username	Problem	Language	Result	Execution time	Memory
258636		dolphingarlic	보물 찾기 (CEOI13_treasure2)	C++14	44 / 100	1 ms	384 KiB

treasure

#include "treasure.h"

int pref[101][101];

void findTreasure(int N) {
    pref[N][N] = countTreasure(1, 1, N, N);
    for (int i = 1; i <= N; i++) for (int j = 1; j <= N; j++) {
        if (i == N && j == N) continue;

        if (1 + N * N - i * j < 3 + 3 * N * N - (N - i) * (N - j) - N * (N - i) - N * (N - j))
            pref[i][j] = countTreasure(1, 1, i, j);
        else
            pref[i][j] = pref[N][N] + countTreasure(i + 1, j + 1, N, N) - countTreasure(i + 1, 1, N, N) - countTreasure(1, j + 1, N, N);
    }
    for (int i = N; i; i--) for (int j = N; j; j--) {
        pref[i][j] -= pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1];
        if (pref[i][j]) Report(i, j);
    }
}

• Subtask 1: 44 / 100