# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964016 | owoovo | Joker (BOI20_joker) | C++17 | 251 ms | 65732 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 opitimize("O3,unroll-loops")
#define ll long long
#define F first
#define S second
using namespace std;
vector<pair<int,int>> node[800010];
vector<pair<int,int>> edge;
int cnt,R,U;
int ans[200010];
struct Dsu{
int ori[400100],si[400100];
stack<pair<pair<int,int>,int>> move;
inline void init(){
for(int i=0;i<=400050;i++)ori[i]=i,si[i]=1;
while(!move.empty())move.pop();
}
inline int f(int a){
return ori[a]==a?a:f(ori[a]);
}
inline bool onion(int a,int b,int id){
a=f(a),b=f(b);
if(a==b)return false;
if(si[a]>si[b])swap(a,b);
ori[a]=b;
si[b]+=si[a];
move.push({{a,b},id});
return true;
}
inline void undo(){
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... |