# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931580 | moonrabbit2 | Salesman (IOI09_salesman) | C++17 | 187 ms | 30804 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;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
using ll=long long;
using pii=array<int,2>;
using tii=array<int,3>;
const int N=5e5+5;
int n,s;
tii a[N];
ll U,D,S[N],dp[N];
struct Seg{
ll F[N]={0};
void init(){
for(int i=1;i<=500001;i++) F[i]=-1e18;
}
void upd(int i,ll v){
for(;i<=500001;i+=i&-i) F[i]=max(F[i],v);
}
ll qry(int i){
ll r=-1e18;
for(;i;i-=i&-i) r=max(r,F[i]);
return r;
}
}T1,T2;
int main(){
ios::sync_with_stdio(false); cin.tie(0);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |