# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
998712 | bachhoangxuan | Salesman (IOI09_salesman) | C++17 | 217 ms | 47456 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 int long long
#define pii pair<int,int>
#define fi first
#define se second
const int maxn = 5e5+5;
const int inf = 1e18;
int N,D,U,S,T,M;
vector<pii> F[maxn];
struct BIT{
int bit[maxn];
BIT(){}
void init(){
for(int i=1;i<=M;i++) bit[i]=-inf;
}
void update(int x,int val){
for(int i=x;i<=M;i+=(i&(-i))) bit[i]=max(bit[i],val);
}
int query(int x){
int res=-inf;
for(int i=x;i>=1;i-=(i&(-i))) res=max(res,bit[i]);
return res;
}
}lt,rt;
int d[maxn],mx[maxn];
signed main(){
ios_base::sync_with_stdio(false);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |