oj.uz

Submission #1004483

# Submission time Handle Problem Language Result Execution time Memory
1004483 2024-06-21T09:20:43 Z Gray Race (IOI11_race) C++17
21 / 100
 3000 ms 262144 KB 
#include<bits/stdc++.h>
#include "race.h"
using namespace std;
#define ll long long
#define ff first
#define ss second
#define ln "\n"
vector<pair<ll, pair<ll, ll>>> e;
vector<vector<ll>> A;
vector<bool> black;
vector<ll> sz;
ll n, k;
ll getsz(ll u, ll p){
  sz[u]=1;
  for (auto i:A[u]){
    if (black[i]) continue;
    ll v = e[i].ss.ff^e[i].ss.ss^u;
    if (v==p) continue;
    sz[u]+=getsz(v, u);
  }
  return sz[u];
}
void findcentroid(ll u, ll p, ll up, ll &centr, ll wsz){
  for (auto i:A[u]){
    if (black[i]) continue;
    ll v = e[i].ss.ff^e[i].ss.ss^u;
    if (v==p) continue;
    if (sz[v]>wsz/2) {findcentroid(v, u, up+1, centr, wsz); return;}
  }
  centr=u;
  return;
}
void dfs(ll u, ll p, map<ll, ll> &usg, ll level, ll dep){
  if (usg.count(level)) usg[level]=min(usg[level], dep);
  else usg[level]=dep;
  for (auto i:A[u]){
    ll v = e[i].ss.ff^e[i].ss.ss^u;
    if (v==p or black[i]) continue;
    dfs(v, u, usg, level+e[i].ff, dep+1);
  }
}
void cedfs(ll u, ll &mn, ll wsz){
  ll centr = -1;
  findcentroid(u,u, 0, centr, wsz);
  assert(centr!=-1);
  map<ll, ll> full, levs;
  for (auto i:A[u]){
    if (black[i]) continue;
    ll v = e[i].ss.ff^e[i].ss.ss^u;
    levs.clear();
    dfs(v, u, levs, e[i].ff, 1);
    for (auto [length, tim]:levs){
      // cout << length << "-" << tim << ' ';
      if (full.count(k-length)){
        mn=min(mn, full[k-length]+tim);
      }
      if (length==k){
        mn=min(mn, tim);
      }
    }
    // cout << ln;
    for (auto [length, tim]:levs){
      if (full.count(length)){
        full[length]=min(full[length], tim);
      }else{
        full[length]=tim;
      }
    }
  }
  for (auto i:A[u]){
    if (black[i]) continue;
    black[i]=1;
    ll v = e[i].ss.ff^e[i].ss.ss^u;
    cedfs(v, mn, getsz(v, v));
  }
}


int best_path(int N, int K, int H[][2], int L[])
{
  n = N; k=K;
  e.resize(N-1);
  A.resize(N);
  for (ll i=0; i<n-1; i++){
    A[H[i][0]].push_back(i);
    A[H[i][1]].push_back(i);
    e[i] = {L[i], {H[i][0], H[i][1]}};
  }
  black.resize(N);
  sz.resize(N);
  ll mn = 2e18;
  cedfs(0, mn, getsz(0, 0));
  return (mn==2e18?-1:mn);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 996 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 996 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 5 ms 1372 KB Output is correct
23 Correct 9 ms 2572 KB Output is correct
24 Correct 4 ms 1116 KB Output is correct
25 Correct 3 ms 860 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 3 ms 856 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 3 ms 860 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 5 ms 1116 KB Output is correct
34 Correct 30 ms 12888 KB Output is correct
35 Correct 39 ms 15964 KB Output is correct
36 Correct 57 ms 20048 KB Output is correct
37 Correct 17 ms 6748 KB Output is correct
38 Correct 13 ms 4188 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 996 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 468 ms 11240 KB Output is correct
20 Correct 458 ms 12368 KB Output is correct
21 Correct 338 ms 11772 KB Output is correct
22 Correct 275 ms 12488 KB Output is correct
23 Correct 374 ms 14440 KB Output is correct
24 Correct 151 ms 12624 KB Output is correct
25 Execution timed out 3001 ms 262144 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 2 ms 856 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 996 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 5 ms 1372 KB Output is correct
23 Correct 9 ms 2572 KB Output is correct
24 Correct 4 ms 1116 KB Output is correct
25 Correct 3 ms 860 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 3 ms 856 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 3 ms 860 KB Output is correct
32 Correct 3 ms 860 KB Output is correct
33 Correct 5 ms 1116 KB Output is correct
34 Correct 30 ms 12888 KB Output is correct
35 Correct 39 ms 15964 KB Output is correct
36 Correct 57 ms 20048 KB Output is correct
37 Correct 17 ms 6748 KB Output is correct
38 Correct 13 ms 4188 KB Output is correct
39 Correct 468 ms 11240 KB Output is correct
40 Correct 458 ms 12368 KB Output is correct
41 Correct 338 ms 11772 KB Output is correct
42 Correct 275 ms 12488 KB Output is correct
43 Correct 374 ms 14440 KB Output is correct
44 Correct 151 ms 12624 KB Output is correct
45 Execution timed out 3001 ms 262144 KB Time limit exceeded
46 Halted 0 ms 0 KB -