oj.uz

답안 #464516

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
464516 2021-08-13T10:45:29 Z zxcvbnm 보물 찾기 (CEOI13_treasure2) C++14
10 / 100
 1 ms 332 KB 
#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 (call.count({x1, y1, x2, y2})) {
        return call[{x1, y1, x2, y2}];
    }
    return 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++) {
            if (query(i, j, i, j)) {
                ans[i][j] = true;
            }
        }
    }
//
//    for(int i = 0; i < n; i++) {
//        int cnt = query(i+1, 1, i+1, n);
//        int curr = 1;
//        int l = 1, r = n;
//        while(curr < cnt) {
//            r = n;
//            int rep = 0;
//            while(l <= r) {
//                int mid = (l + r) / 2;
//                int x = query(i+1, 1, i+1, mid);
//                if (x >= curr) {
//                    rep = mid;
//                    r = mid - 1;
//                } else {
//                    l = mid + 1;
//                }
//            }
//            curr++;
//            assert(rep != 0);
//            ans[i][rep] = true;
//        }
//    }

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

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

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 204 KB Output is partially correct - N = 5, K = 625, score = 1
2 Partially correct 0 ms 204 KB Output is partially correct - N = 10, K = 10000, score = 1
3 Partially correct 0 ms 204 KB Output is partially correct - N = 15, K = 50625, score = 1
4 Partially correct 0 ms 204 KB Output is partially correct - N = 16, K = 65536, score = 1
5 Partially correct 0 ms 332 KB Output is partially correct - N = 55, K = 9150625, score = 1
6 Partially correct 1 ms 332 KB Output is partially correct - N = 66, K = 18974736, score = 1
7 Partially correct 1 ms 332 KB Output is partially correct - N = 77, K = 35153041, score = 1
8 Partially correct 1 ms 332 KB Output is partially correct - N = 88, K = 59969536, score = 1
9 Partially correct 1 ms 332 KB Output is partially correct - N = 99, K = 96059601, score = 1
10 Partially correct 1 ms 332 KB Output is partially correct - N = 100, K = 100000000, score = 1