# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970929 | happy_node | Two Currencies (JOI23_currencies) | C++17 | 4543 ms | 57416 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;
typedef long long ll;
const int MX=1e5+5, MK=18;
int N,M,Q;
vector<int> qry[MX];
ll S[MX], T[MX], X[MX], Y[MX], ans[MX], lca[MX];
int L[MX], R[MX], U[MX], V[MX];
int up[MX][MK], tin[MX], tout[MX], timer=0;
struct segtree {
ll t[4*MX], lazy[4*MX];
void push(int v, int l, int r) {
t[v]+=lazy[v];
if(l!=r) {
lazy[2*v+0]+=lazy[v];
lazy[2*v+1]+=lazy[v];
}
lazy[v]=0;
}
void update(int v, int l, int r, int ql, int qr, int val) {
# | 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... |