제출 #241220

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241220		osaaateiasavtnl	Long Distance Coach (JOI17_coach)	C++17	71 / 100	2073 ms	24524 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));

    map <int, int> pos;
    for (int i = 0; i < a.size(); ++i)
        pos[a[i].f] = i;        

    vector <int> c;
    for (auto e : a)    
        c.app(e.f);
    sort(all(c));

    auto getcnt = [&](int x, int d) {
        if (x < d)
            return 0ll; 
        int k = (x-d)/t;
        return k + 1;
    };  
    vector <int> last(s.size()), mem(a.size(), s.size());
    for (int i = 0; i < s.size(); ++i) {
        int p = lower_bound(all(c), s[i]%t) - c.begin();
        p = (p - 1 + c.size()) % c.size();
        last[i] = pos[c[p]];
        mem[last[i]] = min(mem[last[i]], i);
    }
    vector <int> dp(a.size()+1, -1);
    dp[0] = (x/t+1)*w;
    for (int i = 0; i < a.size(); ++i) {
        int cur = 0;
        int lf = -1;
        for (int j = i + 1; j <= a.size(); ++j) {
            if (j > i + 1) {
                if (mem[j - 1] != s.size()) {
                    if (lf == -1)
                        lf = mem[j - 1];
                    else
                        lf = min(lf, mem[j - 1]);
                }   
                if (lf == -1)
                    break;
                else
                    cur += a[j-1].s + (getcnt(s[lf], a[j-1].f)-1) * w;
            }   

            int save = 0;
            if (j < a.size()) {
                save = (x/t+(a[j].f<=(x%t))) * w;
            }
            if (dp[j] == -1) {
                dp[j] = dp[i]+cur+save;
            }   
            else {
                dp[j] = min(dp[j], dp[i]+cur+save);
            }
        }   
    }   
    cout << (int)dp[a.size()] << endl;
}

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

coach.cpp: In function 'int main()':
coach.cpp:40:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); ++i)
                     ~~^~~~~~~~~~
coach.cpp:55:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < s.size(); ++i) {
                     ~~^~~~~~~~~~
coach.cpp:63:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); ++i) {
                     ~~^~~~~~~~~~
coach.cpp:66:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = i + 1; j <= a.size(); ++j) {
                             ~~^~~~~~~~~~~
coach.cpp:68:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if (mem[j - 1] != s.size()) {
coach.cpp:81:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (j < a.size()) {
                 ~~^~~~~~~~~~

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