oj.uz

답안 #759706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759706 2023-06-16T15:39:02 Z doowey 보물 찾기 (CEOI13_treasure2) C++14
100 / 100
 3 ms 980 KB 
#include <bits/stdc++.h>
#include "treasure.h"

using namespace std;

typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

map<pair<pii,pii>, int> Q;

int ask(int i0, int j0, int i1, int j1){
    if(i0 > i1 || j0 > j1) return 0;
    pair<pii, pii> rect = mp(mp(i0,j0), mp(i1,j1));
    if(Q.count(rect)){
        return Q[rect];
    }
    return Q[rect]=countTreasure(i0,j0,i1,j1);
}

int n;
const int N = 105;
int pref[N][N];

void findTreasure (int _n) {
    n = _n;
    for(int i = n; i >= 1; i -- ){
        for(int j = n; j >= 1; j -- ){
            if(i > n / 2 && j > n / 2){
                pref[i][j] = ask(1, 1, i, j);
            }
            else if(j > n / 2 && i <= n / 2){
                pref[i][j] = pref[n][j] - ask(i + 1, 1, n, j);
            }
            else if(i > n / 2 && j <= n / 2){
                pref[i][j] = pref[i][n] - ask(1, j + 1, i, n);
            }
            else{
                pref[i][j] = -(pref[n][n] - ask(i + 1, j + 1, n, n) - pref[i][n] - pref[n][j]);
            }
        }
    }
    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] == 1){
                Report(i, j);
            }
        }
    }
}

Subtask #1
100.0 / 100.0

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