# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933635 | Spazmash | Mountains (NOI20_mountains) | C++17 | 916 ms | 76468 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 ll long long
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define elif else if
#define x first
#define y second
ll n, a[300001], tree[1300001], ans;
vector<ll> del[300001], vec;
map<ll, bool> vis;
map<ll, ll> eval;
ll query(ll tidx, ll tl, ll tr, ll l, ll r){
if(l>tr)return 0;
if(r<tl)return 0;
if(l<=tl && r>=tr)return tree[tidx];
ll tmid=(tl+tr)/2;
return query(tidx*2, tl, tmid, l, r)+query(tidx*2+1, tmid+1, tr, l, r);
}
void update(ll tidx, ll tl, ll tr, ll idx){
if(tl==tr && tl==idx){
tree[tidx]=0;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |