# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588987 | Arnch | The Potion of Great Power (CEOI20_potion) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10, maxn = 1e6 + 10;
int n, d, h[maxn], a[maxn], b[maxn];
bool mark[maxn];
vector<int> pos[maxn], val[maxn];
void init(int N, int D, int H[]) {
n = N, d = D;
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++) {
a[i] = A[i], b[i] = B[i];
pos[a[i]].push_back(b[i]), pos[b[i]].push_back(a[i]);
}
for(int i = 0; i < n; i++) {
sort(pos[i].begin(), pos[i].end());
int cnt = 0;
for(int j = 0; j < pos[i].size(); j++) {
cnt++;
if(j == pos[i].size() - 1 || pos[i][j] != pos[i][j + 1]) {
if(cnt % 2 == 1) val[i].push_back(h[pos[i][j]]);
cnt = 0;
continue;
}
}
sort(All(val[i]));
}
}
int question(int x, int y, int v) {
int ans = 1e9;
for(auto i : val[x]) {
int pos = lower_bound(val[y].begin(), val[y].end(), i) - val[y].begin();
if(pos != val[y].size()) ans = min(ans, val[y][pos] - i);
}
for(auto i : val[y]) {
int pos = lower_bound(val[x].begin(), val[x].end(), i) - val[x].begin();
if(pos != val[x].size()) ans = min(ans, val[x][pos] - i);
}
return ans;
}