oj.uz

답안 #578115

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

constexpr int N = 1E5 + 5, D = 100;
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 4 ms 5072 KB Output is correct
4 Correct 17 ms 5960 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 19540 KB Output is correct
2 Correct 209 ms 19396 KB Output is correct
3 Correct 626 ms 12692 KB Output is correct
4 Correct 2292 ms 33924 KB Output is correct
5 Correct 737 ms 12240 KB Output is correct
6 Execution timed out 3103 ms 51764 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 19464 KB Output is correct
2 Correct 2976 ms 51932 KB Output is correct
3 Correct 2133 ms 34948 KB Output is correct
4 Execution timed out 3067 ms 51660 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 6076 KB Output is correct
2 Correct 323 ms 5456 KB Output is correct
3 Correct 574 ms 5456 KB Output is correct
4 Correct 1462 ms 6548 KB Output is correct
5 Correct 1197 ms 6540 KB Output is correct
6 Correct 182 ms 5432 KB Output is correct
7 Correct 1318 ms 6048 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 4 ms 5072 KB Output is correct
5 Correct 17 ms 5960 KB Output is correct
6 Correct 208 ms 19540 KB Output is correct
7 Correct 209 ms 19396 KB Output is correct
8 Correct 626 ms 12692 KB Output is correct
9 Correct 2292 ms 33924 KB Output is correct
10 Correct 737 ms 12240 KB Output is correct
11 Execution timed out 3103 ms 51764 KB Time limit exceeded
12 Halted 0 ms 0 KB -