oj.uz

Submission #994446

# Submission time Handle Problem Language Result Execution time Memory
994446 2024-06-07T16:08:41 Z pannenkoek Race (IOI11_race) C++14
43 / 100
 3000 ms 107604 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define pb push_back
#define fi first
#define se second

using ll = long long;
using ld = long double;
using pii = pair<ll, ll>;

const int MAXN = 2e5 + 5;
vector<pii> adj[MAXN];
map<ll, ll> poss[MAXN]; 
ll off[MAXN];
ll res = 1e18;
int k;

void dfs(ll v, ll p){
    poss[v][0] = 0;
    for(auto [u, d]: adj[v]){
        if(u == p) continue;
        dfs(u, v);
        // off[u] += d;
        // if(poss[u].size() > poss[v].size()) {
            // swap(off[u], off[v]);
            // swap(poss[u], poss[v]);
        // }
        set<ll> new_entries;
        map<ll, ll> old_vals;
        for(auto [dis, cost]: poss[u]){
            ll real_dis = dis + d;
            if(real_dis > k) continue;
            if(poss[v].count(k - real_dis) && !new_entries.count(k - real_dis)){
                ll old_cost = poss[v][k - real_dis];
                if(old_vals.count(k - real_dis)) {
                    old_cost = old_vals[k - real_dis]; 
                }
                res = min(old_cost + 1 + cost, res);
            }
            if(poss[v].count(real_dis)) {
                old_vals[real_dis] = poss[v][real_dis];
                poss[v][real_dis] = min(poss[v][real_dis], cost + 1);
            } else {
                poss[v][real_dis] = cost + 1;
                new_entries.insert(real_dis);
            }
        }
        poss[u] = {};
    }
}

int best_path(int N, int K, int H[][2], int L[]) {
    rep(i, 0, N) {
        adj[i] = {};
        poss[i] = {};
        off[i] = 0;
    }
    k = K;
    rep(i, 0, N - 1) {
        adj[H[i][0]].pb({H[i][1], L[i]});
        adj[H[i][1]].pb({H[i][0], L[i]});
    }
    dfs(0, -1); 
    if(res < 1e18) return res;
    else return -1;
}

Compilation message

