# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986721 | vjudge1 | The Potion of Great Power (CEOI20_potion) | C++17 | 1771 ms | 222400 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>
#pragma GCC optimize(2)
using namespace std;
int SSZ=20;
vector<pair<int,int>>C[100100];
map<int,set<int>> temps[100100], prooc[100100];
set<int>cur[100100];
int h[100100],ord[100100],rev[100100],CC;
void init(int N, int D, int H[]) {
vector<int>v;
for(int i=0;i<N;i++) h[i]=H[i],
v.push_back(i),temps[i][-1];
sort(v.begin(),v.end(),[](int a,int b){return h[a]<h[b];});
for(int i=0;i<N;i++)
rev[ord[v[i]]=i]=v[i];
}
void curseChanges(int U, int A[], int B[]) {
for(int i=0;i<U;i++){
A[i]=ord[A[i]];
B[i]=ord[B[i]];
if(cur[A[i]].count(B[i]))
cur[A[i]].erase(B[i]),
cur[B[i]].erase(A[i]);
else cur[A[i]].insert(B[i]),
cur[B[i]].insert(A[i]);
C[A[i]].push_back({i,B[i]});
C[B[i]].push_back({i,A[i]});
if(C[A[i]].size()%SSZ==0)
temps[A[i]][i]=cur[A[i]];
if(C[B[i]].size()%SSZ==0)
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... |