# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831743 | DJeniUp | Keys (IOI21_keys) | C++17 | 2365 ms | 430112 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("O3")
using namespace std;
typedef int ll;
typedef pair<ll,ll>pairll;
#define N 150007
#define pb push_back
#define fr first
#define sc second
vector<int> ans;
ll p[2*N],f[2*N],n,m,d[2*N],sz[2*N],fr[2*N];
map<ll,vector<ll> >v[2*N];
vector<ll>v2[2*N];
vector<pairll>v1[2*N];
set<ll>s[2*N],del[2*N],a[2*N];
ll P(ll x){
if(p[x]!=x)p[x]=P(p[x]);
return p[x];
}
void A(ll x,ll y){
# | 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... |