oj.uz

답안 #578120

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

constexpr int N = 1E5 + 5, D = 15;
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 3 ms 4944 KB Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 242 ms 19580 KB Output is correct
2 Correct 275 ms 19516 KB Output is correct
3 Correct 294 ms 24316 KB Output is correct
4 Correct 1841 ms 168996 KB Output is correct
5 Correct 549 ms 37688 KB Output is correct
6 Execution timed out 3037 ms 242744 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 19468 KB Output is correct
2 Runtime error 357 ms 262144 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 6156 KB Output is correct
2 Correct 143 ms 5968 KB Output is correct
3 Correct 222 ms 5968 KB Output is correct
4 Correct 919 ms 10064 KB Output is correct
5 Correct 850 ms 9176 KB Output is correct
6 Correct 162 ms 5968 KB Output is correct
7 Correct 790 ms 9116 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4944 KB Output is correct
2 Correct 4 ms 5072 KB Output is correct
3 Correct 4 ms 5072 KB Output is correct
4 Correct 6 ms 5072 KB Output is correct
5 Correct 22 ms 5884 KB Output is correct
6 Correct 242 ms 19580 KB Output is correct
7 Correct 275 ms 19516 KB Output is correct
8 Correct 294 ms 24316 KB Output is correct
9 Correct 1841 ms 168996 KB Output is correct
10 Correct 549 ms 37688 KB Output is correct
11 Execution timed out 3037 ms 242744 KB Time limit exceeded
12 Halted 0 ms 0 KB -