# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
895710 | imarn | Synchronization (JOI13_synchronization) | C++14 | 207 ms | 24148 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>
#define ld long double
#define pii pair<long long,int>
#define pll pair<ll,ll>
#define all(x) x.begin(),x.end()
#define pb push_back
#define f first
#define s second
#define vi vector<ll>
#define vvi vector<vi>
#define vpii vector<pii>
#define ll long long
using namespace std;
const int N=1e5+5;
vector<int>g[N];
vpii edge(N);
int fw[N]{0},pr[N][18]{0},tin[N],tout[N],t=0,d[N]{0},dd[N]{0};
bool vis[N]{0};
void add(int i,int amt){
for(;i<N;i+=i&-i)fw[i]+=amt;
}
int qr(int i,int res=0){
for(;i;i-=i&-i)res+=fw[i];
return res;
}
int get(int u){
int x=qr(tin[u]);
for(int i=17;i>=0;i--)if(qr(tin[pr[u][i]])==x)u=pr[u][i];
return u;
}
# | 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... |