제출 #241216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241216		osaaateiasavtnl	Long Distance Coach (JOI17_coach)	C++17	46 / 100	2086 ms	504 KiB

coach

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int x, n, m, w, t;
    cin >> x >> n >> m >> w >> t;
 
    //first - d, second - c
 
    vector <int> s(n);
    for (int i = 0; i < n; ++i) 
        cin >> s[i];
    sort(all(s));
    s.app(x);
 
    vector <ii> a(m);
    for (int i = 0; i < m; ++i) 
        cin >> a[i].f >> a[i].s;
 
    sort(all(a));
    reverse(all(a));
    a.insert(a.begin(), mp(0, 0));
 
    auto getcnt = [&](int x, int d) {
        //d + k * t <= x
        //k * t <= x - d
 
        if (x < d)
            return 0ll;
 
        int k = (x-d)/t;
        return k + 1;
    };  
    auto get = [&](int i, int j) {
        int di = a[i].f, dj = a[j%a.size()].f;
        for (int p = 0; p < s.size(); ++p) {
            if (getcnt(s[p], di) > getcnt(s[p], dj) || (getcnt(s[p], di) == getcnt(s[p], dj) && di > dj)) {
                return a[i].s + (getcnt(s[p], di)-1)*w;
            }
        }
        return -1ll;
    };
    auto save = [&](int i) {
        if (i == a.size())
            return 0ll;
        int cnt = x/t+(a[i].f<=(x%t));
        return cnt * w;
    };
 
    vector <int> dp(a.size()+1, -1);
    dp[0] = (x/t+1)*w;
    for (int i = 0; i < a.size(); ++i) {
        int cur = 0;
        for (int j = i + 1; j <= a.size(); ++j) {
            if (j > i + 1) {
                int add = get(j-1, i);
                if (add == -1)
                    break;
                cur += add;
            }   
            if (dp[j] == -1) {
                dp[j] = dp[i]+cur+save(j);
            }   
            else {
                dp[j] = min(dp[j], dp[i]+cur+save(j));
            }
        }   
    }   
    cout << (int)dp[a.size()] << endl;
}

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

coach.cpp: In lambda function:
coach.cpp:51:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int p = 0; p < s.size(); ++p) {
                         ~~^~~~~~~~~~
coach.cpp: In lambda function:
coach.cpp:59:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (i == a.size())
             ~~^~~~~~~~~~~
coach.cpp: In function 'int main()':
coach.cpp:67:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); ++i) {
                     ~~^~~~~~~~~~
coach.cpp:69:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = i + 1; j <= a.size(); ++j) {
                             ~~^~~~~~~~~~~

• Subtask 1: 16 / 16
• Subtask 2: 30 / 30
• Subtask 3: 0 / 25
• Subtask 4: 0 / 29