# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862024 | vjudge1 | Two Currencies (JOI23_currencies) | C++17 | 446 ms | 67152 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 <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll = long long;
using ld = long double;
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false)
#define N 100005
#define M N*40
#define ALL(x) x.begin(), x.end()
int A[M], L[M], R[M], ALLOC = 1;
ll B[M];
inline int persist1(int a, ll b)
{
int p = ALLOC++;
A[p] = a, B[p] = b;
return p;
}
inline int persist2(int l, int r)
{
int p = ALLOC++; L[p] = l; R[p] = r;
A[p] = A[l] + A[r]; B[p] = B[l] + B[r];
return p;
# | 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... |