Submission #1067720

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067720		vjudge1	Overtaking (IOI23_overtaking)	C++17	65 / 100	3555 ms	255288 KiB

overtaking

#include "overtaking.h"
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
#define GO(l,r) (sped*(dis[r]-dis[l]))
typedef long long ll;
map<ll,ll> station[1010];
map<ll,int> Pos[1010];
#define MP make_pair
vector<ll> dis;
unordered_map<ll,ll>memo[1010];
ll dp[1010][1010],XTH[1010][1010];
ll sped;
vector<ll>st[1010];
int M;
inline int onezsmaller(int station,ll T){
    return (--Pos[station].lower_bound(T))->second;
}
void init(int L, int N, vector<ll> T, vector<int> W, int X, int M_, vector<int> S){
    for(auto i:S)dis.push_back(i);
    sped=X;
    M=M_;
    for(int i=1;i<=N;i++)
        dp[i][0]=T[i-1];
    for(int j=1;j<M;j++) {for(int i=1;i<=N;i++)
        dp[i][j]=dp[i][j-1]+(dis[j]-dis[j-1])*W[i-1];
        vector<int>V(N);
        iota(V.begin(),V.end(),1);
        sort(V.begin(),V.end(),[j](int a,int b){
            return MP(dp[a][j-1],dp[a][j])<
                    MP(dp[b][j-1],dp[b][j]);
        });
        ll prv=0;
        for(auto i:V) {
            prv=dp[i][j]=max(dp[i][j],prv);
            if(W[i-1]>X)
                station[j-1][dp[i][j-1]]=dp[i][j];
        }
    }
    int x=clock();
    for(int i=1;i<=N;i++)
        for(int j=0;j<M;j++)
            if(W[i-1]>X)
                Pos[j][dp[i][j]]++,
                st[j].push_back(dp[i][j]);
    for(int i=0;i<M;i++)
        st[i].push_back(-1),
        sort(st[i].begin(),st[i].end());
    int y=clock();
    for(int i=0,CC=0;i<M;i++,CC=0)
        for(auto j:st[i])
            XTH[i][CC++]=j;
    for(int j=0;j<M;Pos[j++][-1]) if(Pos[j].size())
        for(auto it=Pos[j].begin();++it!=Pos[j].end();)
            it->second+=prev(it)->second;
    for(int j=0;j<M-1;j++)
        station[j][-1]=0;
    cerr<<(y-x)/1.0/CLOCKS_PER_SEC<<'\n';
}
ll CCCALC(int STA,ll T){
    int ST=STA;
    ll org=T;
    if(memo[ST][T])
        return memo[ST][T];
    int C=onezsmaller(ST,T);
    if(C==onezsmaller(M-1,GO(ST,M-1)+T))
        return GO(ST,M-1)+T;
    int l=ST,r=M-1,res=-1;
    while(l<=r){
        int mid=l+r>>1;
        if(XTH[mid][C]<GO(ST,mid)+T)
            l=mid+1,res=mid;
        else r=mid-1;
    }
    assert(res>=0);
    T+=GO(ST,res);
    ST=res;
    return memo[STA][org]=CCCALC(res+1,(--station[res].lower_bound(T))->second);
}
int ans,CC;
ll arrival_time(ll Y){
    ll res= CCCALC(0,Y);
    return res;
}

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:25:27: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   25 |     for(int j=1;j<M;j++) {for(int i=1;i<=N;i++)
      |                           ^~~
overtaking.cpp:27:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   27 |         vector<int>V(N);
      |         ^~~~~~
overtaking.cpp: In function 'll CCCALC(int, ll)':
overtaking.cpp:70:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   70 |         int mid=l+r>>1;
      |                 ~^~

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