oj.uz

답안 #1023288

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023288 2024-07-14T15:01:27 Z GrindMachine Long Distance Coach (JOI17_coach) C++17
100 / 100
 113 ms 21696 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

/*

refs:
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

struct Line{
    ll m,c;
    ll f(ll x){
        return m*x+c;
    }
    ll intersect(Line l2){
        auto [m2,c2] = l2;
        return ceil((ld)(c2-c)/(m-m2));
    }
};

struct CHT{
    vector<pair<Line,ll>> cht;

    void insert(Line l){
        while(!cht.empty()){
            auto [l2,x] = cht.back();
            if(l.f(x) < l2.f(x)){
                cht.pop_back();
            }
            else{
                break;
            }
        }

        if(cht.empty()){
            cht.pb({l,0});
        }
        else{
            ll x = l.intersect(cht.back().ff);
            cht.pb({l,x});
        }
    }

    ll query(ll x){
        ll lo = 0, hi = sz(cht)-1;
        ll pos = -1;

        while(lo <= hi){
            ll mid = (lo+hi) >> 1;
            if(x >= cht[mid].ss){
                pos = mid;
                lo = mid+1;
            }
            else{
                hi = mid-1;
            }
        }

        assert(pos != -1);
        return cht[pos].ff.f(x);
    }
};

void solve(int test_case)
{
    ll X,n,m,W,T; cin >> X >> n >> m >> W >> T;
    vector<ll> a(n+1); // refilling points
    rep(i,n) cin >> a[i]; 
    a[n] = X;
    n++;

    auto cmp = [&](ll x, ll y){
        return x%T < y%T;
    };

    sort(all(a),cmp);

    vector<pll> b(m+1); // passengers
    rep1(i,m) cin >> b[i].ff >> b[i].ss;
    b[0] = {0,inf2};
    sort(all(b));
    m++;

    vector<ll> dp(m,inf2); // dp[i] = min cost for [0..i] if i is the last alive guy
    dp[0] = ((X-1)/T+1)*W;
    vector<ll> dp2(m,inf2);
    dp2[0] = dp[0];

    vector<ll> mnv(m,inf2);
    ll ptr = 0;

    rep(i,m){
        ll l = b[i].ff, r = inf2;
        if(i+1 < m) r = b[i+1].ff;
        while(ptr < n and a[ptr]%T <= l){
            ptr++;
        }

        while(ptr < n and a[ptr]%T < r){
            amin(mnv[i],(a[ptr++]/T)*W);
        }
    }

    vector<ll> p(m);
    rep(i,m){
        p[i] = b[i].ss;
        if(i) p[i] += p[i-1];
    }

    CHT cht;
    cht.insert({0,dp2[0]-p[0]});

    rep1(i,m-1){
        auto [d,c] = b[i];
        ll mul = mnv[i-1];

        if(mul < inf2){
            dp[i] = mul*(i-1)+p[i-1]+cht.query(mul);
        }
        else{
            ll j = i-1;
            dp[i] = mul*(i-j-1)+dp2[j]+p[i-1]-p[j];    
        }

        mul = mnv[i];

        if(mul < inf2){
            dp2[i] = mul*i+p[i]+cht.query(mul);
        }

        ll times = (X-d-1)/T+1;
        dp[i] += times*W;
        amin(dp2[i],dp[i]);

        cht.insert({-i,dp2[i]-p[i]});
    }

    ll ans = dp2[m-1];
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 452 KB Output is correct
32 Correct 0 ms 460 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 452 KB Output is correct
32 Correct 0 ms 460 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 520 KB Output is correct
48 Correct 1 ms 556 KB Output is correct
49 Correct 1 ms 520 KB Output is correct
50 Correct 1 ms 516 KB Output is correct
51 Correct 1 ms 600 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 452 KB Output is correct
32 Correct 0 ms 460 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 520 KB Output is correct
48 Correct 1 ms 556 KB Output is correct
49 Correct 1 ms 520 KB Output is correct
50 Correct 1 ms 516 KB Output is correct
51 Correct 1 ms 600 KB Output is correct
52 Correct 97 ms 16992 KB Output is correct
53 Correct 87 ms 16976 KB Output is correct
54 Correct 93 ms 17860 KB Output is correct
55 Correct 92 ms 17392 KB Output is correct
56 Correct 97 ms 16976 KB Output is correct
57 Correct 113 ms 16472 KB Output is correct
58 Correct 102 ms 16968 KB Output is correct
59 Correct 95 ms 17228 KB Output is correct
60 Correct 95 ms 16728 KB Output is correct
61 Correct 95 ms 17232 KB Output is correct
62 Correct 92 ms 16912 KB Output is correct
63 Correct 91 ms 21696 KB Output is correct
64 Correct 67 ms 17032 KB Output is correct
65 Correct 104 ms 16976 KB Output is correct
66 Correct 101 ms 16980 KB Output is correct
67 Correct 102 ms 16976 KB Output is correct
68 Correct 100 ms 16976 KB Output is correct
69 Correct 94 ms 16716 KB Output is correct
70 Correct 93 ms 16840 KB Output is correct
71 Correct 94 ms 16964 KB Output is correct
72 Correct 93 ms 16724 KB Output is correct
73 Correct 93 ms 16720 KB Output is correct
74 Correct 94 ms 16716 KB Output is correct
75 Correct 106 ms 16964 KB Output is correct
76 Correct 90 ms 16860 KB Output is correct
77 Correct 96 ms 19784 KB Output is correct
78 Correct 96 ms 16972 KB Output is correct
79 Correct 96 ms 16480 KB Output is correct
80 Correct 90 ms 16460 KB Output is correct