Submission #843067

#	Time	Username	Problem	Language	Result	Execution time	Memory
843067		abcvuitunggio	Overtaking (IOI23_overtaking)	C++17	0 / 100	13 ms	27740 KiB

overtaking

#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;
const long long INF=1e18;
const int SZ=16000001;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <pii, int> piii;
pii st[SZ];
vector <piii> v;
ll e[1001][1001],l[1001][1001],r[1001][1001],le[SZ],ri[SZ],n,t[1001],w[1001],d,x,id=1;
void update(int node, ll l, ll r, ll u, ll v, pii p){
    //cout << "U " << node << ' ' << l << ' ' << r << ' ' << u << ' ' << v << '\n';
    if (l>v||r<u||l>r||u>v)
        return;
    if (l>=u&&r<=v){
        //cout << "Update " << node << ' ' << l << ' ' << r << '\n';
        st[node]=min(st[node],p);
        return;
    }
    ll mid=(l+r)>>1;
    if (!le[node]){
        id++;
        le[node]=id;
        st[id]={INF,INF};
    }
    update(le[node],l,mid,u,v,p);
    if (!ri[node]){
        id++;
        ri[node]=id;
        st[id]={INF,INF};
    }
    update(ri[node],mid+1,r,u,v,p);
}
pii get(int node, ll l, ll r, long long i){
    pii p={INF,i};
    while (node){
        //cout << node << ' ' << l << ' ' << r << ' ' << st[node].first << ' ' << st[node].second << '\n';
        p=min(p,st[node]);
        ll mid=(l+r)>>1;
        if (mid>=i){
            r=mid;
            node=le[node];
            continue;
        }
        else{
            l=mid+1;
            node=ri[node];
        }
    }
    return p;
}
void init(int L, int N, vector<long long> T, vector<int> W, int X, int m, vector<int> s)
{
    d=L;
    x=X;
    for (int i=0;i<N;i++){
        if (W[i]>x){
            w[n]=W[i];
            e[n][0]=t[n]=T[i];
            n++;
        }
    }
    for (int i=1;i<m;i++){
        for (int j=0;j<n;j++)
            v.push_back({{e[j][i-1],w[j]},j});
        sort(v.begin(),v.end());
        long long mx=0;
        for (int it=0;it<v.size();it++){
            int j=v[it].second;
            mx=max(mx,e[j][i-1]+w[j]*(s[i]-s[i-1]));
            e[j][i]=mx;
            l[j][i-1]=e[j][i-1]+1;
            r[j][i-1]=min((it==v.size()-1?INF:e[v[it+1].second][i-1]),mx-x*(s[i]-s[i-1]));
            //cout << i-1 << ' ' << j << ' ' << l[j][i-1] << ' ' << r[j][i-1] << '\n';
        }
        v.clear();
    }
    st[1]={INF,INF};
    for (int i=m-1;i;i--){
        for (int j=0;j<n;j++)
            v.push_back({{e[j][i],w[j]},j});
        sort(v.begin(),v.end());
        for (auto p:v){
            int j=p.second;
            auto q=get(1,0,INF,e[j][i]+x*(d-s[i]));
            //cout << i-1 << ' ' << j << ' ' << l[j][i-1]+x*(d-s[i-1]) << ' ' << r[j][i-1]+x*(d-s[i-1]) << ' ' << q.second << '\n';
            update(1,0,INF,l[j][i-1]+x*(d-s[i-1]),r[j][i-1]+x*(d-s[i-1]),{i,q.second});
        }
        v.clear();
    }
    return;
}

long long arrival_time(long long y)
{
    //cout << y+x*d << '\n';
    return get(1,0,INF,y+x*d).second;
}

Compilation message (stderr)

overtaking.cpp: In function 'void init(int, int, std::vector<long long int>, std::vector<int>, int, int, std::vector<int>)':
overtaking.cpp:69:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for (int it=0;it<v.size();it++){
      |                       ~~^~~~~~~~~
overtaking.cpp:74:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             r[j][i-1]=min((it==v.size()-1?INF:e[v[it+1].second][i-1]),mx-x*(s[i]-s[i-1]));
      |                            ~~^~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 0 / 9
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 26
• Subtask 5: 0 / 35