oj.uz

Submission #600742

# Submission time Handle Problem Language Result Execution time Memory
600742 2022-07-21T07:33:57 Z 이동현(#8470) Long Distance Coach (JOI17_coach) C++17
71 / 100
 2000 ms 25344 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int NS = (int)2e5 + 4;
int x, n, m, w, t;
int r[NS];
int s[NS];
vector<int> peo[NS];
int dp[NS];
int A[NS], B[NS];

vector<int> line[NS];
int lineN, f;

int cross(vector<int> x, vector<int> y){
    return (y[1] - x[1]) / (x[0] - y[0]) + !!((y[1] - x[1]) % (x[0] - y[0]));
}

void push(int a, int b){
    while(lineN - f >= 2 && cross(line[lineN - 1], line[lineN - 2]) >= cross({a, b}, line[lineN - 1])) --lineN;
    line[lineN++] = {a, b};
}

int get(int x){
    if(f == lineN) return (int)1e18;
    int mn = (int)1e18;
    for(int i = f; i < lineN; ++i) mn = min(mn, line[i][0] * x + line[i][1]);
    return mn;
    while(lineN - f >= 2 && x >= cross(line[f + 1], line[f])) ++f;
    return line[f][0] * x + line[f][1];
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> x >> n >> m >> w >> t;
    for(int i = 1; i <= n; ++i){
        cin >> s[i];
    }
    ++n; s[n] = x;
    for(int i = 1; i <= m; ++i){
        peo[i].resize(2);
        cin >> peo[i][0] >> peo[i][1];
    }
    sort(s + 1, s + n + 1, [&](int&x, int&y){return x % t < y % t;});
    sort(peo + 1, peo + m + 1);
    int pp = 0;
    for(int i = 1; i <= n; ++i){
        while(pp + 1 <= m && peo[pp + 1][0] < s[i] % t){
            ++pp;
        }
        r[i] = pp;
    }
    auto eat = [&](int all, int me)->int{
        if(all >= me) return (all - me) / t + 1;
        return 0;
    };
    for(int i = 1; i <= m; ++i){
        A[i] = w * eat(x, peo[i][0]);
        A[i] += A[i - 1];
        B[i] = peo[i][1] - w * eat(x, peo[i][0]);
        B[i] += B[i - 1];
    }
    int ans = A[m];
    int ikmn = 0;
    for(int j = 0; j < r[1]; ++j){
        push(-j, ikmn - B[j]);
    }
    for(int i = 1; i <= n; ++i){
        int X = w * (s[i] / t);
        dp[i] = get(X) + X * r[i] + A[r[i]] + B[r[i]];
        dp[i] = min(dp[i], ikmn + A[r[i]]);
        ikmn = min(ikmn, dp[i] - A[r[i]]);
        if(i < n){
            for(int j = r[i]; j < r[i + 1]; ++j){
                push(-j, ikmn - B[j]);
            }
        }

        int nval = dp[i] + A[m] - A[r[i]];
        ans = min(ans, nval);
    }
    ans += w * eat(x, 0);
    cout << ans << '\n';
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9740 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9656 KB Output is correct
7 Correct 8 ms 9652 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9732 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 7 ms 9632 KB Output is correct
13 Correct 7 ms 9640 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9736 KB Output is correct
16 Correct 5 ms 9732 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 6 ms 9652 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9732 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9740 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9656 KB Output is correct
7 Correct 8 ms 9652 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9732 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 7 ms 9632 KB Output is correct
13 Correct 7 ms 9640 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9736 KB Output is correct
16 Correct 5 ms 9732 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 6 ms 9652 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9732 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 7 ms 9684 KB Output is correct
26 Correct 7 ms 9728 KB Output is correct
27 Correct 5 ms 9684 KB Output is correct
28 Correct 6 ms 9732 KB Output is correct
29 Correct 8 ms 9684 KB Output is correct
30 Correct 7 ms 9732 KB Output is correct
31 Correct 7 ms 9684 KB Output is correct
32 Correct 7 ms 9684 KB Output is correct
33 Correct 6 ms 9752 KB Output is correct
34 Correct 6 ms 9684 KB Output is correct
35 Correct 6 ms 9716 KB Output is correct
36 Correct 5 ms 9684 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9740 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9656 KB Output is correct
7 Correct 8 ms 9652 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9732 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 7 ms 9632 KB Output is correct
13 Correct 7 ms 9640 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9736 KB Output is correct
16 Correct 5 ms 9732 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 6 ms 9652 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9732 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 7 ms 9684 KB Output is correct
26 Correct 7 ms 9728 KB Output is correct
27 Correct 5 ms 9684 KB Output is correct
28 Correct 6 ms 9732 KB Output is correct
29 Correct 8 ms 9684 KB Output is correct
30 Correct 7 ms 9732 KB Output is correct
31 Correct 7 ms 9684 KB Output is correct
32 Correct 7 ms 9684 KB Output is correct
33 Correct 6 ms 9752 KB Output is correct
34 Correct 6 ms 9684 KB Output is correct
35 Correct 6 ms 9716 KB Output is correct
36 Correct 5 ms 9684 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 7 ms 9812 KB Output is correct
39 Correct 7 ms 9864 KB Output is correct
40 Correct 7 ms 9916 KB Output is correct
41 Correct 7 ms 9856 KB Output is correct
42 Correct 8 ms 9812 KB Output is correct
43 Correct 7 ms 9812 KB Output is correct
44 Correct 7 ms 9952 KB Output is correct
45 Correct 11 ms 9880 KB Output is correct
46 Correct 12 ms 9872 KB Output is correct
47 Correct 8 ms 9812 KB Output is correct
48 Correct 8 ms 9940 KB Output is correct
49 Correct 8 ms 9856 KB Output is correct
50 Correct 7 ms 9908 KB Output is correct
51 Correct 8 ms 9932 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9740 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9656 KB Output is correct
7 Correct 8 ms 9652 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 6 ms 9732 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 7 ms 9632 KB Output is correct
13 Correct 7 ms 9640 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9736 KB Output is correct
16 Correct 5 ms 9732 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 8 ms 9684 KB Output is correct
19 Correct 6 ms 9684 KB Output is correct
20 Correct 6 ms 9652 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9732 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 6 ms 9684 KB Output is correct
25 Correct 7 ms 9684 KB Output is correct
26 Correct 7 ms 9728 KB Output is correct
27 Correct 5 ms 9684 KB Output is correct
28 Correct 6 ms 9732 KB Output is correct
29 Correct 8 ms 9684 KB Output is correct
30 Correct 7 ms 9732 KB Output is correct
31 Correct 7 ms 9684 KB Output is correct
32 Correct 7 ms 9684 KB Output is correct
33 Correct 6 ms 9752 KB Output is correct
34 Correct 6 ms 9684 KB Output is correct
35 Correct 6 ms 9716 KB Output is correct
36 Correct 5 ms 9684 KB Output is correct
37 Correct 5 ms 9684 KB Output is correct
38 Correct 7 ms 9812 KB Output is correct
39 Correct 7 ms 9864 KB Output is correct
40 Correct 7 ms 9916 KB Output is correct
41 Correct 7 ms 9856 KB Output is correct
42 Correct 8 ms 9812 KB Output is correct
43 Correct 7 ms 9812 KB Output is correct
44 Correct 7 ms 9952 KB Output is correct
45 Correct 11 ms 9880 KB Output is correct
46 Correct 12 ms 9872 KB Output is correct
47 Correct 8 ms 9812 KB Output is correct
48 Correct 8 ms 9940 KB Output is correct
49 Correct 8 ms 9856 KB Output is correct
50 Correct 7 ms 9908 KB Output is correct
51 Correct 8 ms 9932 KB Output is correct
52 Correct 240 ms 24580 KB Output is correct
53 Correct 255 ms 24704 KB Output is correct
54 Correct 212 ms 24736 KB Output is correct
55 Correct 233 ms 24780 KB Output is correct
56 Correct 219 ms 24780 KB Output is correct
57 Correct 223 ms 24776 KB Output is correct
58 Correct 239 ms 24716 KB Output is correct
59 Correct 250 ms 24760 KB Output is correct
60 Correct 214 ms 24792 KB Output is correct
61 Correct 236 ms 24792 KB Output is correct
62 Correct 216 ms 24736 KB Output is correct
63 Execution timed out 2032 ms 25344 KB Time limit exceeded
64 Halted 0 ms 0 KB -