oj.uz

Submission #36279

# Submission time Handle Problem Language Result Execution time Memory
36279 2017-12-07T04:35:47 Z funcsr Race (IOI11_race) C++14
21 / 100
 3000 ms 10108 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include "race.h"
using namespace std;
#define INF 1145141919
#define rep(i, n) for (int i=0; i<(n); i++)
#define _1 first
#define _2 second
#define all(x) x.begin(), x.end()
#define pb push_back
typedef pair<int, int> P;

int N, K;
int ans;
vector<P> G[200000];
void dfs(int x, int p, int r, int d) {
  if (d == K) ans = min(ans, r);
  for (P pp : G[x]) {
    int t = pp._1, nd = min(d+pp._2, INF);
    if (t == p) continue;
    dfs(t, x, r+1, nd);
  }
}

int best_path(int n, int k, int H[][2], int L[]) {
  N = n, K = k;
  rep(i, N) G[i].clear();
  rep(i, N-1) {
    G[H[i][0]].pb(P(H[i][1], L[i]));
    G[H[i][1]].pb(P(H[i][0], L[i]));
  }
  ans = INF;
  rep(i, N) dfs(i, -1, 0, 0);
  if (ans == INF) ans = -1;
  return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4948 KB Output is correct
2 Correct 6 ms 5100 KB Output is correct
3 Correct 6 ms 5144 KB Output is correct
4 Correct 6 ms 5196 KB Output is correct
5 Correct 7 ms 5248 KB Output is correct
6 Correct 5 ms 5248 KB Output is correct
7 Correct 6 ms 5248 KB Output is correct
8 Correct 6 ms 5344 KB Output is correct
9 Correct 6 ms 5344 KB Output is correct
10 Correct 5 ms 5344 KB Output is correct
11 Correct 8 ms 5344 KB Output is correct
12 Correct 6 ms 5344 KB Output is correct
13 Correct 6 ms 5344 KB Output is correct
14 Correct 5 ms 5344 KB Output is correct
15 Correct 5 ms 5344 KB Output is correct
16 Correct 6 ms 5344 KB Output is correct
17 Correct 6 ms 5344 KB Output is correct
18 Correct 6 ms 5344 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4948 KB Output is correct
2 Correct 6 ms 5100 KB Output is correct
3 Correct 6 ms 5144 KB Output is correct
4 Correct 6 ms 5196 KB Output is correct
5 Correct 7 ms 5248 KB Output is correct
6 Correct 5 ms 5248 KB Output is correct
7 Correct 6 ms 5248 KB Output is correct
8 Correct 6 ms 5344 KB Output is correct
9 Correct 6 ms 5344 KB Output is correct
10 Correct 5 ms 5344 KB Output is correct
11 Correct 8 ms 5344 KB Output is correct
12 Correct 6 ms 5344 KB Output is correct
13 Correct 6 ms 5344 KB Output is correct
14 Correct 5 ms 5344 KB Output is correct
15 Correct 5 ms 5344 KB Output is correct
16 Correct 6 ms 5344 KB Output is correct
17 Correct 6 ms 5344 KB Output is correct
18 Correct 6 ms 5344 KB Output is correct
19 Correct 6 ms 5344 KB Output is correct
20 Correct 6 ms 5344 KB Output is correct
21 Correct 27 ms 5344 KB Output is correct
22 Correct 26 ms 5452 KB Output is correct
23 Correct 24 ms 5452 KB Output is correct
24 Correct 23 ms 5452 KB Output is correct
25 Correct 25 ms 5452 KB Output is correct
26 Correct 24 ms 5452 KB Output is correct
27 Correct 24 ms 5452 KB Output is correct
28 Correct 23 ms 5452 KB Output is correct
29 Correct 23 ms 5452 KB Output is correct
30 Correct 22 ms 5452 KB Output is correct
31 Correct 22 ms 5452 KB Output is correct
32 Correct 22 ms 5452 KB Output is correct
33 Correct 24 ms 5452 KB Output is correct
34 Correct 17 ms 5452 KB Output is correct
35 Correct 16 ms 5452 KB Output is correct
36 Correct 14 ms 5452 KB Output is correct
37 Correct 14 ms 5452 KB Output is correct
38 Correct 16 ms 5452 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4948 KB Output is correct
2 Correct 6 ms 5100 KB Output is correct
3 Correct 6 ms 5144 KB Output is correct
4 Correct 6 ms 5196 KB Output is correct
5 Correct 7 ms 5248 KB Output is correct
6 Correct 5 ms 5248 KB Output is correct
7 Correct 6 ms 5248 KB Output is correct
8 Correct 6 ms 5344 KB Output is correct
9 Correct 6 ms 5344 KB Output is correct
10 Correct 5 ms 5344 KB Output is correct
11 Correct 8 ms 5344 KB Output is correct
12 Correct 6 ms 5344 KB Output is correct
13 Correct 6 ms 5344 KB Output is correct
14 Correct 5 ms 5344 KB Output is correct
15 Correct 5 ms 5344 KB Output is correct
16 Correct 6 ms 5344 KB Output is correct
17 Correct 6 ms 5344 KB Output is correct
18 Correct 6 ms 5344 KB Output is correct
19 Execution timed out 3061 ms 10108 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4948 KB Output is correct
2 Correct 6 ms 5100 KB Output is correct
3 Correct 6 ms 5144 KB Output is correct
4 Correct 6 ms 5196 KB Output is correct
5 Correct 7 ms 5248 KB Output is correct
6 Correct 5 ms 5248 KB Output is correct
7 Correct 6 ms 5248 KB Output is correct
8 Correct 6 ms 5344 KB Output is correct
9 Correct 6 ms 5344 KB Output is correct
10 Correct 5 ms 5344 KB Output is correct
11 Correct 8 ms 5344 KB Output is correct
12 Correct 6 ms 5344 KB Output is correct
13 Correct 6 ms 5344 KB Output is correct
14 Correct 5 ms 5344 KB Output is correct
15 Correct 5 ms 5344 KB Output is correct
16 Correct 6 ms 5344 KB Output is correct
17 Correct 6 ms 5344 KB Output is correct
18 Correct 6 ms 5344 KB Output is correct
19 Correct 6 ms 5344 KB Output is correct
20 Correct 6 ms 5344 KB Output is correct
21 Correct 27 ms 5344 KB Output is correct
22 Correct 26 ms 5452 KB Output is correct
23 Correct 24 ms 5452 KB Output is correct
24 Correct 23 ms 5452 KB Output is correct
25 Correct 25 ms 5452 KB Output is correct
26 Correct 24 ms 5452 KB Output is correct
27 Correct 24 ms 5452 KB Output is correct
28 Correct 23 ms 5452 KB Output is correct
29 Correct 23 ms 5452 KB Output is correct
30 Correct 22 ms 5452 KB Output is correct
31 Correct 22 ms 5452 KB Output is correct
32 Correct 22 ms 5452 KB Output is correct
33 Correct 24 ms 5452 KB Output is correct
34 Correct 17 ms 5452 KB Output is correct
35 Correct 16 ms 5452 KB Output is correct
36 Correct 14 ms 5452 KB Output is correct
37 Correct 14 ms 5452 KB Output is correct
38 Correct 16 ms 5452 KB Output is correct
39 Execution timed out 3061 ms 10108 KB Time limit exceeded
40 Halted 0 ms 0 KB -