oj.uz

Submission #464576

# Submission time Handle Problem Language Result Execution time Memory
464576 2021-08-13T12:59:21 Z zxcvbnm Treasure (different grader from official contest) (CEOI13_treasure2) C++14
80 / 100
 44 ms 996 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 (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
//    cerr << x1 << " " << y1 << " " << x2 << " " << y2 << "\n";
    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);
}

int quadrant(int x, int y, int dx[], int dy[]) {
    vector<int> poss;
    for(int i = 0; i < 4; i++) {
        poss.push_back(abs(dx[i]-x) * abs(dy[i]-y));
    }
    return max_element(poss.begin(), poss.end()) - poss.begin();
}
void findTreasure (int N) {
    n = N;

    int dx[] = {1, n, 1, n};
    int dy[] = {1, 1, n, n};

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            int idx = quadrant(i, j, dx, dy);
            int x1 = min(dx[idx], i);
            int x2 = max(dx[idx], i);
            int y1 = min(dy[idx], j);
            int y2 = max(dy[idx], j);
//            int x1 = dx[idx];
//            int y1 = dy[idx];
//            int x2 = i;
//            int y2 = j;

            if (idx == 0) {
                ans[i][j] = query(x1, y1, x2, y2) - query(x1, y1, x2-1, y2) - query(x1, y1, x2, y2-1) + query(x1, y1, x2-1, y2-1);
            }
            else if (idx == 1) {
                ans[i][j] = query(x1, y1, x2, y2) - query(x1+1, y1, x2, y2) - query(x1, y1, x2, y2-1) + query(x1+1, y1, x2, y2-1);
            }
            else if (idx == 2) {
                ans[i][j] = query(x1, y1, x2, y2) - query(x1, y1+1, x2, y2) - query(x1, y1, x2-1, y2) + query(x1, y1+1, x2-1, y2);
            }
            else if (idx == 3) {
                ans[i][j] = query(x1, y1, x2, y2) - query(x1+1, y1, x2, y2) - query(x1, y1+1, x2, y2) + query(x1+1, y1+1, x2, y2);
            }
        }
    }

    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
80.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 204 KB Output is partially correct - N = 5, K = 495, score = 8
2 Partially correct 1 ms 204 KB Output is partially correct - N = 10, K = 5821, score = 8
3 Partially correct 1 ms 332 KB Output is partially correct - N = 15, K = 26880, score = 8
4 Partially correct 2 ms 328 KB Output is partially correct - N = 16, K = 34273, score = 8
5 Partially correct 14 ms 460 KB Output is partially correct - N = 55, K = 4217920, score = 8
6 Partially correct 19 ms 628 KB Output is partially correct - N = 66, K = 8668573, score = 8
7 Partially correct 27 ms 740 KB Output is partially correct - N = 77, K = 15962895, score = 8
8 Partially correct 34 ms 860 KB Output is partially correct - N = 88, K = 27102241, score = 8
9 Partially correct 42 ms 996 KB Output is partially correct - N = 99, K = 43260000, score = 8
10 Partially correct 44 ms 972 KB Output is partially correct - N = 100, K = 45017701, score = 8