oj.uz

답안 #465167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
465167 2021-08-15T09:35:42 Z zxcvbnm 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 3 ms 332 KB 
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
int pref[105][105];
void findTreasure (int N) {
    int n = N;
    int mid = n/2;
    for(int i = n; i >= 1; i--) {
        for(int j = n; j >= 1; j--) {
            if (i > mid && j > mid) {
                pref[i][j] = countTreasure(1, 1, i, j);
            } else if (i > mid) {
                pref[i][j] = pref[i][n] - countTreasure(1, j+1, i, n);
            } else if (j > mid) {
                pref[i][j] = pref[n][j] - countTreasure(i+1, 1, n, j);
            } else {
                pref[i][j] = pref[n][j] + pref[i][n] + countTreasure(i+1, j+1, n, n) - pref[n][n];
            }
        }
    }

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if (pref[i][j] - pref[i-1][j] - pref[i][j-1] + pref[i-1][j-1]) {
                Report(i, j);
            }
        }
    }
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 204 KB Output is correct - N = 5, K = 289, score = 10
2 Correct 3 ms 204 KB Output is correct - N = 10, K = 4475, score = 10
3 Correct 1 ms 204 KB Output is correct - N = 15, K = 22289, score = 10
4 Correct 1 ms 204 KB Output is correct - N = 16, K = 28928, score = 10
5 Correct 1 ms 332 KB Output is correct - N = 55, K = 4005289, score = 10
6 Correct 3 ms 332 KB Output is correct - N = 66, K = 8305803, score = 10
7 Correct 1 ms 332 KB Output is correct - N = 77, K = 15383161, score = 10
8 Correct 1 ms 332 KB Output is correct - N = 88, K = 26244416, score = 10
9 Correct 1 ms 332 KB Output is correct - N = 99, K = 42032201, score = 10
10 Correct 1 ms 332 KB Output is correct - N = 100, K = 43760000, score = 10