oj.uz

Submission #36284

# Submission time Handle Problem Language Result Execution time Memory
36284 2017-12-07T05:03:32 Z funcsr Race (IOI11_race) C++14
21 / 100
 308 ms 73812 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;
inline void chmin(int &x, int v) { if (x > v) x = v; }

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);
  }
}

unsigned char dp[200000][101][2];
int src[200000][101];
void update(int x, int k, int v, int s) {
  if (v < dp[x][k][0]) {
    dp[x][k][1] = dp[x][k][0];
    dp[x][k][0] = v;
    src[x][k] = s;
  }
  else if (v < dp[x][k][1]) dp[x][k][1] = v;
}
int get(int x, int k, int s) {
  int e = 0;
  if (src[x][k] == s) e = 1;
  return dp[x][k][e];
}

void dfs2(int x, int p) {
  update(x, 0, 0, -1);
  for (P pp : G[x]) {
    int t = pp._1, l = pp._2;
    if (t == p) continue;
    dfs2(t, x);
    for (int k=0; k<=K-l; k++) update(x, k+l, min(dp[t][k][0]+1, K+1), t);
  }
}

void dfs3(int x, int p, int pd) {
  if (p != -1) {
    for (int k=0; k<=K-pd; k++) update(x, k+pd, min(get(p, k, x)+1, K+1), p);
  }
  for (P pp : G[x]) {
    int t = pp._1, l = pp._2;
    if (t == p) continue;
    dfs3(t, x, l);
  }
}

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;
  if (K <= 100) {
    // subtask 3
    rep(i, N) rep(j, K+1) dp[i][j][0] = dp[i][j][1] = K+1, src[i][j] = -1;
    dfs2(0, -1);
    dfs3(0, -1, -1);
    rep(i, N) ans = min(ans, (int)dp[i][K][0]);
    if (ans > K) ans = INF;
  }
  else {
    // subtask 1&2
    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 7 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5128 KB Output is correct
4 Correct 7 ms 5144 KB Output is correct
5 Correct 7 ms 5352 KB Output is correct
6 Correct 6 ms 5352 KB Output is correct
7 Correct 6 ms 5352 KB Output is correct
8 Correct 7 ms 5352 KB Output is correct
9 Correct 7 ms 5352 KB Output is correct
10 Correct 6 ms 5352 KB Output is correct
11 Correct 7 ms 5352 KB Output is correct
12 Correct 8 ms 5352 KB Output is correct
13 Correct 7 ms 5352 KB Output is correct
14 Correct 6 ms 5352 KB Output is correct
15 Correct 6 ms 5352 KB Output is correct
16 Correct 6 ms 5456 KB Output is correct
17 Correct 7 ms 5456 KB Output is correct
18 Correct 7 ms 5456 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5128 KB Output is correct
4 Correct 7 ms 5144 KB Output is correct
5 Correct 7 ms 5352 KB Output is correct
6 Correct 6 ms 5352 KB Output is correct
7 Correct 6 ms 5352 KB Output is correct
8 Correct 7 ms 5352 KB Output is correct
9 Correct 7 ms 5352 KB Output is correct
10 Correct 6 ms 5352 KB Output is correct
11 Correct 7 ms 5352 KB Output is correct
12 Correct 8 ms 5352 KB Output is correct
13 Correct 7 ms 5352 KB Output is correct
14 Correct 6 ms 5352 KB Output is correct
15 Correct 6 ms 5352 KB Output is correct
16 Correct 6 ms 5456 KB Output is correct
17 Correct 7 ms 5456 KB Output is correct
18 Correct 7 ms 5456 KB Output is correct
19 Correct 303 ms 69372 KB Output is correct
20 Correct 308 ms 69372 KB Output is correct
21 Correct 308 ms 69392 KB Output is correct
22 Correct 292 ms 69628 KB Output is correct
23 Correct 209 ms 69628 KB Output is correct
24 Correct 192 ms 69812 KB Output is correct
25 Incorrect 227 ms 73812 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5128 KB Output is correct
4 Correct 7 ms 5144 KB Output is correct
5 Correct 7 ms 5352 KB Output is correct
6 Correct 6 ms 5352 KB Output is correct
7 Correct 6 ms 5352 KB Output is correct
8 Correct 7 ms 5352 KB Output is correct
9 Correct 7 ms 5352 KB Output is correct
10 Correct 6 ms 5352 KB Output is correct
11 Correct 7 ms 5352 KB Output is correct
12 Correct 8 ms 5352 KB Output is correct
13 Correct 7 ms 5352 KB Output is correct
14 Correct 6 ms 5352 KB Output is correct
15 Correct 6 ms 5352 KB Output is correct
16 Correct 6 ms 5456 KB Output is correct
17 Correct 7 ms 5456 KB Output is correct
18 Correct 7 ms 5456 KB Output is correct
19 Correct 7 ms 5456 KB Output is correct
20 Correct 6 ms 5456 KB Output is correct
21 Correct 31 ms 5456 KB Output is correct
22 Correct 24 ms 5456 KB Output is correct
23 Correct 26 ms 5456 KB Output is correct
24 Correct 23 ms 5456 KB Output is correct
25 Correct 73 ms 5484 KB Output is correct
26 Correct 24 ms 5484 KB Output is correct
27 Correct 26 ms 5484 KB Output is correct
28 Correct 24 ms 5484 KB Output is correct
29 Correct 24 ms 5484 KB Output is correct
30 Correct 23 ms 5484 KB Output is correct
31 Correct 24 ms 5484 KB Output is correct
32 Correct 23 ms 5484 KB Output is correct
33 Correct 24 ms 5484 KB Output is correct
34 Correct 16 ms 5484 KB Output is correct
35 Correct 16 ms 5484 KB Output is correct
36 Correct 14 ms 5484 KB Output is correct
37 Correct 13 ms 5484 KB Output is correct
38 Correct 17 ms 5484 KB Output is correct
39 Correct 303 ms 69372 KB Output is correct
40 Correct 308 ms 69372 KB Output is correct
41 Correct 308 ms 69392 KB Output is correct
42 Correct 292 ms 69628 KB Output is correct
43 Correct 209 ms 69628 KB Output is correct
44 Correct 192 ms 69812 KB Output is correct
45 Incorrect 227 ms 73812 KB Output isn't correct
46 Halted 0 ms 0 KB -