oj.uz

Submission #398683

# Submission time Handle Problem Language Result Execution time Memory
398683 2021-05-04T17:26:27 Z Blistering_Barnacles Race (IOI11_race) C++11
100 / 100
 1914 ms 64928 KB 
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#include "race.h"
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
using namespace std;
typedef long long ll;
ll q, dp[105][100005], vis[555555] , b[555555], k, l, m, n, o = 1e15 , p;
map < ll , ll > mp;
vector < pll > adj[555555];
const ll mod = 1e9+7;
str s;
void dfs1(ll v , ll par){
    b[v] = 1 ;
    for(auto u : adj[v]){
        if(u.F == par || vis[u.F]) C ;
        dfs1(u.F , v) ;
        b[v] += b[u.F] ;
    }
    //cout << b[v] << " " << v << endl ;
}
ll get(ll v , ll par , ll siz){
    for(auto u : adj[v]){
        if(u.F == par || vis[u.F] || b[u.F] <= siz / 2)C ;
        R get(u.F , v , siz) ;
    }
    R v ;
}
void dfs2(ll v , ll par , ll dis , ll h){
    if(dis > k)R ;
    if(mp[k - dis] || k == dis){
        o = min(o , mp[k - dis] + h) ;
    }
    for(auto u : adj[v]){
        if(u.F == par || vis[u.F])C ;
        dfs2(u.F , v , dis + u.S , h + 1) ;
    }
}
void dfs3(ll v , ll par , ll dis , ll h){
    if(dis > k)R ;
    if(mp[dis]){
        mp[dis] = min(mp[dis] ,  h) ;
    }
    else {
        mp[dis] = h ;
    }
    for(auto u : adj[v]){
        if(u.F == par || vis[u.F])C ;
        dfs3(u.F , v , dis + u.S , h + 1) ;
    }
}
void dfs_calc(ll v){
    dfs1(v , 0) ;
    mp.clear() ;
    ll op = get(v , 0 , b[v]) ;
    vis[op]++ ;
    for(auto u : adj[op]){
        if(vis[u.F])C ;
        dfs2(u.F , op , u.S , 1) ;
        dfs3(u.F , op , u.S , 1) ;
    }
    for(auto u : adj[op]){
        if(vis[u.F])C ;
        dfs_calc(u.F) ;
    }
}
int best_path(int N, int K, int H[][2], int L[])
{
    n = N ;
    k = K ;
    for(ll i = 0 ; i < n - 1 ; i++){
        ll o1 = H[i][0] , o2 = H[i][1] ;
        o1++ , o2++ ;
        adj[o1].pb({o2 , L[i]}) , adj[o2].pb({o1 , L[i]}) ;
    }
    dfs_calc(1) ;
    R (o < 1e15 ? o : -1) ;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 13416 KB Output is correct
2 Correct 8 ms 13388 KB Output is correct
3 Correct 8 ms 13260 KB Output is correct
4 Correct 8 ms 13268 KB Output is correct
5 Correct 8 ms 13364 KB Output is correct
6 Correct 8 ms 13360 KB Output is correct
7 Correct 9 ms 13388 KB Output is correct
8 Correct 8 ms 13260 KB Output is correct
9 Correct 10 ms 13280 KB Output is correct
10 Correct 8 ms 13348 KB Output is correct
11 Correct 8 ms 13388 KB Output is correct
12 Correct 8 ms 13360 KB Output is correct
13 Correct 8 ms 13388 KB Output is correct
14 Correct 8 ms 13388 KB Output is correct
15 Correct 8 ms 13380 KB Output is correct
16 Correct 8 ms 13388 KB Output is correct
17 Correct 8 ms 13388 KB Output is correct
18 Correct 8 ms 13388 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 13416 KB Output is correct
2 Correct 8 ms 13388 KB Output is correct
3 Correct 8 ms 13260 KB Output is correct
4 Correct 8 ms 13268 KB Output is correct
5 Correct 8 ms 13364 KB Output is correct
6 Correct 8 ms 13360 KB Output is correct
7 Correct 9 ms 13388 KB Output is correct
8 Correct 8 ms 13260 KB Output is correct
9 Correct 10 ms 13280 KB Output is correct
10 Correct 8 ms 13348 KB Output is correct
11 Correct 8 ms 13388 KB Output is correct
12 Correct 8 ms 13360 KB Output is correct
13 Correct 8 ms 13388 KB Output is correct
14 Correct 8 ms 13388 KB Output is correct
15 Correct 8 ms 13380 KB Output is correct
16 Correct 8 ms 13388 KB Output is correct
17 Correct 8 ms 13388 KB Output is correct
18 Correct 8 ms 13388 KB Output is correct
19 Correct 7 ms 13284 KB Output is correct
20 Correct 9 ms 13388 KB Output is correct
21 Correct 11 ms 13396 KB Output is correct
22 Correct 9 ms 13400 KB Output is correct
23 Correct 9 ms 13400 KB Output is correct
24 Correct 9 ms 13456 KB Output is correct
25 Correct 11 ms 13600 KB Output is correct
26 Correct 8 ms 13408 KB Output is correct
27 Correct 8 ms 13372 KB Output is correct
28 Correct 10 ms 13512 KB Output is correct
29 Correct 10 ms 13528 KB Output is correct
30 Correct 11 ms 13528 KB Output is correct
31 Correct 10 ms 13512 KB Output is correct
32 Correct 10 ms 13516 KB Output is correct
33 Correct 10 ms 13516 KB Output is correct
34 Correct 10 ms 13388 KB Output is correct
35 Correct 9 ms 13388 KB Output is correct
36 Correct 9 ms 13476 KB Output is correct
37 Correct 10 ms 13500 KB Output is correct
38 Correct 11 ms 13516 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 13416 KB Output is correct
2 Correct 8 ms 13388 KB Output is correct
3 Correct 8 ms 13260 KB Output is correct
4 Correct 8 ms 13268 KB Output is correct
5 Correct 8 ms 13364 KB Output is correct
6 Correct 8 ms 13360 KB Output is correct
7 Correct 9 ms 13388 KB Output is correct
8 Correct 8 ms 13260 KB Output is correct
9 Correct 10 ms 13280 KB Output is correct
10 Correct 8 ms 13348 KB Output is correct
11 Correct 8 ms 13388 KB Output is correct
12 Correct 8 ms 13360 KB Output is correct
13 Correct 8 ms 13388 KB Output is correct
14 Correct 8 ms 13388 KB Output is correct
15 Correct 8 ms 13380 KB Output is correct
16 Correct 8 ms 13388 KB Output is correct
17 Correct 8 ms 13388 KB Output is correct
18 Correct 8 ms 13388 KB Output is correct
19 Correct 286 ms 22548 KB Output is correct
20 Correct 264 ms 22656 KB Output is correct
21 Correct 288 ms 22572 KB Output is correct
22 Correct 284 ms 22616 KB Output is correct
23 Correct 126 ms 23108 KB Output is correct
24 Correct 109 ms 22232 KB Output is correct
25 Correct 203 ms 25448 KB Output is correct
26 Correct 139 ms 28396 KB Output is correct
27 Correct 293 ms 32500 KB Output is correct
28 Correct 376 ms 43780 KB Output is correct
29 Correct 354 ms 42880 KB Output is correct
30 Correct 284 ms 32444 KB Output is correct
31 Correct 272 ms 32348 KB Output is correct
32 Correct 309 ms 32704 KB Output is correct
33 Correct 449 ms 31244 KB Output is correct
34 Correct 225 ms 32192 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 13416 KB Output is correct
2 Correct 8 ms 13388 KB Output is correct
3 Correct 8 ms 13260 KB Output is correct
4 Correct 8 ms 13268 KB Output is correct
5 Correct 8 ms 13364 KB Output is correct
6 Correct 8 ms 13360 KB Output is correct
7 Correct 9 ms 13388 KB Output is correct
8 Correct 8 ms 13260 KB Output is correct
9 Correct 10 ms 13280 KB Output is correct
10 Correct 8 ms 13348 KB Output is correct
11 Correct 8 ms 13388 KB Output is correct
12 Correct 8 ms 13360 KB Output is correct
13 Correct 8 ms 13388 KB Output is correct
14 Correct 8 ms 13388 KB Output is correct
15 Correct 8 ms 13380 KB Output is correct
16 Correct 8 ms 13388 KB Output is correct
17 Correct 8 ms 13388 KB Output is correct
18 Correct 8 ms 13388 KB Output is correct
19 Correct 7 ms 13284 KB Output is correct
20 Correct 9 ms 13388 KB Output is correct
21 Correct 11 ms 13396 KB Output is correct
22 Correct 9 ms 13400 KB Output is correct
23 Correct 9 ms 13400 KB Output is correct
24 Correct 9 ms 13456 KB Output is correct
25 Correct 11 ms 13600 KB Output is correct
26 Correct 8 ms 13408 KB Output is correct
27 Correct 8 ms 13372 KB Output is correct
28 Correct 10 ms 13512 KB Output is correct
29 Correct 10 ms 13528 KB Output is correct
30 Correct 11 ms 13528 KB Output is correct
31 Correct 10 ms 13512 KB Output is correct
32 Correct 10 ms 13516 KB Output is correct
33 Correct 10 ms 13516 KB Output is correct
34 Correct 10 ms 13388 KB Output is correct
35 Correct 9 ms 13388 KB Output is correct
36 Correct 9 ms 13476 KB Output is correct
37 Correct 10 ms 13500 KB Output is correct
38 Correct 11 ms 13516 KB Output is correct
39 Correct 286 ms 22548 KB Output is correct
40 Correct 264 ms 22656 KB Output is correct
41 Correct 288 ms 22572 KB Output is correct
42 Correct 284 ms 22616 KB Output is correct
43 Correct 126 ms 23108 KB Output is correct
44 Correct 109 ms 22232 KB Output is correct
45 Correct 203 ms 25448 KB Output is correct
46 Correct 139 ms 28396 KB Output is correct
47 Correct 293 ms 32500 KB Output is correct
48 Correct 376 ms 43780 KB Output is correct
49 Correct 354 ms 42880 KB Output is correct
50 Correct 284 ms 32444 KB Output is correct
51 Correct 272 ms 32348 KB Output is correct
52 Correct 309 ms 32704 KB Output is correct
53 Correct 449 ms 31244 KB Output is correct
54 Correct 225 ms 32192 KB Output is correct
55 Correct 50 ms 14540 KB Output is correct
56 Correct 27 ms 14248 KB Output is correct
57 Correct 220 ms 22804 KB Output is correct
58 Correct 59 ms 21808 KB Output is correct
59 Correct 554 ms 37260 KB Output is correct
60 Correct 1721 ms 64928 KB Output is correct
61 Correct 393 ms 32992 KB Output is correct
62 Correct 465 ms 32948 KB Output is correct
63 Correct 574 ms 32968 KB Output is correct
64 Correct 1914 ms 44664 KB Output is correct
65 Correct 300 ms 32984 KB Output is correct
66 Correct 1057 ms 41712 KB Output is correct
67 Correct 174 ms 31832 KB Output is correct
68 Correct 699 ms 42280 KB Output is correct
69 Correct 720 ms 41756 KB Output is correct
70 Correct 628 ms 40900 KB Output is correct