제출 #349134

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349134		dolphingarlic	The Potion of Great Power (CEOI20_potion)	C++14	38 / 100	1486 ms	262148 KiB

potion

#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9;

int H[100000];
struct cmp {
    bool operator()(int a, int b) const { return tie(H[a], a) < tie(H[b], b); }
};
map<int, set<int, cmp>> trust[100000];

void init(int N, int D, int H[]) {
    for (int i = 0; i < N; i++) {
        trust[i][0] = set<int, cmp>();
        ::H[i] = H[i];
    }
}

void curseChanges(int U, int A[], int B[]) {
    for (int i = 0; i < U; i++) {
        set<int, cmp> sa = trust[A[i]].rbegin()->second, sb = trust[B[i]].rbegin()->second;
        if (sa.find(B[i]) == sa.end()) sa.insert(B[i]), sb.insert(A[i]);
        else sa.erase(B[i]), sb.erase(A[i]);
        trust[A[i]][i + 1] = sa, trust[B[i]][i + 1] = sb;
    }
}

int question(int x, int y, int v) {
    set<int, cmp> sx = prev(trust[x].upper_bound(v))->second, sy = prev(trust[y].upper_bound(v))->second;
    int ans = INF;
    for (int i : sx) {
        auto ub = sy.upper_bound(i);
        if (ub != sy.end()) ans = min(ans, H[*ub] - H[i]);
        if (ub != sy.begin()) ans = min(ans, H[i] - H[*prev(ub)]);
    }
    return ans;
}

• Subtask 1: 0 / 0
• Subtask 2: 17 / 17
• Subtask 3: 0 / 14
• Subtask 4: 0 / 18
• Subtask 5: 21 / 21
• Subtask 6: 0 / 30