# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
417447 | MohamedAhmed04 | Synchronization (JOI13_synchronization) | C++17 | 318 ms | 25728 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>
using namespace std ;
const int MAX = 2e5 + 10 ;
int n , m , q ;
int in[MAX] , out[MAX] , dep[MAX] , P[MAX][17] ;
int u[MAX] , v[MAX] , mark[MAX] ;
int val[MAX] , last[MAX] ;
vector< vector<int> >adj(MAX) ;
int tim = 0 ;
int bit[MAX] ;
void add(int i , int x)
{
for(; i <= n ; i += (i & (-i)))
bit[i] += x ;
}
int get(int i)
{
int sum = 0 ;
for(; i > 0 ; i -= (i & (-i)))
sum += bit[i] ;
# | 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... |