# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930169 | alexz1205 | Two Currencies (JOI23_currencies) | C++14 | 10 ms | 11100 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 N = 1e5, M = 1e5, Q = 1e5;
typedef long long int lint;
int n, m, q;
struct edgePair{
int a, b;
vector<lint> t;
};
struct edge{
int v;
vector<lint> t;
};
struct SegTree{
int l, r;
lint tot, size;
SegTree* lChild;
SegTree* rChild;
SegTree(int l, int r){
this->l = l;
this->r = r;
tot = 0;
size = 0;
if (l+1 < r){
# | 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... |