oj.uz

답안 #994443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994443 2024-06-07T16:06:40 Z pannenkoek 경주 (Race) (IOI11_race) C++14
21 / 100
 452 ms 262144 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);
            }
        }
    }
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19804 KB Output is correct
2 Correct 3 ms 19804 KB Output is correct
3 Correct 3 ms 19804 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 19804 KB Output is correct
7 Correct 3 ms 19548 KB Output is correct
8 Correct 2 ms 19548 KB Output is correct
9 Correct 3 ms 19804 KB Output is correct
10 Correct 3 ms 19804 KB Output is correct
11 Correct 3 ms 19548 KB Output is correct
12 Correct 3 ms 19804 KB Output is correct
13 Correct 3 ms 19992 KB Output is correct
14 Correct 3 ms 19800 KB Output is correct
15 Correct 3 ms 19804 KB Output is correct
16 Correct 4 ms 19804 KB Output is correct
17 Correct 3 ms 19804 KB Output is correct
18 Correct 3 ms 19804 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19804 KB Output is correct
2 Correct 3 ms 19804 KB Output is correct
3 Correct 3 ms 19804 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 19804 KB Output is correct
7 Correct 3 ms 19548 KB Output is correct
8 Correct 2 ms 19548 KB Output is correct
9 Correct 3 ms 19804 KB Output is correct
10 Correct 3 ms 19804 KB Output is correct
11 Correct 3 ms 19548 KB Output is correct
12 Correct 3 ms 19804 KB Output is correct
13 Correct 3 ms 19992 KB Output is correct
14 Correct 3 ms 19800 KB Output is correct
15 Correct 3 ms 19804 KB Output is correct
16 Correct 4 ms 19804 KB Output is correct
17 Correct 3 ms 19804 KB Output is correct
18 Correct 3 ms 19804 KB Output is correct
19 Correct 3 ms 19548 KB Output is correct
20 Correct 3 ms 19736 KB Output is correct
21 Correct 5 ms 20060 KB Output is correct
22 Correct 3 ms 19804 KB Output is correct
23 Correct 3 ms 19800 KB Output is correct
24 Correct 3 ms 19804 KB Output is correct
25 Correct 5 ms 20264 KB Output is correct
26 Correct 4 ms 20056 KB Output is correct
27 Correct 3 ms 19804 KB Output is correct
28 Correct 5 ms 20060 KB Output is correct
29 Correct 5 ms 20316 KB Output is correct
30 Correct 5 ms 20316 KB Output is correct
31 Correct 6 ms 20312 KB Output is correct
32 Correct 5 ms 20568 KB Output is correct
33 Correct 6 ms 20828 KB Output is correct
34 Correct 7 ms 21084 KB Output is correct
35 Correct 7 ms 21508 KB Output is correct
36 Correct 8 ms 21592 KB Output is correct
37 Correct 19 ms 25436 KB Output is correct
38 Correct 12 ms 23644 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19804 KB Output is correct
2 Correct 3 ms 19804 KB Output is correct
3 Correct 3 ms 19804 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 19804 KB Output is correct
7 Correct 3 ms 19548 KB Output is correct
8 Correct 2 ms 19548 KB Output is correct
9 Correct 3 ms 19804 KB Output is correct
10 Correct 3 ms 19804 KB Output is correct
11 Correct 3 ms 19548 KB Output is correct
12 Correct 3 ms 19804 KB Output is correct
13 Correct 3 ms 19992 KB Output is correct
14 Correct 3 ms 19800 KB Output is correct
15 Correct 3 ms 19804 KB Output is correct
16 Correct 4 ms 19804 KB Output is correct
17 Correct 3 ms 19804 KB Output is correct
18 Correct 3 ms 19804 KB Output is correct
19 Correct 169 ms 68944 KB Output is correct
20 Correct 175 ms 70228 KB Output is correct
21 Correct 148 ms 62808 KB Output is correct
22 Correct 135 ms 54724 KB Output is correct
23 Correct 72 ms 45388 KB Output is correct
24 Correct 68 ms 43088 KB Output is correct
25 Runtime error 452 ms 262144 KB Execution killed with signal 9
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19804 KB Output is correct
2 Correct 3 ms 19804 KB Output is correct
3 Correct 3 ms 19804 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 19804 KB Output is correct
7 Correct 3 ms 19548 KB Output is correct
8 Correct 2 ms 19548 KB Output is correct
9 Correct 3 ms 19804 KB Output is correct
10 Correct 3 ms 19804 KB Output is correct
11 Correct 3 ms 19548 KB Output is correct
12 Correct 3 ms 19804 KB Output is correct
13 Correct 3 ms 19992 KB Output is correct
14 Correct 3 ms 19800 KB Output is correct
15 Correct 3 ms 19804 KB Output is correct
16 Correct 4 ms 19804 KB Output is correct
17 Correct 3 ms 19804 KB Output is correct
18 Correct 3 ms 19804 KB Output is correct
19 Correct 3 ms 19548 KB Output is correct
20 Correct 3 ms 19736 KB Output is correct
21 Correct 5 ms 20060 KB Output is correct
22 Correct 3 ms 19804 KB Output is correct
23 Correct 3 ms 19800 KB Output is correct
24 Correct 3 ms 19804 KB Output is correct
25 Correct 5 ms 20264 KB Output is correct
26 Correct 4 ms 20056 KB Output is correct
27 Correct 3 ms 19804 KB Output is correct
28 Correct 5 ms 20060 KB Output is correct
29 Correct 5 ms 20316 KB Output is correct
30 Correct 5 ms 20316 KB Output is correct
31 Correct 6 ms 20312 KB Output is correct
32 Correct 5 ms 20568 KB Output is correct
33 Correct 6 ms 20828 KB Output is correct
34 Correct 7 ms 21084 KB Output is correct
35 Correct 7 ms 21508 KB Output is correct
36 Correct 8 ms 21592 KB Output is correct
37 Correct 19 ms 25436 KB Output is correct
38 Correct 12 ms 23644 KB Output is correct
39 Correct 169 ms 68944 KB Output is correct
40 Correct 175 ms 70228 KB Output is correct
41 Correct 148 ms 62808 KB Output is correct
42 Correct 135 ms 54724 KB Output is correct
43 Correct 72 ms 45388 KB Output is correct
44 Correct 68 ms 43088 KB Output is correct
45 Runtime error 452 ms 262144 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -