oj.uz

Submission #36295

# Submission time Handle Problem Language Result Execution time Memory
36295 2017-12-07T05:56:05 Z funcsr Race (IOI11_race) C++14
21 / 100
 3000 ms 393216 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <cassert>
#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;
bool dead[200000];
vector<P> G[200000];

multiset<int> C[1000001];
void merge(vector<vector<P> > vs) {
  if (vs.empty()) return;
  for (vector<P> &ps : vs) for (P &x : ps) {
    if (x._1 == K) chmin(ans, x._2);
  }
  if (vs.size() < 2) return;
  //for (auto &p : vs) { cout<<"{"; for (P &x : p)cout<<"("<<x._1<<","<<x._2<<"),"; cout<<"},"; } cout<<"\n";

  for (vector<P> &ps : vs) for (P &x : ps) C[x._1].insert(x._2);
  for (vector<P> &ps : vs) {
    for (P &x : ps) C[x._1].erase(C[x._1].find(x._2));
    for (P &x : ps) {
      if (!C[K-x._1].empty()) chmin(ans, x._2 + *C[K-x._1].begin());
    }
  }
}

int centroid(int x) {
  return x;
}

void dfs(int x, int p, int d, int r, vector<P> &ret) {
  if (d > K) return;
  ret.pb(P(d, r));
  for (P pp : G[x]) {
    int t = pp._1;
    if (dead[t] || t == p) continue;
    dfs(t, x, d+pp._2, r+1, ret);
  }
}

vector<P> solve(int s) {
  vector<P> ret;
  dfs(s, -1, 0, 0, ret);

  int g = centroid(s);
  dead[g] = true;
  vector<vector<P> > vs;
  for (P pp : G[g]) {
    int t = pp._1;
    if (dead[t]) continue;
    vector<P> cs = solve(t);
    vector<P> new_cs;
    for (P x : cs) if (x._1+pp._2 <= K) new_cs.pb(P(x._1+pp._2, x._2+1));
    vs.pb(new_cs);
  }
  merge(vs);
  return ret;
}

