oj.uz

답안 #115108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115108 2019-06-05T10:12:45 Z oolimry 경주 (Race) (IOI11_race) C++14
43 / 100
 3000 ms 253836 KB 
#include "race.h"
#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> ii;

static vector<ii> adj[200005];
static bool vis[200005];
static unordered_map<int,int> dp[200005];
int k;
int ans = 102345678;
void dfs(int u){
    vis[u] = true;
    for(int i = 0;i < adj[u].size();i++){
        int v = adj[u][i].first;
        int w = adj[u][i].second;

        if(vis[v]) continue;
        dfs(v);
        vector<ii> updates;
        //if(dp[v].size() > dp[u].size()) swap(dp[u],dp[v]);
        for(ii x : dp[v]){
            int value = w + x.first;
            if(value <= k){
                if(dp[u].find(k-value) != dp[u].end()){
                    ans = min(ans, dp[u][k-value] + x.second + 1);
                }
                updates.push_back({value,x.second+1});
            }
        }
        dp[v].clear();

        for(ii x : updates){
            if(dp[u].find(x.first) == dp[u].end()){
                dp[u][x.first] = x.second;
            }
            else{
                dp[u][x.first] = min(x.second,dp[u][x.first]);
            }
        }
    }
}
int best_path(int N, int K, int H[][2], int L[])
{
    k = K;
    int n = N;
    for(int i = 0;i < n;i++) dp[i][0] = 0;
    for(int i = 0;i < n-1;i++){
        int a = H[i][0];
        int b = H[i][1];
        int c = L[i];
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }

    dfs(0);
    if(ans > n) return -1;
    return ans;
}

Compilation message

