# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1136532 | Psiuk_Yurii | Synchronization (JOI13_synchronization) | C++20 | 130 ms | 42000 KiB |
/*In FISH at EGOI25 I trust*/
/*In FISH at EGOI25 I trust*/
/*In FISH at EGOI25 I trust*/
/*In FISH at EGOI25 I trust*/
/*In FISH at EGOI25 I trust*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppl;
struct edge{
ll u,w;
};
edge p[200009];
ll n,q,m,v1,v2,eu[200009],e,a[200009],b[200009],dv[200009][25],h,c[200009],T[400009],sz[400009],g;
vector<ll> A[200009];
void add(int pos,int val){
pos++;
for(int i=pos;i<400000;i+=-i&i) T[i]+=val;
}
ll pref(int pos){
ll S=0;
pos++;
for(int i=pos;i>0;i-=-i&i) S+=T[i];
return S;
# | 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... |