oj.uz

답안 #115111

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115111 2019-06-05T10:15:23 Z oolimry 경주 (Race) (IOI11_race) C++14
21 / 100
 895 ms 262144 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:19: 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 17 ms 16128 KB Output is correct
2 Correct 17 ms 16128 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 17 ms 16000 KB Output is correct
5 Correct 16 ms 16000 KB Output is correct
6 Correct 18 ms 16128 KB Output is correct
7 Correct 16 ms 16000 KB Output is correct
8 Correct 16 ms 15992 KB Output is correct
9 Correct 17 ms 16128 KB Output is correct
10 Correct 16 ms 16000 KB Output is correct
11 Correct 16 ms 16000 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 17 ms 16128 KB Output is correct
14 Correct 17 ms 16128 KB Output is correct
15 Correct 17 ms 16256 KB Output is correct
16 Correct 17 ms 16128 KB Output is correct
17 Correct 17 ms 16128 KB Output is correct
18 Correct 17 ms 16128 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16128 KB Output is correct
2 Correct 17 ms 16128 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 17 ms 16000 KB Output is correct
5 Correct 16 ms 16000 KB Output is correct
6 Correct 18 ms 16128 KB Output is correct
7 Correct 16 ms 16000 KB Output is correct
8 Correct 16 ms 15992 KB Output is correct
9 Correct 17 ms 16128 KB Output is correct
10 Correct 16 ms 16000 KB Output is correct
11 Correct 16 ms 16000 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 17 ms 16128 KB Output is correct
14 Correct 17 ms 16128 KB Output is correct
15 Correct 17 ms 16256 KB Output is correct
16 Correct 17 ms 16128 KB Output is correct
17 Correct 17 ms 16128 KB Output is correct
18 Correct 17 ms 16128 KB Output is correct
19 Correct 15 ms 16000 KB Output is correct
20 Correct 16 ms 16000 KB Output is correct
21 Correct 18 ms 16452 KB Output is correct
22 Correct 16 ms 16128 KB Output is correct
23 Correct 16 ms 16128 KB Output is correct
24 Correct 17 ms 16256 KB Output is correct
25 Correct 18 ms 16512 KB Output is correct
26 Correct 17 ms 16256 KB Output is correct
27 Correct 16 ms 16128 KB Output is correct
28 Correct 18 ms 16512 KB Output is correct
29 Correct 18 ms 16384 KB Output is correct
30 Correct 18 ms 16640 KB Output is correct
31 Correct 18 ms 16512 KB Output is correct
32 Correct 20 ms 16512 KB Output is correct
33 Correct 26 ms 16760 KB Output is correct
34 Correct 21 ms 17024 KB Output is correct
35 Correct 21 ms 17272 KB Output is correct
36 Correct 22 ms 17408 KB Output is correct
37 Correct 33 ms 20096 KB Output is correct
38 Correct 28 ms 18816 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16128 KB Output is correct
2 Correct 17 ms 16128 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 17 ms 16000 KB Output is correct
5 Correct 16 ms 16000 KB Output is correct
6 Correct 18 ms 16128 KB Output is correct
7 Correct 16 ms 16000 KB Output is correct
8 Correct 16 ms 15992 KB Output is correct
9 Correct 17 ms 16128 KB Output is correct
10 Correct 16 ms 16000 KB Output is correct
11 Correct 16 ms 16000 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 17 ms 16128 KB Output is correct
14 Correct 17 ms 16128 KB Output is correct
15 Correct 17 ms 16256 KB Output is correct
16 Correct 17 ms 16128 KB Output is correct
17 Correct 17 ms 16128 KB Output is correct
18 Correct 17 ms 16128 KB Output is correct
19 Correct 282 ms 52088 KB Output is correct
20 Correct 302 ms 52216 KB Output is correct
21 Correct 258 ms 47352 KB Output is correct
22 Correct 234 ms 41208 KB Output is correct
23 Correct 203 ms 34936 KB Output is correct
24 Correct 165 ms 34040 KB Output is correct
25 Runtime error 895 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16128 KB Output is correct
2 Correct 17 ms 16128 KB Output is correct
3 Correct 16 ms 16000 KB Output is correct
4 Correct 17 ms 16000 KB Output is correct
5 Correct 16 ms 16000 KB Output is correct
6 Correct 18 ms 16128 KB Output is correct
7 Correct 16 ms 16000 KB Output is correct
8 Correct 16 ms 15992 KB Output is correct
9 Correct 17 ms 16128 KB Output is correct
10 Correct 16 ms 16000 KB Output is correct
11 Correct 16 ms 16000 KB Output is correct
12 Correct 16 ms 16000 KB Output is correct
13 Correct 17 ms 16128 KB Output is correct
14 Correct 17 ms 16128 KB Output is correct
15 Correct 17 ms 16256 KB Output is correct
16 Correct 17 ms 16128 KB Output is correct
17 Correct 17 ms 16128 KB Output is correct
18 Correct 17 ms 16128 KB Output is correct
19 Correct 15 ms 16000 KB Output is correct
20 Correct 16 ms 16000 KB Output is correct
21 Correct 18 ms 16452 KB Output is correct
22 Correct 16 ms 16128 KB Output is correct
23 Correct 16 ms 16128 KB Output is correct
24 Correct 17 ms 16256 KB Output is correct
25 Correct 18 ms 16512 KB Output is correct
26 Correct 17 ms 16256 KB Output is correct
27 Correct 16 ms 16128 KB Output is correct
28 Correct 18 ms 16512 KB Output is correct
29 Correct 18 ms 16384 KB Output is correct
30 Correct 18 ms 16640 KB Output is correct
31 Correct 18 ms 16512 KB Output is correct
32 Correct 20 ms 16512 KB Output is correct
33 Correct 26 ms 16760 KB Output is correct
34 Correct 21 ms 17024 KB Output is correct
35 Correct 21 ms 17272 KB Output is correct
36 Correct 22 ms 17408 KB Output is correct
37 Correct 33 ms 20096 KB Output is correct
38 Correct 28 ms 18816 KB Output is correct
39 Correct 282 ms 52088 KB Output is correct
40 Correct 302 ms 52216 KB Output is correct
41 Correct 258 ms 47352 KB Output is correct
42 Correct 234 ms 41208 KB Output is correct
43 Correct 203 ms 34936 KB Output is correct
44 Correct 165 ms 34040 KB Output is correct
45 Runtime error 895 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
46 Halted 0 ms 0 KB -