# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1222545 | KindaGoodGames | The Potion of Great Power (CEOI20_potion) | C++20 | 1906 ms | 51332 KiB |
#pragma GCC optimize("O3, unroll-loops, Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
int n, d;
vector<int> height;
vector<set<int>> adj;
vector<set<int>> reach;
vector<pii> change;
void init(int N, int D, int H[]) {
height.resize(N);
n = N;
for(int i = 0; i < n; i++){
height[i] = H[i];
}
}
void curseChanges(int U, int A[], int B[]) {
change.resize(U);
reach.resize(n);
adj.resize(n);
for(int i = 0;i < U; i++){
change[i] = {A[i], B[i]};
}
for(int i = 0; i < U; i++){
int a,b;
tie(a,b) = change[i];
if(adj[a].count(b)){
adj[a].erase(b);
adj[b].erase(a);
}else{
adj[a].insert(b);
adj[b].insert(a);
}
}
for(int i = 0; i < n; i++){
for(auto u : adj[i]){
reach[i].insert(height[u]);
}
}
}
int question(int x, int y, int v) {
int mi = 1e9;
for(auto u : reach[x]){
{
auto it = reach[y].lower_bound(u);
if(it != reach[y].end()){
mi = min(mi, abs(u-(*it)));
}
}
{
auto it = reach[y].upper_bound(u);
if(it != reach[y].begin()){
it--;
mi = min(mi, abs(u-(*it)));
}
}
}
return mi;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |