제출 #847747

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

overtaking

#include "overtaking.h"

#include <bits/stdc++.h>
using namespace std;

#define int64_t long long

vector<int> W, S;
vector<int64_t> T;
int N, L, M, X;
vector<vector<int64_t>> e, t;
vector<vector<int>> order;
vector<vector<int64_t>> max_time;

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S) {
        ::T = T;
        ::W = W;
        ::S = S;
        ::N = N;
        ::L = L;
        ::M = M;
        ::X = X;

        t = vector<vector<int64_t>>(M, vector<int64_t>(N));
        e = vector<vector<int64_t>>(M, vector<int64_t>(N));
        for (int i = 0; i < N; i++) t[0][i] = T[i];
        for (int i = 0; i < M - 1; i++) {
                for (int j = 0; j < N; j++) {
                        e[i + 1][j] = t[i][j] + 1ll * W[j] * (S[i + 1] - S[i]);
                }
                vector<int> ord(N);
                iota(ord.begin(), ord.end(), 0);
                sort(ord.begin(), ord.end(), [&](int a, int b) {
                        return t[i][a] < t[i][b];
                });
                order.emplace_back(ord);
                int64_t time = 0;
                max_time.emplace_back(vector<int64_t>{time});
                for (int j = 0; j < N;) {
                        int k = j;
                        while (k < N && t[i][ord[k]] == t[i][ord[j]]) k++;
                        for (int z = j; z < k; z++) t[i + 1][ord[z]] = max(time, e[i + 1][ord[z]]);
                        for (int z = j; z < k; z++) {
                                time = max(time, e[i + 1][ord[z]]);
                                max_time[i].emplace_back(time);
                        }
                        j = k;
                }
        }
}

long long arrival_time(long long Y) {
        int64_t tt = Y;
        for (int i = 0; i < M - 1; i++) {
                int64_t ee = tt + 1ll * (S[i + 1] - S[i]) * X;
                int l = 0, r = N - 1, j = N;
                while (l <= r) {
                        int mid = l + r >> 1;
                        if (tt <= t[i][order[i][mid]]) {
                                j = mid;
                                r = mid - 1;
                        } else {
                                l = mid + 1;
                        }
                }
                tt = max(max_time[i][j], ee);
        }
        return tt;
}

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

overtaking.cpp: In function 'long long int arrival_time(long long int)':
overtaking.cpp:58:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |                         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