# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
545559 | ivan_tudor | Synchronization (JOI13_synchronization) | C++14 | 505 ms | 24632 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 <iostream>
#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int in[N], out[N];
int aib[N];
void update(int poz, int val){
for(int i = poz; i < N; i+= i &(-i))
aib[i]+=val;
}
int query(int poz){
int ans = 0;
for(int i = poz; i >0; i-= i&(-i)){
ans+= aib[i];
}
return ans;
}
struct edgesstr{
int x, y;
};
edgesstr edg[N];
vector<int> gr[N];
int par[17][N];
int inters[N];
bool activ[N];
int ans[N];
void dfs_init(int nod, int dad, int &cnt){
par[0][nod] = dad;
for(int log = 1; log<17; log++){
# | 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... |