Submission #464558

#	Time	Username	Problem	Language	Result	Execution time	Memory
464558		zxcvbnm	보물 찾기 (CEOI13_treasure2)	C++14	44 / 100	47 ms	996 KiB

treasure

#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
int n;
bool ans[105][105];
map<array<int, 4>, int> call;
int query(int x1, int y1, int x2, int y2) {
    if (x1 <= 0 || x2 <= 0 || x2 > n || x1 > n || y1 <= 0 || y1 > n || y2 <= 0 || y2 > n) return 0;
    if (call.count({x1, y1, x2, y2})) {
        return call[{x1, y1, x2, y2}];
    }
    return call[{x1, y1, x2, y2}] = countTreasure(x1, y1, x2, y2);
}
void findTreasure (int N) {
    n = N;
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            ans[i][j] = query(1, 1, i, j) - query(1, 1, i-1, j) - query(1, 1, i, j-1) + query(1, 1, i-1, j-1);
        }
    }

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            if (ans[i][j]) {
                Report(i, j);
            }
            cerr << ans[i][j] << " ";
        }
        cerr << "\n";
    }

//    int cnt = countTreasure(1, 1, N, N);
//    if(cnt > 0) Report(1, 1);
}

• Subtask 1: 44 / 100