| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 669336 | berr | 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 = 1e5+30;
vector<bitset<504>> sts[N];
vector<array<int, 2>> adj[N];
vector<int> h, st[N];
map<array<int, 2>, int> mp;
bitset<504> s;
void init(int n, int d, int H[]){
for(int i=0; i<n; i++){
sts[i].push_back(s);
st[i].push_back(-1);
}
for(int i=0; i<n; i++){
h.push_back(H[i]);
}
}
void curseChanges(int u, int a[], int b[]){
for(int i=0; i<u; i++){
adj[a[i]].push_back({h[b[i]], b[i]});
adj[b[i]].push_back({h[a[i]], a[i]});
}
for(int i=0; i<N; i++){
sort(adj[i].begin(), adj[i].end());
}
for(int i=0; i<N; i++){
for(int l=0; l<adj[i].size(); l++){
mp[{i, adj[i][l][1]}]=l;
}
}
for(int i=0; i<u; i++){
int x=a[i], y=b[i];
bitset ss=sts[x].back();
int pos=mp[{x, y}];
if(ss[pos]==1) ss[pos]=0;
else ss[pos]=1;
sts[x].push_back(ss);
st[x].push_back(i);
ss=sts[y].back();
pos=mp[{y, x}];
if(ss[pos]==1) ss[pos]=0;
else ss[pos]=1;
sts[y].push_back(ss);
st[y].push_back(i);
}
}
int question(int x, int y, int v){
int posx=-1, posy=-1;
if(st[x].size())
posx = lower_bound(st[x].begin(), st[x].end(), v)-st[x].begin()-1;
if(st[y].size())
posy = lower_bound(st[y].begin(), st[y].end(), v)-st[y].begin()-1;
if(posx >= st[x].size() || posy <= 0 || st[x][posx] > v) return 1e9;
if(posy >= st[y].size() || posy <= 0 || st[y][posy] > v) return 1e9;
bitset sx = sts[x][posx], sy=sts[y][posy];
int lx=0, ly=0;
while(lx<sx.size() && sx[lx]==0) lx++;
while(ly<sy.size() && sy[ly]==0) ly++;
int ans=1e9;
while(lx<sx.size() && ly < sy.size()){
int vx=adj[x][lx][0];
int vy=adj[y][ly][0];
ans=min(ans, abs(vx-vy));
if(vx < vy){
lx ++;
while(lx<sx.size() && sx[lx]==0) lx++;
}
else if(vx > vy){
ly ++;
while(ly<sy.size() && sy[ly]==0) ly++;
}
else{
break;
}
}
return ans;
}
int main() {
int N, D, U, Q;
std::ios::sync_with_stdio(false); std::cin.tie(NULL);
std::cin >> N >> D >> U >> Q;
int *F = new int[N];
for (int i=0; i<N; i++)
std::cin >> F[i];
init(N, D, F);
int *A = new int[U], *B = new int[U];
for (int i=0; i<U; i++) {
std::cin >> A[i] >> B[i];
}
curseChanges(U, A, B);
bool correct = true;
for (int i=0; i<Q; i++) {
int X,Y,V,CorrectAnswer;
std::cin >> X >> Y >> V >> CorrectAnswer;
int YourAnswer = question(X,Y,V);
if (YourAnswer != CorrectAnswer) {
std::cout << "WA! Question: " << i
<< " (X=" << X << ", Y=" << Y << ", V=" << V << ") "
<< "Your answer: " << YourAnswer
<< " Correct Answer: " << CorrectAnswer << std::endl;
correct = false;
} else {
std::cerr << YourAnswer << " - OK" << std::endl;
}
}
if (correct) {
std::cout << "Correct." << std::endl;
} else std::cout << "Incorrect." << std::endl;
return 0;
}