Submission #342481

#	Time	Username	Problem	Language	Result	Execution time	Memory
342481		mjhmjh1104	The Potion of Great Power (CEOI20_potion)	C++14	14 / 100	554 ms	18668 KiB

potion

#include <set>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

int n;
set<pair<int, int>> m;
vector<int> h, adj[100006];

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

bool cmp(const int &a, const int &b) {
    return h[a] < h[b];
}

void curseChanges(int U, int A[], int B[]) {
    for (int i = 0; i < U; i++) {
        int a = A[i], b = B[i];
        if (a > b) swap(a, b);
        if (m.count({ a, b })) m.erase({ a, b });
        else m.insert({ a, b });
    }
    auto it = m.begin();
    while (it != m.end()) {
        adj[it->first].push_back(it->second);
        adj[it->second].push_back(it->first);
        it = next(it);
    }
    for (int i = 0; i < n; i++) sort(adj[i].begin(), adj[i].end(), cmp);
}

int question(int x, int y, int v) {
    int i = 0, j = 0;
    int res = 1e9;
    while (i < (int)adj[x].size() && j < (int)adj[y].size()) {
        res = min(res, abs(h[adj[x][i]] - h[adj[y][j]]));
        if (h[adj[x][i]] <= h[adj[y][j]]) i++;
        else j++;
    }
    return res;
}

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