oj.uz

Submission #974476

# Submission time Handle Problem Language Result Execution time Memory
974476 2024-05-03T11:24:32 Z saayan007 Race (IOI11_race) C++17
31 / 100
 311 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 3 ms 12892 KB Output is correct
2 Correct 2 ms 12984 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 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 2 ms 12988 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12888 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12988 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12984 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 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 2 ms 12988 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12888 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12988 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 2 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 3 ms 12892 KB Output is correct
2 Correct 2 ms 12984 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 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 2 ms 12988 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12888 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12988 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 171 ms 100836 KB Output is correct
20 Correct 150 ms 102124 KB Output is correct
21 Correct 152 ms 101976 KB Output is correct
22 Correct 135 ms 102480 KB Output is correct
23 Correct 104 ms 102740 KB Output is correct
24 Correct 87 ms 102480 KB Output is correct
25 Correct 156 ms 106580 KB Output is correct
26 Correct 107 ms 110596 KB Output is correct
27 Correct 253 ms 184536 KB Output is correct
28 Correct 264 ms 201808 KB Output is correct
29 Correct 257 ms 200784 KB Output is correct
30 Correct 252 ms 185116 KB Output is correct
31 Correct 228 ms 184916 KB Output is correct
32 Correct 311 ms 185052 KB Output is correct
33 Correct 297 ms 184064 KB Output is correct
34 Correct 127 ms 184412 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12892 KB Output is correct
2 Correct 2 ms 12984 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 2 ms 12892 KB Output is correct
7 Correct 2 ms 12892 KB Output is correct
8 Correct 2 ms 12892 KB Output is correct
9 Correct 3 ms 12892 KB Output is correct
10 Correct 2 ms 12988 KB Output is correct
11 Correct 2 ms 12892 KB Output is correct
12 Correct 2 ms 12892 KB Output is correct
13 Correct 2 ms 12892 KB Output is correct
14 Correct 2 ms 12888 KB Output is correct
15 Correct 2 ms 12892 KB Output is correct
16 Correct 2 ms 12988 KB Output is correct
17 Correct 2 ms 12892 KB Output is correct
18 Correct 2 ms 12892 KB Output is correct
19 Correct 2 ms 12892 KB Output is correct
20 Correct 2 ms 12892 KB Output is correct
21 Incorrect 8 ms 15192 KB Output isn't correct
22 Halted 0 ms 0 KB -