# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915217 | berr | Two Currencies (JOI23_currencies) | C++17 | 1868 ms | 149724 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;
#define int long long
const int mod = 1e9+7;
struct segtree{
using T = array<int, 2>;
vector<T> st;
vector<int> ar;
int n, tl, tr;
T base = {0, 0};
segtree(){
st.resize(1);
};
T merge(T x, T y){
x[0] += y[0]; x[1] += y[1];
return x;
}
segtree(vector<int> a){
ar = a;
n = a.size();
st.resize(n*4, base);
build(1, 0, n-1);
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... |