# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105501 | onjo0127 | Pinball (JOI14_pinball) | C++11 | 323 ms | 14260 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 long long INF = 1LL * 1e18;
vector<int> S;
int A[100009], B[100009], C[100009], D[100009];
long long lm[100009], rm[100009];
struct segtree {
vector<long long> T;
segtree(int N) {
T.resize(4*N, 0);
}
void upd(int idx, int s, int e, int x, long long y) {
if(x < s || e < x) return;
if(s == e) {
T[idx] = y;
return;
}
int m = s+e >> 1;
upd(idx*2, s, m, x, y);
upd(idx*2+1, m+1, e, x, y);
T[idx] = min(T[idx*2], T[idx*2+1]);
}
long long mn(int idx, int s, int e, int l, int r) {
if(r < s || e < l) return INF;
if(l <= s && e <= r) return T[idx];
int m = s+e >> 1;
return min(mn(idx*2, s, m, l, r), mn(idx*2+1, m+1, e, l, r));
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... |