# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
843141 | abcvuitunggio | Overtaking (IOI23_overtaking) | C++17 | 3341 ms | 1339180 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 "overtaking.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const ll INF=2e18;
vector <pii> st;
vector <int> le,ri;
vector <pair <pii, int>> v;
ll e[1001][1001],r[1001][1001],n,t[1001],w[1001],l,x,id;
void gen(){
st.push_back({INF,INF});
le.push_back(-1);
ri.push_back(-1);
id++;
}
void update(int node, ll l, ll r, ll u, ll v, pii p){
if (l>v||r<u||l>r||u>v)
return;
if (l>=u&&r<=v){
st[node]=min(st[node],p);
return;
}
ll mid=(l+r)>>1;
if (le[node]==-1){
le[node]=id;
gen();
}
update(le[node],l,mid,u,v,p);
if (ri[node]==-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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |