# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
374050 | denkendoemeer | Synchronization (JOI13_synchronization) | C++14 | 405 ms | 32236 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 ll long long
const int inf=1e9;
using namespace std;
int x[100005],y[100005],z[100005],l[100005],in[100005],out[100005],c[100005],aib[100005];
vector<int>g[100005],s[100005];
int n,u,m,q;
void update(int poz,int val)
{
while(poz<=n){
aib[poz]+=val;
poz+=poz&-poz;
}
}
int query(int poz)
{
int sum=0;
while(poz){
sum+=aib[poz];
poz-=poz&-poz;
}
return sum;
}
void dfs(int nod,int t)
{
s[nod].emplace_back(t);
in[nod]=++u;
int i;
for(i=0;i<s[s[nod][i]].size();i++)
s[nod].emplace_back(s[s[nod][i]][i]);
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... |