race.cpp: In function 'void dfs(ll, ll)':
race.cpp:22:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   22 |     for(auto [u, d]: adj[v]){
      |              ^
race.cpp:32:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |         for(auto [dis, cost]: poss[u]){
      |                  ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19548 KB Output is correct
2 Correct 3 ms 19776 KB Output is correct
3 Correct 3 ms 19548 KB Output is correct
4 Correct 3 ms 19548 KB Output is correct
5 Correct 3 ms 19548 KB Output is correct
6 Correct 3 ms 19548 KB Output is correct
7 Correct 3 ms 19548 KB Output is correct
8 Correct 3 ms 19548 KB Output is correct
9 Correct 3 ms 19544 KB Output is correct
10 Correct 3 ms 19548 KB Output is correct
11 Correct 3 ms 19596 KB Output is correct
12 Correct 3 ms 19548 KB Output is correct
13 Correct 3 ms 19548 KB Output is correct
14 Correct 5 ms 19544 KB Output is correct
15 Correct 4 ms 19544 KB Output is correct
16 Correct 4 ms 19548 KB Output is correct
17 Correct 3 ms 19544 KB Output is correct
18 Correct 3 ms 19720 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19548 KB Output is correct
2 Correct 3 ms 19776 KB Output is correct
3 Correct 3 ms 19548 KB Output is correct
4 Correct 3 ms 19548 KB Output is correct
5 Correct 3 ms 19548 KB Output is correct
6 Correct 3 ms 19548 KB Output is correct
7 Correct 3 ms 19548 KB Output is correct
8 Correct 3 ms 19548 KB Output is correct
9 Correct 3 ms 19544 KB Output is correct
10 Correct 3 ms 19548 KB Output is correct
11 Correct 3 ms 19596 KB Output is correct
12 Correct 3 ms 19548 KB Output is correct
13 Correct 3 ms 19548 KB Output is correct
14 Correct 5 ms 19544 KB Output is correct
15 Correct 4 ms 19544 KB Output is correct
16 Correct 4 ms 19548 KB Output is correct
17 Correct 3 ms 19544 KB Output is correct
18 Correct 3 ms 19720 KB Output is correct
19 Correct 3 ms 19544 KB Output is correct
20 Correct 3 ms 19548 KB Output is correct
21 Correct 5 ms 19800 KB Output is correct
22 Correct 3 ms 19800 KB Output is correct
23 Correct 3 ms 19804 KB Output is correct
24 Correct 3 ms 19804 KB Output is correct
25 Correct 5 ms 19800 KB Output is correct
26 Correct 4 ms 19548 KB Output is correct
27 Correct 3 ms 19544 KB Output is correct
28 Correct 4 ms 19804 KB Output is correct
29 Correct 4 ms 19804 KB Output is correct
30 Correct 4 ms 19804 KB Output is correct
31 Correct 5 ms 19808 KB Output is correct
32 Correct 5 ms 19964 KB Output is correct
33 Correct 6 ms 19804 KB Output is correct
34 Correct 5 ms 19884 KB Output is correct
35 Correct 6 ms 19804 KB Output is correct
36 Correct 8 ms 19804 KB Output is correct
37 Correct 12 ms 19804 KB Output is correct
38 Correct 10 ms 19800 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19548 KB Output is correct
2 Correct 3 ms 19776 KB Output is correct
3 Correct 3 ms 19548 KB Output is correct
4 Correct 3 ms 19548 KB Output is correct
5 Correct 3 ms 19548 KB Output is correct
6 Correct 3 ms 19548 KB Output is correct
7 Correct 3 ms 19548 KB Output is correct
8 Correct 3 ms 19548 KB Output is correct
9 Correct 3 ms 19544 KB Output is correct
10 Correct 3 ms 19548 KB Output is correct
11 Correct 3 ms 19596 KB Output is correct
12 Correct 3 ms 19548 KB Output is correct
13 Correct 3 ms 19548 KB Output is correct
14 Correct 5 ms 19544 KB Output is correct
15 Correct 4 ms 19544 KB Output is correct
16 Correct 4 ms 19548 KB Output is correct
17 Correct 3 ms 19544 KB Output is correct
18 Correct 3 ms 19720 KB Output is correct
19 Correct 121 ms 26968 KB Output is correct
20 Correct 129 ms 26960 KB Output is correct
21 Correct 101 ms 27096 KB Output is correct
22 Correct 90 ms 26992 KB Output is correct
23 Correct 44 ms 27228 KB Output is correct
24 Correct 54 ms 26448 KB Output is correct
25 Correct 908 ms 47440 KB Output is correct
26 Correct 700 ms 64848 KB Output is correct
27 Correct 206 ms 34388 KB Output is correct
28 Correct 156 ms 107604 KB Output is correct
29 Correct 169 ms 102740 KB Output is correct
30 Correct 210 ms 34896 KB Output is correct
31 Correct 213 ms 34900 KB Output is correct
32 Correct 149 ms 34896 KB Output is correct
33 Correct 1533 ms 34640 KB Output is correct
34 Correct 88 ms 34792 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19548 KB Output is correct
2 Correct 3 ms 19776 KB Output is correct
3 Correct 3 ms 19548 KB Output is correct
4 Correct 3 ms 19548 KB Output is correct
5 Correct 3 ms 19548 KB Output is correct
6 Correct 3 ms 19548 KB Output is correct
7 Correct 3 ms 19548 KB Output is correct
8 Correct 3 ms 19548 KB Output is correct
9 Correct 3 ms 19544 KB Output is correct
10 Correct 3 ms 19548 KB Output is correct
11 Correct 3 ms 19596 KB Output is correct
12 Correct 3 ms 19548 KB Output is correct
13 Correct 3 ms 19548 KB Output is correct
14 Correct 5 ms 19544 KB Output is correct
15 Correct 4 ms 19544 KB Output is correct
16 Correct 4 ms 19548 KB Output is correct
17 Correct 3 ms 19544 KB Output is correct
18 Correct 3 ms 19720 KB Output is correct
19 Correct 3 ms 19544 KB Output is correct
20 Correct 3 ms 19548 KB Output is correct
21 Correct 5 ms 19800 KB Output is correct
22 Correct 3 ms 19800 KB Output is correct
23 Correct 3 ms 19804 KB Output is correct
24 Correct 3 ms 19804 KB Output is correct
25 Correct 5 ms 19800 KB Output is correct
26 Correct 4 ms 19548 KB Output is correct
27 Correct 3 ms 19544 KB Output is correct
28 Correct 4 ms 19804 KB Output is correct
29 Correct 4 ms 19804 KB Output is correct
30 Correct 4 ms 19804 KB Output is correct
31 Correct 5 ms 19808 KB Output is correct
32 Correct 5 ms 19964 KB Output is correct
33 Correct 6 ms 19804 KB Output is correct
34 Correct 5 ms 19884 KB Output is correct
35 Correct 6 ms 19804 KB Output is correct
36 Correct 8 ms 19804 KB Output is correct
37 Correct 12 ms 19804 KB Output is correct
38 Correct 10 ms 19800 KB Output is correct
39 Correct 121 ms 26968 KB Output is correct
40 Correct 129 ms 26960 KB Output is correct
41 Correct 101 ms 27096 KB Output is correct
42 Correct 90 ms 26992 KB Output is correct
43 Correct 44 ms 27228 KB Output is correct
44 Correct 54 ms 26448 KB Output is correct
45 Correct 908 ms 47440 KB Output is correct
46 Correct 700 ms 64848 KB Output is correct
47 Correct 206 ms 34388 KB Output is correct
48 Correct 156 ms 107604 KB Output is correct
49 Correct 169 ms 102740 KB Output is correct
50 Correct 210 ms 34896 KB Output is correct
51 Correct 213 ms 34900 KB Output is correct
52 Correct 149 ms 34896 KB Output is correct
53 Correct 1533 ms 34640 KB Output is correct
54 Correct 88 ms 34792 KB Output is correct
55 Correct 20 ms 20704 KB Output is correct
56 Correct 9 ms 20316 KB Output is correct
57 Correct 59 ms 27464 KB Output is correct
58 Correct 36 ms 27588 KB Output is correct
59 Execution timed out 3043 ms 65700 KB Time limit exceeded
60 Halted 0 ms 0 KB -