oj.uz

Submission #465163

# Submission time Handle Problem Language Result Execution time Memory
465163 2021-08-15T09:29:54 Z zxcvbnm Treasure (different grader from official contest) (CEOI13_treasure2) C++14
56 / 100
 9 ms 972 KB 
#include "treasure.h"
#include <bits/stdc++.h>
using namespace std;
int n;
bool ans[105][105];
int pref[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};

    int mid = n/2;
    for(int i = n; i >= 1; i--) {
        for(int j = n; j >= 1; j--) {
            int idx = quadrant(i, j, dx, dy);
            if (i > mid && j > mid) {
                pref[i][j] = query(1, 1, i, j);
            } else if (i > mid) {
                pref[i][j] = pref[i][n] - query(1, j+1, i, n);
            } else if (j > mid) {
                pref[i][j] = pref[n][j] - query(i+1, 1, n, j);
            } else {
                pref[i][j] = query(1, 1, i, j);
            }
        }
    }

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

}

Compilation message

treasure.cpp: In function 'void findTreasure(int)':
treasure.cpp:35:17: warning: unused variable 'idx' [-Wunused-variable]
   35 |             int idx = quadrant(i, j, dx, dy);
      |                 ^~~

Subtask #1
56.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 204 KB Output is partially correct - N = 5, K = 329, score = 8
2 Partially correct 1 ms 332 KB Output is partially correct - N = 10, K = 5475, score = 8
3 Partially correct 1 ms 332 KB Output is partially correct - N = 15, K = 27434, score = 8
4 Partially correct 1 ms 332 KB Output is partially correct - N = 16, K = 36096, score = 8
5 Partially correct 2 ms 564 KB Output is partially correct - N = 55, K = 5087854, score = 4
6 Partially correct 3 ms 560 KB Output is partially correct - N = 66, K = 10605771, score = 4
7 Partially correct 4 ms 716 KB Output is partially correct - N = 77, K = 19608305, score = 4
8 Partially correct 9 ms 844 KB Output is partially correct - N = 88, K = 33570240, score = 4
9 Partially correct 6 ms 952 KB Output is partially correct - N = 99, K = 53679452, score = 4
10 Partially correct 6 ms 972 KB Output is partially correct - N = 100, K = 56010000, score = 4