oj.uz

Submission #1036431

# Submission time Handle Problem Language Result Execution time Memory
1036431 2024-07-27T10:59:27 Z parsadox2 Ski 2 (JOI24_ski2) C++17
100 / 100
 165 ms 421712 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define int long long
using namespace std;

const int N = 3e2 + 2 , inf = 1e18;
int n , h , a[N] , c[N] , prfmn[N] , dp[N][N][N][2] , nex[N];

int f(int k , int j)
{
    int tmp = k / j;
    int res = tmp * k - tmp * (tmp + 1) * j / 2;
    res *= h;
    return res;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);  cout.tie(0);  cout.tie(0);
    cin >> n >> h;
    vector <pair<int ,int>> vec;
    for(int i = 1 ; i <= n ; i++)
    {
        int x , y;  cin >> x >> y;
        vec.push_back(make_pair(x , y));
    }
    sort(vec.begin() , vec.end());
    for(int i = 0 ; i < n ; i++)
    {
        a[i] = vec[i].F;
        c[i] = vec[i].S;
        prfmn[i] = c[i];
    }
    nex[n - 1] = n;
    a[n] = inf;
    for(int i = n - 2 ; i >= 0 ; i--)
        nex[i] = (a[i] == a[i + 1] ? nex[i + 1] : i + 1);
    /*for(int i = 0 ; i < n ; i++)
        cout << i << " : " << nex[i] << endl;
    for(int i = 0 ; i < n ; i++)
        cout << a[i] << " ";
    cout << '\n';
    for(int i = 0 ; i < n ; i++)
        cout << c[i] << " ";
    cout << '\n';*/
    for(int i = 1 ; i < n ; i++)
        prfmn[i] = min(prfmn[i] , prfmn[i - 1]);
    for(int i = n ; i >= 1 ; i--)  for(int j = 0 ; j <= n ; j++)
    {
        if(i >= j)
            continue;
        dp[n][i][j][0] = dp[n][i + 1][j][0] + prfmn[n - 1];
        dp[n][i][j][0] = min(dp[n][i][j][0] , f(j , i));
        dp[n][i][j][1] = dp[n][i][j][0];
    } 
    for(int i = n - 1 ; i >= 1 ; i--)  for(int j = n ; j >= 1 ; j--)  for(int k = 0 ; k <= i ; k++)
    {
        int tmp = nex[i] - i + k;
        if(tmp <= j)
        {
            dp[i][j][k][0] = dp[nex[i]][j][0][0];
        }
        else
        {
            if(a[i] + 1 == a[nex[i]])
                dp[i][j][k][0] = dp[nex[i]][j][tmp - j][0] + (tmp - j) * h;
            else
                dp[i][j][k][0] = dp[nex[i]][j][tmp - j][1] + (tmp - j) * h;
            dp[i][j][k][0] = min(dp[i][j][k][0] , dp[i][j + 1][k][0] + prfmn[i - 1]);
        }
        if(k <= j)
        {
            dp[i][j][k][1] = dp[i][j][0][0];
        }
        else
        {
            tmp = (a[i] - a[i - 1] - 1) * j;
            if(tmp >= k)
                dp[i][j][k][1] = dp[i][j][0][0] + f(k , j);
            else
            {
                dp[i][j][k][1] = dp[i][j][k - tmp][0] + f(tmp , j) + (k - tmp) * (a[i] - a[i - 1] - 1) * h;
            }
            dp[i][j][k][1] = min(dp[i][j][k][1] , dp[i][j + 1][k][1] + prfmn[i - 1]);
        }
        //cout << i << " " << j << " " << k << " " << dp[i][j][k][0] << " " << dp[i][j][k][1] << endl;
    }
    if(a[0] + 1 == a[nex[0]])
        cout << dp[nex[0]][1][nex[0] - 1][0] + (nex[0] - 1) * h << '\n';
    else
        cout << dp[nex[0]][1][nex[0] - 1][1] + (nex[0] - 1) * h << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 421428 KB Output is correct
