oj.uz

Submission #416237

# Submission time Handle Problem Language Result Execution time Memory
416237 2021-06-02T08:18:27 Z Aldas25 Long Distance Coach (JOI17_coach) C++14
100 / 100
 190 ms 23208 KB 
#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(0)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<piii> viii;

const int MAXN = 200100, MAXK = 30;
//const ll MOD = 998244353;
const ll INF = 4e18;
const ld PI = asin(1) * 2;

struct Line {
    ll k, b;
    Line (ll _k, ll _b) : k(_k), b(_b) {}
    ll operator() (ll x) {return k*x + b;}
};

ld intersection (Line a, Line b) {
    return ((ld)(b.b - a.b)) / ((ld)(a.k - b.k));
}

deque<Line> dq;

void insertLine (ll k, ll b) {
    Line nw (k, b);

    while ((int)dq.size() >= 2 && intersection(nw, dq[(int)dq.size()-2]) <= intersection( dq[(int)dq.size()-1], dq[(int)dq.size()-2])) {
        dq.pop_back();
    }

    dq.push_back(nw);
}

ll get (ll x) {
    if ((int)dq.size() == 1) return dq[0](x);
    int le = 0, ri = (int)dq.size()-2;
    while (le < ri) {
        int mid = (le+ri+1)/2;
        if (intersection(dq[mid], dq[mid+1]) < x) le = mid;
        else ri = mid-1;
    }
    return min (dq[le](x), dq[le+1](x));
}

ll x, n, m, w, t;
ll s[MAXN];
vector<pair<ll, ll>> tmp;
ll firstStop[MAXN];
ll dp[MAXN][2];
ll d[MAXN], c[MAXN];
ll prefC[MAXN];
ll waterDrunk[MAXN];

int main()
{
    FAST_IO;

    cin >> x >> n >> m >> w >> t;
    //cout << " x=" << x << " n=" << n  << " m="<< m  << " w=" << w  << " t="<< t << endl;
    FOR(i, 1, n) cin >> s[i];
    sort(s+1, s+n+1);
    s[++n] = x; /// the finish
    //cout << " n = " << n << " m = " << m << endl;
    REP(m) {
      //  cout << " here " << endl;
        ll dd =-1, cc = -1;
        cin >> dd >> cc;
        //cout << "   dd = " << dd << " cc = " << cc << endl;
        tmp.pb({dd, cc});
    }
    sort(tmp.begin(), tmp.end());
    tmp.pb({0, 0}); /// driver
    m++;
    FOR(i, 0, m-1) {
        d[i+1] = tmp[i].f;
        c[i+1] = tmp[i].s;
    }
    FOR(i, 1, m) prefC[i] = prefC[i-1] + c[i];


    FOR(i, 1, n) {
        ll pos = s[i]%t;
        ll latest = m;
        if (d[1] < pos) {
            int le = 1, ri = m-1;
            while (le < ri) {
                int mid = (le+ri+1)/2;
                if (d[mid] < pos) le = mid;
                else ri = mid-1;
            }
            latest = le;
        }

        if (firstStop[latest] == 0) {
            firstStop[latest] = i;
        }

        waterDrunk[i] = (s[i]-1) / t;
        waterDrunk[i] *= m;
        waterDrunk[i]++;
        if(latest < m) waterDrunk[i] += latest;
        waterDrunk[i] *= w;

        //cout << "  i = " << i << " s="<< s[i] << " waterDrunk = " << waterDrunk[i] << "  latest = " << latest << endl;
    }

    //FOR(i, 1, m) cout << "     i = " << i << "  firstStop = " << firstStop[i] << endl;

    insertLine(0, 0);

    FOR(i, 1, m) {
        ll waterThis = (x/t) + (d[i] < (x%t));
        waterThis *= w;

        dp[i][1] = waterThis + min(dp[i-1][0], dp[i-1][1]);
        dp[i][0] = dp[i][1];

        if (firstStop[i] == 0) {
            //cout << " i = " << i << " d = " << d[i] << "  dp0 = dp1 = " << dp[i][1]  << "  (in cont) " << endl;
            insertLine(-i, min(dp[i][0], dp[i][1]) - prefC[i]);
            continue; /// cannot take since d[i-1] is never an end before a stop
        }

        /*FOR(j, 0, i-1) {
            ll water = (s[firstStop[i]] - 1) / t;
            //water ++;
            //water *= (ll)(i-j);
            water *= w;
            ll cur = -water*j + min(dp[j][0], dp[j][1]) - prefC[j]  + prefC[i] + water*i;
            //dp[i][0] = min(dp[i][0], cur);

            cout << "    i = " << i << " j = " << j << " cur = " << cur  << "    water = " << water << endl;
        }*/

        ll water = (s[firstStop[i]] - 1) / t;
        //water ++;
        //water *= (ll)(i-j);
        water *= w;
        ll cur = get(water) + prefC[i] + water*i;
        dp[i][0] = min(dp[i][0], cur);

        insertLine(-i, min(dp[i][0], dp[i][1]) - prefC[i]);

       // cout << " i = " << i << " d = " << d[i] << "   dp0 = " << dp[i][0] << " dp1 = " << dp[i][1] << endl;
    }

    cout << dp[m][1] << "\n";

    return 0;
}

