# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
986916 | vjudge1 | Pinball (JOI14_pinball) | C++17 | 288 ms | 28348 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;
using ll = long long;
const int N = 3e5 + 5;
int n, m;
int a[N], b[N], c[N], d[N];
vector<int> num;
ll st[2][N << 2];
void update(int u, ll val, int t) {
int id = 1, l = 1, r = n;
while(l < r) {
int mid = l + r >> 1;
if(u > mid) id = id << 1 | 1, l = mid + 1;
else id = id << 1, r = mid;
}
st[t][id] = min(st[t][id], val);
while(id > 1) id = id >> 1, st[t][id] = min(st[t][id << 1], st[t][id << 1 | 1]);
}
ll get(int u, int v, int t, int id = 1, int l = 1, int r = n) {
if(u > r || v < l) return 1e18;
if(u <= l && r <= v) return st[t][id];
int mid = l + r >> 1;
ll tmp1 = get(u, v, t, id << 1, l, mid);
ll tmp2 = get(u, v, t, id << 1 | 1, mid + 1, r);
return min(tmp1, tmp2);
}
int main() {
int t = 1;
while(t--){
cin >> m >> n;
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... |