# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49580 | mra2322001 | Synchronization (JOI13_synchronization) | C++14 | 613 ms | 68360 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 f0(i, n) for(int i=(0); i<n; i++)
#define f1(i, n) for(int i=(1); i<=n; i++)
using namespace std;
typedef long long ll;
const int N = 100002;
int n, m, q, dd[N], ans[N], tin[N], tout[N], t[8*N];
vector <pair <int, int> > edge; int last[N];
vector <int> a[N];
ostream& operator << (ostream &os, pair <int, int> x){
cout << x.first << " " << x.second;
}
istream& operator >> (istream &is, pair <int, int> &x){
cin >> x.first >> x.second;
}
int tim = 0;
void dfs(int u, int p){
tin[u] = ++tim;
for(auto v:a[u]) if(v != p) dfs(v, u);
tout[u] = ++tim;
}
void up(int k, int l, int r, int i, int val){
if(r < i || l > i) return ;
if(l==r){
t[k] += val;
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... |