int best_path(int n, int k, int H[][2], int L[]) {
  N = n, K = k;
  rep(i, N) G[i].clear(), dead[i] = false;
  rep(i, 1000001) C[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;

  int g = centroid(0);
  dead[g] = true;
  vector<vector<P> > vs;
  for (P pp : G[g]) {
    int t = pp._1;
    if (dead[t]) continue;
    vector<P> cs = solve(t);
    vector<P> new_cs;
    for (P x : cs) if (x._1+pp._2 <= K) new_cs.pb(P(x._1+pp._2, x._2+1));
    vs.pb(new_cs);
  }
  merge(vs);
  if (ans == INF) ans = -1;
  return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 52028 KB Output is correct
2 Correct 49 ms 52212 KB Output is correct
3 Correct 56 ms 52212 KB Output is correct
4 Correct 52 ms 52212 KB Output is correct
5 Correct 53 ms 52212 KB Output is correct
6 Correct 54 ms 52336 KB Output is correct
7 Correct 56 ms 52336 KB Output is correct
8 Correct 53 ms 52336 KB Output is correct
9 Correct 60 ms 52336 KB Output is correct
10 Correct 59 ms 52336 KB Output is correct
11 Correct 55 ms 52336 KB Output is correct
12 Correct 54 ms 52336 KB Output is correct
13 Correct 52 ms 52400 KB Output is correct
14 Correct 58 ms 52400 KB Output is correct
15 Correct 52 ms 52400 KB Output is correct
16 Correct 53 ms 52400 KB Output is correct
17 Correct 52 ms 52400 KB Output is correct
18 Correct 53 ms 52400 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 52028 KB Output is correct
2 Correct 49 ms 52212 KB Output is correct
3 Correct 56 ms 52212 KB Output is correct
4 Correct 52 ms 52212 KB Output is correct
5 Correct 53 ms 52212 KB Output is correct
6 Correct 54 ms 52336 KB Output is correct
7 Correct 56 ms 52336 KB Output is correct
8 Correct 53 ms 52336 KB Output is correct
9 Correct 60 ms 52336 KB Output is correct
10 Correct 59 ms 52336 KB Output is correct
11 Correct 55 ms 52336 KB Output is correct
12 Correct 54 ms 52336 KB Output is correct
13 Correct 52 ms 52400 KB Output is correct
14 Correct 58 ms 52400 KB Output is correct
15 Correct 52 ms 52400 KB Output is correct
16 Correct 53 ms 52400 KB Output is correct
17 Correct 52 ms 52400 KB Output is correct
18 Correct 53 ms 52400 KB Output is correct
19 Correct 51 ms 52400 KB Output is correct
20 Correct 50 ms 52400 KB Output is correct
21 Correct 56 ms 52400 KB Output is correct
22 Correct 51 ms 52424 KB Output is correct
23 Correct 51 ms 52424 KB Output is correct
24 Correct 51 ms 52424 KB Output is correct
25 Correct 60 ms 52424 KB Output is correct
26 Correct 53 ms 52424 KB Output is correct
27 Correct 57 ms 52424 KB Output is correct
28 Correct 59 ms 52424 KB Output is correct
29 Correct 57 ms 52424 KB Output is correct
30 Correct 58 ms 52424 KB Output is correct
31 Correct 54 ms 52424 KB Output is correct
32 Correct 62 ms 52424 KB Output is correct
33 Correct 55 ms 52424 KB Output is correct
34 Correct 55 ms 52476 KB Output is correct
35 Correct 53 ms 52476 KB Output is correct
36 Correct 51 ms 52604 KB Output is correct
37 Correct 57 ms 52836 KB Output is correct
38 Correct 55 ms 52836 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 52028 KB Output is correct
2 Correct 49 ms 52212 KB Output is correct
3 Correct 56 ms 52212 KB Output is correct
4 Correct 52 ms 52212 KB Output is correct
5 Correct 53 ms 52212 KB Output is correct
6 Correct 54 ms 52336 KB Output is correct
7 Correct 56 ms 52336 KB Output is correct
8 Correct 53 ms 52336 KB Output is correct
9 Correct 60 ms 52336 KB Output is correct
10 Correct 59 ms 52336 KB Output is correct
11 Correct 55 ms 52336 KB Output is correct
12 Correct 54 ms 52336 KB Output is correct
13 Correct 52 ms 52400 KB Output is correct
14 Correct 58 ms 52400 KB Output is correct
15 Correct 52 ms 52400 KB Output is correct
16 Correct 53 ms 52400 KB Output is correct
17 Correct 52 ms 52400 KB Output is correct
18 Correct 53 ms 52400 KB Output is correct
19 Correct 472 ms 58408 KB Output is correct
20 Correct 498 ms 58408 KB Output is correct
21 Correct 595 ms 60288 KB Output is correct
22 Correct 599 ms 65196 KB Output is correct
23 Correct 200 ms 65196 KB Output is correct
24 Correct 184 ms 65196 KB Output is correct
25 Execution timed out 3110 ms 393216 KB Time limit exceeded (wall clock)
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 52028 KB Output is correct
2 Correct 49 ms 52212 KB Output is correct
3 Correct 56 ms 52212 KB Output is correct
4 Correct 52 ms 52212 KB Output is correct
5 Correct 53 ms 52212 KB Output is correct
6 Correct 54 ms 52336 KB Output is correct
7 Correct 56 ms 52336 KB Output is correct
8 Correct 53 ms 52336 KB Output is correct
9 Correct 60 ms 52336 KB Output is correct
10 Correct 59 ms 52336 KB Output is correct
11 Correct 55 ms 52336 KB Output is correct
12 Correct 54 ms 52336 KB Output is correct
13 Correct 52 ms 52400 KB Output is correct
14 Correct 58 ms 52400 KB Output is correct
15 Correct 52 ms 52400 KB Output is correct
16 Correct 53 ms 52400 KB Output is correct
17 Correct 52 ms 52400 KB Output is correct
18 Correct 53 ms 52400 KB Output is correct
19 Correct 51 ms 52400 KB Output is correct
20 Correct 50 ms 52400 KB Output is correct
21 Correct 56 ms 52400 KB Output is correct
22 Correct 51 ms 52424 KB Output is correct
23 Correct 51 ms 52424 KB Output is correct
24 Correct 51 ms 52424 KB Output is correct
25 Correct 60 ms 52424 KB Output is correct
26 Correct 53 ms 52424 KB Output is correct
27 Correct 57 ms 52424 KB Output is correct
28 Correct 59 ms 52424 KB Output is correct
29 Correct 57 ms 52424 KB Output is correct
30 Correct 58 ms 52424 KB Output is correct
31 Correct 54 ms 52424 KB Output is correct
32 Correct 62 ms 52424 KB Output is correct
33 Correct 55 ms 52424 KB Output is correct
34 Correct 55 ms 52476 KB Output is correct
35 Correct 53 ms 52476 KB Output is correct
36 Correct 51 ms 52604 KB Output is correct
37 Correct 57 ms 52836 KB Output is correct
38 Correct 55 ms 52836 KB Output is correct
39 Correct 472 ms 58408 KB Output is correct
40 Correct 498 ms 58408 KB Output is correct
41 Correct 595 ms 60288 KB Output is correct
42 Correct 599 ms 65196 KB Output is correct
43 Correct 200 ms 65196 KB Output is correct
44 Correct 184 ms 65196 KB Output is correct
45 Execution timed out 3110 ms 393216 KB Time limit exceeded (wall clock)
46 Halted 0 ms 0 KB -