2 Correct 155 ms 421492 KB Output is correct
3 Correct 156 ms 421460 KB Output is correct
4 Correct 149 ms 421356 KB Output is correct
5 Correct 151 ms 421512 KB Output is correct
6 Correct 147 ms 421340 KB Output is correct
7 Correct 149 ms 421460 KB Output is correct
8 Correct 149 ms 421460 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 421456 KB Output is correct
2 Correct 151 ms 421364 KB Output is correct
3 Correct 150 ms 421456 KB Output is correct
4 Correct 144 ms 421520 KB Output is correct
5 Correct 152 ms 421372 KB Output is correct
6 Correct 156 ms 421460 KB Output is correct
7 Correct 155 ms 421304 KB Output is correct
8 Correct 150 ms 421476 KB Output is correct
9 Correct 151 ms 421456 KB Output is correct
10 Correct 165 ms 421456 KB Output is correct
11 Correct 163 ms 421456 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
33.0 / 33.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 421428 KB Output is correct
2 Correct 155 ms 421492 KB Output is correct
3 Correct 156 ms 421460 KB Output is correct
4 Correct 149 ms 421356 KB Output is correct
5 Correct 151 ms 421512 KB Output is correct
6 Correct 147 ms 421340 KB Output is correct
7 Correct 149 ms 421460 KB Output is correct
8 Correct 149 ms 421460 KB Output is correct
9 Correct 156 ms 421456 KB Output is correct
10 Correct 151 ms 421364 KB Output is correct
11 Correct 150 ms 421456 KB Output is correct
12 Correct 144 ms 421520 KB Output is correct
13 Correct 152 ms 421372 KB Output is correct
14 Correct 156 ms 421460 KB Output is correct
15 Correct 155 ms 421304 KB Output is correct
16 Correct 150 ms 421476 KB Output is correct
17 Correct 151 ms 421456 KB Output is correct
18 Correct 165 ms 421456 KB Output is correct
19 Correct 163 ms 421456 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 0 ms 860 KB Output is correct
22 Correct 0 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 856 KB Output is correct
26 Correct 0 ms 860 KB Output is correct
27 Correct 0 ms 860 KB Output is correct
28 Correct 0 ms 860 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 0 ms 720 KB Output is correct
31 Correct 0 ms 724 KB Output is correct
32 Correct 0 ms 860 KB Output is correct
33 Correct 0 ms 860 KB Output is correct
34 Correct 0 ms 860 KB Output is correct
35 Correct 1 ms 860 KB Output is correct
36 Correct 0 ms 860 KB Output is correct
37 Correct 0 ms 860 KB Output is correct
38 Correct 1 ms 860 KB Output is correct
39 Correct 0 ms 860 KB Output is correct
40 Correct 1 ms 860 KB Output is correct
41 Correct 1 ms 860 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 3 ms 7260 KB Output is correct
44 Correct 3 ms 7348 KB Output is correct
45 Correct 3 ms 7260 KB Output is correct
46 Correct 2 ms 7376 KB Output is correct
47 Correct 4 ms 7260 KB Output is correct
48 Correct 2 ms 7260 KB Output is correct
49 Correct 2 ms 7260 KB Output is correct
50 Correct 3 ms 7260 KB Output is correct
51 Correct 2 ms 7260 KB Output is correct
52 Correct 3 ms 7260 KB Output is correct
53 Correct 3 ms 7260 KB Output is correct
54 Correct 3 ms 7256 KB Output is correct
55 Correct 3 ms 7432 KB Output is correct
56 Correct 2 ms 7260 KB Output is correct
57 Correct 3 ms 7260 KB Output is correct
58 Correct 3 ms 7260 KB Output is correct
59 Correct 3 ms 7260 KB Output is correct
60 Correct 2 ms 7432 KB Output is correct
61 Correct 3 ms 7260 KB Output is correct
62 Correct 3 ms 7260 KB Output is correct
63 Correct 2 ms 7260 KB Output is correct
64 Correct 2 ms 7260 KB Output is correct
65 Correct 2 ms 7260 KB Output is correct
66 Correct 2 ms 7260 KB Output is correct
67 Correct 2 ms 7260 KB Output is correct
68 Correct 151 ms 421460 KB Output is correct
69 Correct 151 ms 421324 KB Output is correct
70 Correct 150 ms 421456 KB Output is correct
71 Correct 149 ms 421456 KB Output is correct
72 Correct 150 ms 421512 KB Output is correct
73 Correct 146 ms 421364 KB Output is correct
74 Correct 151 ms 421460 KB Output is correct
75 Correct 141 ms 421460 KB Output is correct
76 Correct 150 ms 421440 KB Output is correct
77 Correct 141 ms 421460 KB Output is correct
78 Correct 150 ms 421456 KB Output is correct
79 Correct 149 ms 421456 KB Output is correct
80 Correct 145 ms 421460 KB Output is correct
81 Correct 150 ms 421456 KB Output is correct
82 Correct 159 ms 421304 KB Output is correct
83 Correct 157 ms 421460 KB Output is correct
84 Correct 147 ms 421712 KB Output is correct
85 Correct 160 ms 421352 KB Output is correct
86 Correct 159 ms 421456 KB Output is correct
87 Correct 150 ms 421460 KB Output is correct
88 Correct 142 ms 421456 KB Output is correct
89 Correct 158 ms 421464 KB Output is correct
90 Correct 142 ms 388080 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 421428 KB Output is correct
2 Correct 155 ms 421492 KB Output is correct
3 Correct 156 ms 421460 KB Output is correct
4 Correct 149 ms 421356 KB Output is correct
5 Correct 151 ms 421512 KB Output is correct
6 Correct 147 ms 421340 KB Output is correct
7 Correct 149 ms 421460 KB Output is correct
8 Correct 149 ms 421460 KB Output is correct
9 Correct 156 ms 421456 KB Output is correct
10 Correct 151 ms 421364 KB Output is correct
11 Correct 150 ms 421456 KB Output is correct
12 Correct 144 ms 421520 KB Output is correct
13 Correct 152 ms 421372 KB Output is correct
14 Correct 156 ms 421460 KB Output is correct
15 Correct 155 ms 421304 KB Output is correct
16 Correct 150 ms 421476 KB Output is correct
17 Correct 151 ms 421456 KB Output is correct
18 Correct 165 ms 421456 KB Output is correct
19 Correct 163 ms 421456 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 0 ms 860 KB Output is correct
22 Correct 0 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 856 KB Output is correct
26 Correct 0 ms 860 KB Output is correct
27 Correct 0 ms 860 KB Output is correct
28 Correct 0 ms 860 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 0 ms 720 KB Output is correct
31 Correct 0 ms 724 KB Output is correct
32 Correct 0 ms 860 KB Output is correct
33 Correct 0 ms 860 KB Output is correct
34 Correct 0 ms 860 KB Output is correct
35 Correct 1 ms 860 KB Output is correct
36 Correct 0 ms 860 KB Output is correct
37 Correct 0 ms 860 KB Output is correct
38 Correct 1 ms 860 KB Output is correct
39 Correct 0 ms 860 KB Output is correct
40 Correct 1 ms 860 KB Output is correct
41 Correct 1 ms 860 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 3 ms 7260 KB Output is correct
44 Correct 3 ms 7348 KB Output is correct
45 Correct 3 ms 7260 KB Output is correct
46 Correct 2 ms 7376 KB Output is correct
47 Correct 4 ms 7260 KB Output is correct
48 Correct 2 ms 7260 KB Output is correct
49 Correct 2 ms 7260 KB Output is correct
50 Correct 3 ms 7260 KB Output is correct
51 Correct 2 ms 7260 KB Output is correct
52 Correct 3 ms 7260 KB Output is correct
53 Correct 3 ms 7260 KB Output is correct
54 Correct 3 ms 7256 KB Output is correct
55 Correct 3 ms 7432 KB Output is correct
56 Correct 2 ms 7260 KB Output is correct
57 Correct 3 ms 7260 KB Output is correct
58 Correct 3 ms 7260 KB Output is correct
59 Correct 3 ms 7260 KB Output is correct
60 Correct 2 ms 7432 KB Output is correct
61 Correct 3 ms 7260 KB Output is correct
62 Correct 3 ms 7260 KB Output is correct
63 Correct 2 ms 7260 KB Output is correct
64 Correct 2 ms 7260 KB Output is correct
65 Correct 2 ms 7260 KB Output is correct
66 Correct 2 ms 7260 KB Output is correct
67 Correct 2 ms 7260 KB Output is correct
68 Correct 151 ms 421460 KB Output is correct
69 Correct 151 ms 421324 KB Output is correct
70 Correct 150 ms 421456 KB Output is correct
71 Correct 149 ms 421456 KB Output is correct
72 Correct 150 ms 421512 KB Output is correct
73 Correct 146 ms 421364 KB Output is correct
74 Correct 151 ms 421460 KB Output is correct
75 Correct 141 ms 421460 KB Output is correct
76 Correct 150 ms 421440 KB Output is correct
77 Correct 141 ms 421460 KB Output is correct
78 Correct 150 ms 421456 KB Output is correct
79 Correct 149 ms 421456 KB Output is correct
80 Correct 145 ms 421460 KB Output is correct
81 Correct 150 ms 421456 KB Output is correct
82 Correct 159 ms 421304 KB Output is correct
83 Correct 157 ms 421460 KB Output is correct
84 Correct 147 ms 421712 KB Output is correct
85 Correct 160 ms 421352 KB Output is correct
86 Correct 159 ms 421456 KB Output is correct
87 Correct 150 ms 421460 KB Output is correct
88 Correct 142 ms 421456 KB Output is correct
89 Correct 158 ms 421464 KB Output is correct
90 Correct 142 ms 388080 KB Output is correct
91 Correct 151 ms 421456 KB Output is correct
92 Correct 148 ms 421448 KB Output is correct
93 Correct 153 ms 421584 KB Output is correct
94 Correct 142 ms 421460 KB Output is correct
95 Correct 143 ms 421456 KB Output is correct
96 Correct 147 ms 421460 KB Output is correct
97 Correct 143 ms 421460 KB Output is correct
98 Correct 156 ms 421468 KB Output is correct
99 Correct 147 ms 421456 KB Output is correct
100 Correct 154 ms 421456 KB Output is correct
101 Correct 151 ms 421464 KB Output is correct
102 Correct 149 ms 421460 KB Output is correct
103 Correct 151 ms 421452 KB Output is correct
104 Correct 159 ms 421320 KB Output is correct
105 Correct 152 ms 421456 KB Output is correct
106 Correct 151 ms 421456 KB Output is correct
107 Correct 157 ms 421456 KB Output is correct
108 Correct 146 ms 421524 KB Output is correct
109 Correct 148 ms 421452 KB Output is correct
110 Correct 152 ms 421456 KB Output is correct
111 Correct 141 ms 388180 KB Output is correct