oj.uz

Submission #977166

# Submission time Handle Problem Language Result Execution time Memory
977166 2024-05-07T12:50:19 Z saayan007 Race (IOI11_race) C++17
31 / 100
 304 ms 201808 KB 
#include "race.h"
#include "bits/stdc++.h"
using namespace std;
#warning notusing64bitintegers

#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define repd(i, a, b) for(int i = (a); i >= (b); --i)

#define em emplace
#define eb emplace_back

const int mxN = 200010;
const int mxK = 105;
vector<pair<int, int>> adj[mxN];
int dp[mxN][mxK], sm[mxN][mxK];
int ans = mxN;

void dfs(int x, int p, int K) {
    dp[x][0] = 0;
    for(auto [y, w] : adj[x]) {
        if(y == p) continue;
        dfs(y, x, K);
        rep(i, w, K) {
            if(dp[x][i] > 1 + dp[y][i - w]) {
                sm[x][i] = dp[x][i];
                dp[x][i] = 1 + dp[y][i - w];
            }
            else if(sm[x][i] > 1 + dp[y][i - w]) {
                sm[x][i] = 1 + dp[y][i - w];
            }
        }
    }
}

void solve(int x, int p, int K) {
    ans = min(ans, dp[x][K]);
    for(auto [y, w]: adj[x]) {
        if(y == p) continue;
        rep(l, w, K) {
            int here = dp[y][l - w] + 1;
            int there = dp[x][K - l];
            if(K - l - w >= 0 && there == 1 + dp[y][K - l - w])
                there = sm[x][K - l];
            ans = min(ans, here + there);
        }
        solve(y, x, K);
    }
}

int best_path(int N, int K, int H[][2], int L[])
{
    rep(i, 0, N - 2) {
        adj[H[i][0] + 1].eb(H[i][1] + 1, L[i]);
        adj[H[i][1] + 1].eb(H[i][0] + 1, L[i]);
    }

    rep(i, 0, N) rep(j, 0, K) dp[i][j] = sm[i][j] = mxN;
    dfs(1, -1, K);
    solve(1, -1, K);
    if(ans >= N) ans = -1;
    return ans;
}

Compilation message

race.cpp:4:2: warning: #warning notusing64bitintegers [-Wcpp]
    4 | #warning notusing64bitintegers
      |  ^~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12888 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 13108 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 13116 KB Output is correct
16 Correct 2 ms 12888 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 2 ms 12988 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12888 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 13108 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 13116 KB Output is correct
16 Correct 2 ms 12888 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 2 ms 12988 KB Output is correct
19 Correct 2 ms 12888 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct
21 Incorrect 8 ms 15192 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12888 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 13108 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 13116 KB Output is correct
16 Correct 2 ms 12888 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 2 ms 12988 KB Output is correct
19 Correct 169 ms 101184 KB Output is correct
20 Correct 147 ms 102128 KB Output is correct
21 Correct 141 ms 101728 KB Output is correct
22 Correct 134 ms 102488 KB Output is correct
23 Correct 106 ms 102752 KB Output is correct
24 Correct 108 ms 102596 KB Output is correct
25 Correct 155 ms 106576 KB Output is correct
26 Correct 103 ms 110484 KB Output is correct
27 Correct 280 ms 184540 KB Output is correct
28 Correct 247 ms 201808 KB Output is correct
29 Correct 241 ms 200784 KB Output is correct
30 Correct 220 ms 185108 KB Output is correct
31 Correct 218 ms 185100 KB Output is correct
32 Correct 304 ms 185048 KB Output is correct
33 Correct 275 ms 184108 KB Output is correct
34 Correct 113 ms 184400 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12892 KB Output is correct
3 Correct 2 ms 12892 KB Output is correct
4 Correct 2 ms 12892 KB Output is correct
5 Correct 2 ms 12892 KB Output is correct
6 Correct 4 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12888 KB Output is correct
9 Correct 2 ms 12892 KB Output is correct
10 Correct 2 ms 13108 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12892 KB Output is correct
15 Correct 2 ms 13116 KB Output is correct
16 Correct 2 ms 12888 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 2 ms 12988 KB Output is correct
19 Correct 2 ms 12888 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct
21 Incorrect 8 ms 15192 KB Output isn't correct
22 Halted 0 ms 0 KB -