제출 #1067669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1067669		vjudge1	추월 (IOI23_overtaking)	C++17	19 / 100	9 ms	4444 KiB

overtaking

#include "overtaking.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
map<ll,ll> station[1010];
#define MP make_pair
vector<ll> dis;
ll dp[1010][1010];
ll sped;
int M;
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++)
        station[j-1][dp[i][j-1]]=dp[i][j];
    for(int j=0;j<M-1;j++)
        station[j][-1]=0;
}
ll arrival_time(ll Y){
    for(int i=0;i<M-1;i++)
        Y=max(Y+sped*(dis[i+1]-dis[i]),(--station[i].lower_bound(Y))->second);
    return Y;
}

컴파일 시 표준 에러 (stderr) 메시지

overtaking.cpp: In function 'void init(int, int, std::vector<long long int>, std::vector<int>, int, int, std::vector<int>)':
overtaking.cpp:17:27: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   17 |     for(int j=1;j<M;j++) {for(int i=1;i<=N;i++)
      |                           ^~~
overtaking.cpp:19:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   19 |         vector<int>V(N);
      |         ^~~~~~

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