# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401782 | lukameladze | Pinball (JOI14_pinball) | C++14 | 539 ms | 34692 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>
#define f first
#define s second
#define pb push_back
using namespace std;
const int N=3e5+5;
int n,m,cnt;
long long dp[N],dp1[N],a[N],b[N],c[N],d[N],ans;
long long tree[4*N];
map <int, int> xx;
vector <long long> v;
void update(long long node, long long le, long long ri ,long long idx, long long val) {
if (le>idx || ri<idx) return;
if (le==ri) {
tree[node]=min(tree[node],val);
return ;
}
int mid=(le+ri)/2;
update(2*node, le ,mid, idx, val);
update(2*node+1, mid+1, ri, idx, val);
tree[node]=min(tree[2*node],tree[2*node+1]);
}
long long getans(long long node, long long le, long long ri ,long long start, long long end) {
if (le>end || ri<start) return 1e17;
if (le>=start && ri<=end) {
return tree[node];
}
int mid=(le+ri)/2;
return min(getans(2*node, le ,mid, start, end),getans(2*node+1, mid+1, ri, start,end));
}
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... |