race.cpp: In function 'void dfs(int)':
race.cpp:15:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < adj[u].size();i++){
                   ~~^~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 16120 KB Output is correct
2 Correct 16 ms 16000 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 15 ms 16000 KB Output is correct
5 Correct 16 ms 16000 KB Output is correct
6 Correct 16 ms 16000 KB Output is correct
7 Correct 16 ms 16000 KB Output is correct
8 Correct 16 ms 16000 KB Output is correct
9 Correct 16 ms 16000 KB Output is correct
10 Correct 16 ms 16000 KB Output is correct
11 Correct 16 ms 15972 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 16 ms 16000 KB Output is correct
14 Correct 16 ms 16000 KB Output is correct
15 Correct 16 ms 16000 KB Output is correct
16 Correct 17 ms 16028 KB Output is correct
17 Correct 17 ms 16128 KB Output is correct
18 Correct 16 ms 16000 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 16120 KB Output is correct
2 Correct 16 ms 16000 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 15 ms 16000 KB Output is correct
5 Correct 16 ms 16000 KB Output is correct
6 Correct 16 ms 16000 KB Output is correct
7 Correct 16 ms 16000 KB Output is correct
8 Correct 16 ms 16000 KB Output is correct
9 Correct 16 ms 16000 KB Output is correct
10 Correct 16 ms 16000 KB Output is correct
11 Correct 16 ms 15972 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 16 ms 16000 KB Output is correct
14 Correct 16 ms 16000 KB Output is correct
15 Correct 16 ms 16000 KB Output is correct
16 Correct 17 ms 16028 KB Output is correct
17 Correct 17 ms 16128 KB Output is correct
18 Correct 16 ms 16000 KB Output is correct
19 Correct 15 ms 16000 KB Output is correct
20 Correct 15 ms 15996 KB Output is correct
21 Correct 20 ms 16256 KB Output is correct
22 Correct 17 ms 16128 KB Output is correct
23 Correct 13 ms 16128 KB Output is correct
24 Correct 19 ms 16128 KB Output is correct
25 Correct 20 ms 16384 KB Output is correct
26 Correct 16 ms 16124 KB Output is correct
27 Correct 16 ms 16128 KB Output is correct
28 Correct 18 ms 16256 KB Output is correct
29 Correct 19 ms 16128 KB Output is correct
30 Correct 18 ms 16256 KB Output is correct
31 Correct 20 ms 16256 KB Output is correct
32 Correct 16 ms 16256 KB Output is correct
33 Correct 20 ms 16384 KB Output is correct
34 Correct 21 ms 16384 KB Output is correct
35 Correct 22 ms 16376 KB Output is correct
36 Correct 22 ms 16512 KB Output is correct
37 Correct 31 ms 17144 KB Output is correct
38 Correct 29 ms 16888 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 16120 KB Output is correct
2 Correct 16 ms 16000 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 15 ms 16000 KB Output is correct
5 Correct 16 ms 16000 KB Output is correct
6 Correct 16 ms 16000 KB Output is correct
7 Correct 16 ms 16000 KB Output is correct
8 Correct 16 ms 16000 KB Output is correct
9 Correct 16 ms 16000 KB Output is correct
10 Correct 16 ms 16000 KB Output is correct
11 Correct 16 ms 15972 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 16 ms 16000 KB Output is correct
14 Correct 16 ms 16000 KB Output is correct
15 Correct 16 ms 16000 KB Output is correct
16 Correct 17 ms 16028 KB Output is correct
17 Correct 17 ms 16128 KB Output is correct
18 Correct 16 ms 16000 KB Output is correct
19 Correct 263 ms 33292 KB Output is correct
20 Correct 267 ms 33400 KB Output is correct
21 Correct 254 ms 31988 KB Output is correct
22 Correct 219 ms 30584 KB Output is correct
23 Correct 194 ms 28536 KB Output is correct
24 Correct 176 ms 29752 KB Output is correct
25 Correct 1653 ms 159956 KB Output is correct
26 Correct 1131 ms 133496 KB Output is correct
27 Correct 500 ms 54008 KB Output is correct
28 Correct 748 ms 65784 KB Output is correct
29 Correct 397 ms 63836 KB Output is correct
30 Correct 522 ms 54112 KB Output is correct
31 Correct 522 ms 54044 KB Output is correct
32 Correct 532 ms 48652 KB Output is correct
33 Correct 2866 ms 246968 KB Output is correct
34 Correct 322 ms 37624 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 16120 KB Output is correct
2 Correct 16 ms 16000 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 15 ms 16000 KB Output is correct
5 Correct 16 ms 16000 KB Output is correct
6 Correct 16 ms 16000 KB Output is correct
7 Correct 16 ms 16000 KB Output is correct
8 Correct 16 ms 16000 KB Output is correct
9 Correct 16 ms 16000 KB Output is correct
10 Correct 16 ms 16000 KB Output is correct
11 Correct 16 ms 15972 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 16 ms 16000 KB Output is correct
14 Correct 16 ms 16000 KB Output is correct
15 Correct 16 ms 16000 KB Output is correct
16 Correct 17 ms 16028 KB Output is correct
17 Correct 17 ms 16128 KB Output is correct
18 Correct 16 ms 16000 KB Output is correct
19 Correct 15 ms 16000 KB Output is correct
20 Correct 15 ms 15996 KB Output is correct
21 Correct 20 ms 16256 KB Output is correct
22 Correct 17 ms 16128 KB Output is correct
23 Correct 13 ms 16128 KB Output is correct
24 Correct 19 ms 16128 KB Output is correct
25 Correct 20 ms 16384 KB Output is correct
26 Correct 16 ms 16124 KB Output is correct
27 Correct 16 ms 16128 KB Output is correct
28 Correct 18 ms 16256 KB Output is correct
29 Correct 19 ms 16128 KB Output is correct
30 Correct 18 ms 16256 KB Output is correct
31 Correct 20 ms 16256 KB Output is correct
32 Correct 16 ms 16256 KB Output is correct
33 Correct 20 ms 16384 KB Output is correct
34 Correct 21 ms 16384 KB Output is correct
35 Correct 22 ms 16376 KB Output is correct
36 Correct 22 ms 16512 KB Output is correct
37 Correct 31 ms 17144 KB Output is correct
38 Correct 29 ms 16888 KB Output is correct
39 Correct 263 ms 33292 KB Output is correct
40 Correct 267 ms 33400 KB Output is correct
41 Correct 254 ms 31988 KB Output is correct
42 Correct 219 ms 30584 KB Output is correct
43 Correct 194 ms 28536 KB Output is correct
44 Correct 176 ms 29752 KB Output is correct
45 Correct 1653 ms 159956 KB Output is correct
46 Correct 1131 ms 133496 KB Output is correct
47 Correct 500 ms 54008 KB Output is correct
48 Correct 748 ms 65784 KB Output is correct
49 Correct 397 ms 63836 KB Output is correct
50 Correct 522 ms 54112 KB Output is correct
51 Correct 522 ms 54044 KB Output is correct
52 Correct 532 ms 48652 KB Output is correct
53 Correct 2866 ms 246968 KB Output is correct
54 Correct 322 ms 37624 KB Output is correct
55 Correct 41 ms 17940 KB Output is correct
56 Correct 30 ms 17528 KB Output is correct
57 Correct 135 ms 28700 KB Output is correct
58 Correct 83 ms 27440 KB Output is correct
59 Execution timed out 3040 ms 253836 KB Time limit exceeded
60 Halted 0 ms 0 KB -