oj.uz

답안 #578117

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578117 2022-06-16T05:12:09 Z tengiz05 The Potion of Great Power (CEOI20_potion) C++17
100 / 100
 2973 ms 92448 KB 
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;

constexpr int N = 1E5 + 5, D = 50;
int h[N], n;
vector<pair<int, int>> mv[N];
vector<set<pair<int, int>>> s[N];

void init(int N, int D, int H[]) {
    n = N;
    for (int i = 0; i < n; i++) {
        h[i] = H[i];
    }
}

void curseChanges(int U, int A[], int B[]) {
    for (int i = 0; i < U; i++) {
        mv[A[i]].emplace_back(i, B[i]);
        mv[B[i]].emplace_back(i, A[i]);
    }
    for (int i = 0; i < n; i++) {
        int z = mv[i].size();
        set<pair<int, int>> v;
        for (int j = 0; j < z; j++) {
            if (j % D == 0) {
                s[i].push_back(v);
            }
            if (v.count({h[mv[i][j].second], mv[i][j].second}))
                v.erase({h[mv[i][j].second], mv[i][j].second});
            else
                v.insert({h[mv[i][j].second], mv[i][j].second});
        }
    }
}

int question(int x, int y, int v) {
    if (v == 0)
        return 1E9;
    int F = lower_bound(mv[x].begin(), mv[x].end(), pair(v, -1)) - mv[x].begin() - 1;
    int S = lower_bound(mv[y].begin(), mv[y].end(), pair(v, -1)) - mv[y].begin() - 1;
    if (F == -1 || S == -1)
        return 1E9;
    set<pair<int, int>> a = s[x][F / D], b = s[y][S / D];
    for (int i = F / D * D; i <= F; i++) {
        int g = mv[x][i].second;
        if (a.count({h[g], g})) {
            a.erase({h[g], g});
        } else {
            a.insert({h[g], g});
        }
    }
    for (int i = S / D * D; i <= S; i++) {
        int g = mv[y][i].second;
        if (b.count({h[g], g})) {
            b.erase({h[g], g});
        } else {
            b.insert({h[g], g});
        }
    }
    vector<pair<int, int>> B(b.begin(), b.end());
    int i = 0;
    int ans = 1E9;
    for (auto [x, y] : a) {
        while (i < int(B.size()) && B[i].first < x)
            i++;
        if (i > 0) {
            ans = min(ans, x - B[i - 1].first);
        }
        if (i < int(B.size())) {
            ans = min(ans, B[i].first - x);
        }
    }
    return ans;
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5072 KB Output is correct
2 Correct 4 ms 5072 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 17 ms 5888 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 19520 KB Output is correct
2 Correct 190 ms 19444 KB Output is correct
3 Correct 417 ms 14708 KB Output is correct
4 Correct 1780 ms 57848 KB Output is correct
5 Correct 655 ms 13520 KB Output is correct
6 Correct 2935 ms 85568 KB Output is correct
7 Correct 842 ms 25124 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 195 ms 19432 KB Output is correct
2 Correct 2466 ms 89632 KB Output is correct
3 Correct 1576 ms 51824 KB Output is correct
4 Correct 2616 ms 85048 KB Output is correct
5 Correct 389 ms 23352 KB Output is correct
6 Correct 2839 ms 85328 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 5968 KB Output is correct
2 Correct 223 ms 5524 KB Output is correct
3 Correct 394 ms 5584 KB Output is correct
4 Correct 1133 ms 7220 KB Output is correct
5 Correct 1002 ms 6864 KB Output is correct
6 Correct 186 ms 5328 KB Output is correct
7 Correct 994 ms 6596 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4944 KB Output is correct
2 Correct 6 ms 5072 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 4 ms 5072 KB Output is correct
5 Correct 17 ms 5888 KB Output is correct
6 Correct 190 ms 19520 KB Output is correct
7 Correct 190 ms 19444 KB Output is correct
8 Correct 417 ms 14708 KB Output is correct
9 Correct 1780 ms 57848 KB Output is correct
10 Correct 655 ms 13520 KB Output is correct
11 Correct 2935 ms 85568 KB Output is correct
12 Correct 842 ms 25124 KB Output is correct
13 Correct 195 ms 19432 KB Output is correct
14 Correct 2466 ms 89632 KB Output is correct
15 Correct 1576 ms 51824 KB Output is correct
16 Correct 2616 ms 85048 KB Output is correct
17 Correct 389 ms 23352 KB Output is correct
18 Correct 2839 ms 85328 KB Output is correct
19 Correct 56 ms 5968 KB Output is correct
20 Correct 223 ms 5524 KB Output is correct
21 Correct 394 ms 5584 KB Output is correct
22 Correct 1133 ms 7220 KB Output is correct
23 Correct 1002 ms 6864 KB Output is correct
24 Correct 186 ms 5328 KB Output is correct
25 Correct 994 ms 6596 KB Output is correct
26 Correct 1063 ms 37968 KB Output is correct
27 Correct 1657 ms 51852 KB Output is correct
28 Correct 1582 ms 47228 KB Output is correct
29 Correct 1657 ms 58088 KB Output is correct
30 Correct 2973 ms 85648 KB Output is correct
31 Correct 2649 ms 92448 KB Output is correct
32 Correct 2787 ms 85400 KB Output is correct