# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729598 | abcvuitunggio | Two Currencies (JOI23_currencies) | C++17 | 4321 ms | 145576 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 int long long
using namespace std;
struct edge{
int a,b;
}e[100001];
struct checkpoint{
int p,c;
}ch[100001];
struct citizen{
int s,t,x,y,idx;
}c[100001];
struct T{
int gold,silver;
};
int n,m,q,res[100001];
int p[100001][20],tin[100001],tout[100001],t;//lca
int root[100001],pos[100001],sz[100001],chain[100001],chainsize[100001],id;//hld
int l[100001],r[100001],kq[100001];//binary search
vector <int> ke[100001];
vector <citizen> ve[100001];
vector <T> st[100001];
T operator +(T a, T b){
return {a.gold+b.gold,a.silver+b.silver};
}
void update(int node, int l, int r, int x, int g, int s, int idx){
if (l>x||r<x||l>r)
return;
if (l==r){
st[idx][node].gold+=g;
# | 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... |