Submission #1067690

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067690		vjudge1	Overtaking (IOI23_overtaking)	C++17	0 / 100	2 ms	1628 KiB

overtaking

#include "overtaking.h"
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize(3)
#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];
ll XTH[1010][1010];
ll sped;
int M;
multiset<int>st[1010];
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);
    }
    for(int i=1;i<=N;i++) for(int j=1;j<M;j++) if(W[i-1]>X)
        station[j-1][dp[i][j-1]]=max(station[j-1][dp[i][j-1]],dp[i][j]);
    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].insert(dp[i][j]);
    for(int i=0,CC=0;i<M;i++,CC=0)
        for(auto j:st[i])
            XTH[i][CC++]=0;
    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;
}
int stuf;
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&&
            (!C||XTH[mid][C-1]<GO(ST,mid)+T))
            l=mid+1,res=mid;
        else r=mid-1;
    }
    ST=res;
    return memo[STA][org]=CCCALC(res+1,(--station[res].lower_bound(T))->second);
}
int CC=0;
ll arrival_time(ll Y){
    return CCCALC(0,Y);
}

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