# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
918848 | 42kangaroo | Two Currencies (JOI23_currencies) | C++17 | 2992 ms | 160948 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.
//
// Created by 42kangaroo on 26/01/2024.
//
#include "bits/stdc++.h"
using namespace std;
#define int long long
using g_t = vector<vector<int>>;
struct SegAb {
int st, en, se;
};
struct Node {
int l, r, bl, br, numL, sumL;
};
struct PSegTe {
vector<Node> a;
vector<int> cooC;
int high;
int build(int l, int r) {
int act = a.size();
a.push_back({-1, -1, l, r, 0, 0});
if (l + 1 < r) {
int m = (l + r) / 2;
a[act].l = build(l, m);
Compilation message (stderr)
# | 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... |