/*
1000000000000 1 1 1000000 6
999999259244
1 123456789
*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 1 ms 460 KB Output is correct
44 Correct 2 ms 460 KB Output is correct
45 Correct 2 ms 460 KB Output is correct
46 Correct 2 ms 460 KB Output is correct
47 Correct 2 ms 460 KB Output is correct
48 Correct 2 ms 460 KB Output is correct
49 Correct 2 ms 460 KB Output is correct
50 Correct 2 ms 460 KB Output is correct
51 Correct 2 ms 460 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 2 ms 460 KB Output is correct
39 Correct 2 ms 460 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 460 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 1 ms 460 KB Output is correct
44 Correct 2 ms 460 KB Output is correct
45 Correct 2 ms 460 KB Output is correct
46 Correct 2 ms 460 KB Output is correct
47 Correct 2 ms 460 KB Output is correct
48 Correct 2 ms 460 KB Output is correct
49 Correct 2 ms 460 KB Output is correct
50 Correct 2 ms 460 KB Output is correct
51 Correct 2 ms 460 KB Output is correct
52 Correct 188 ms 15996 KB Output is correct
53 Correct 175 ms 21824 KB Output is correct
54 Correct 141 ms 20888 KB Output is correct
55 Correct 147 ms 21180 KB Output is correct
56 Correct 144 ms 21432 KB Output is correct
57 Correct 145 ms 21280 KB Output is correct
58 Correct 146 ms 21808 KB Output is correct
59 Correct 144 ms 21168 KB Output is correct
60 Correct 145 ms 20920 KB Output is correct
61 Correct 143 ms 21288 KB Output is correct
62 Correct 142 ms 21140 KB Output is correct
63 Correct 135 ms 23208 KB Output is correct
64 Correct 122 ms 20392 KB Output is correct
65 Correct 188 ms 21756 KB Output is correct
66 Correct 184 ms 21840 KB Output is correct
67 Correct 174 ms 21808 KB Output is correct
68 Correct 175 ms 21976 KB Output is correct
69 Correct 183 ms 21580 KB Output is correct
70 Correct 179 ms 21556 KB Output is correct
71 Correct 179 ms 21572 KB Output is correct
72 Correct 178 ms 21636 KB Output is correct
73 Correct 181 ms 21612 KB Output is correct
74 Correct 179 ms 21572 KB Output is correct
75 Correct 190 ms 21688 KB Output is correct
76 Correct 187 ms 21712 KB Output is correct
77 Correct 144 ms 21476 KB Output is correct
78 Correct 157 ms 21696 KB Output is correct
79 Correct 175 ms 21220 KB Output is correct
80 Correct 174 ms 21168 KB Output is correct