oj.uz

Submission #486494

# Submission time Handle Problem Language Result Execution time Memory
486494 2021-11-11T20:30:29 Z ammardab3an Race (IOI11_race) C++17
100 / 100
 994 ms 81880 KB 
// By AmmarDab3an - Aleppo University

#include "bits/stdc++.h"

using namespace std;

#define int int64_t
#define ll  int64_t

// typedef unsigned int        uint;
// typedef long long int       ll;
// typedef unsigned long long  ull;
typedef pair<int, int>    pii;
typedef pair<ll, ll>      pll;
typedef pair<int, pii>    iii;
typedef pair<ll, pll>     lll;
typedef vector<int>       vi;
typedef vector<ll>        vl;
typedef vector<pii>       vpii;
typedef vector<pll>       vpll;

#define endl '\n'
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define freopenI freopen("input.txt", "r", stdin);
#define freopenO freopen("output.txt", "w", stdout);

const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const double  PI = acos(-1);

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rand(int x, int y) {
	return uniform_int_distribution<int>(x, y)(rng);
}

int mul(int a, int b){
	int ret = (1ll * (a%MOD) * (b%MOD)) % MOD;
	return (ret+MOD)%MOD;
}

int add(int a, int b){
	int ret = (1ll * (a%MOD) + (b%MOD)) % MOD;
	return (ret+MOD)%MOD;
}

int pow_exp(int n, int p){
	if(!p) return 1;
	if(p&1) return mul(n, pow_exp(n, p-1));
	int tmp = pow_exp(n, p/2);
	return mul(tmp, tmp);
}

const int NMAX = 2e5 + 10;
const int LOG_MAX = ceil(log2(double(NMAX)));

int n, k, log_n;
vpii adj[NMAX];
int depth[NMAX], sub[NMAX], par[NMAX][LOG_MAX];
int cpar[NMAX];

void dfs0(int u, int p){

    for(auto [v, w]: adj[u]) if(v != p){

        depth[v] = depth[u] + 1;

        par[v][0] = u;
        for(int i = 1; i < log_n; i++)
            par[v][i] = par[par[v][i-1]][i-1];

        dfs0(v, u);
    }
}

int lca(int u, int v){

    if(depth[u] < depth[v]) swap(u, v);
    int diff = depth[u] - depth[v];
    for(int i = 0; i < log_n; i++) if(diff & (1<<i)) u = par[u][i];
    if(u == v) return u;
    for(int i = log_n-1; i >= 0; i--) if(par[u][i] != par[v][i])
        u = par[u][i], v = par[v][i];
    return par[u][0];
}

int dist(int u, int v){
    return depth[u] + depth[v] - 2 * depth[lca(u, v)];
}

int nn;
void dfs1(int u, int p){

    nn++;
    sub[u] = 1;

    for(auto [v, w] : adj[u]) if(v != p){
        dfs1(v, u);
        sub[u] += sub[v];
    }
}

int dfs2(int u, int p){

    for(auto [v, w] : adj[u]) if(v != p) if(sub[v] > nn/2){
        return dfs2(v, u);
    }

    return u;
}

int _dist[NMAX];
int _depth[NMAX];
map<int, int> freq;
vi update_later;

int go(int u, int p){

    int ret = INFLL;
    auto it = freq.find(k-_dist[u]);
    
    if(it != freq.end()){
        ret = it->second + _depth[u];
    }
    
    update_later.push_back(u);

    for(auto [v, w] : adj[u]) if(v != p){

        _dist[v] = _dist[u]+w;
        _depth[v] = _depth[u]+1;
        
        ret = min(ret, go(v, u));

        if(p==-1){
            
            for(auto u : update_later){
                
                auto it = freq.find(_dist[u]);
                
                if(it==freq.end()){
                    freq[_dist[u]] = _depth[u];
                }
                else{
                    freq[_dist[u]] = min(it->second, _depth[u]);
                }
            }
            
            update_later.clear();
        }
    }

    return ret;
}

int decompose(int u, int p){

    nn = 0;
    dfs1(u, u);
    int centroid = dfs2(u, u);
    if(p == -1) p = centroid;
    cpar[centroid] = p;

    _dist[centroid] = 0;
    _depth[centroid] = 0;
    update_later.clear();
    freq.clear();
    freq[0] = 0;

    int ret = go(centroid, -1);

    for(auto [v, w] : adj[centroid]){
        adj[v].erase(find(adj[v].begin(), adj[v].end(), (pii){centroid, w}));
        ret = min(ret, decompose(v, centroid));
    }

    adj[centroid].clear();

    return ret;
}

int best_path(int32_t N, int32_t K, int32_t H[][2], int32_t L[]){

    ::n = N;
    ::k = K;
    log_n = ceil(log2(double(N)));

    for(int i = 0; i < n; i++){
        adj[i].clear();
    }
    
    for(int i = 0; i < n-1; i++){
        int u = H[i][0];
        int v = H[i][1];
        adj[u].push_back({v, L[i]});
        adj[v].push_back({u, L[i]});
    }

    dfs0(0, -1);
    int ret = decompose(0, -1);
    if(ret==INFLL) ret = -1;
    
    return ret;
}

#ifdef CPEDU

int32_t main(){

    fastIO;

#ifdef LOCAL
    freopenI;
    freopenO;
#endif

    // freopen("name.in", "r", stdin);

    int32_t N, K;
    cin >> N >> K;

    int32_t H[N-1][2];
    for(int i = 0; i < N-1; i++){
        cin >> H[i][0] >> H[i][1];
    }

    int32_t L[N-1];
    for(int i = 0; i < N-1; i++){
        cin >> L[i];
    }

    cout << best_path(N, K, H, L) << endl;
}

#endif

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 5068 KB Output is correct
6 Correct 2 ms 5068 KB Output is correct
7 Correct 2 ms 5068 KB Output is correct
8 Correct 3 ms 5248 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 2 ms 5008 KB Output is correct
12 Correct 2 ms 5068 KB Output is correct
13 Correct 2 ms 5068 KB Output is correct
14 Correct 2 ms 5068 KB Output is correct
15 Correct 3 ms 5068 KB Output is correct
16 Correct 3 ms 5068 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct
18 Correct 2 ms 5068 KB Output is correct
19 Correct 238 ms 31108 KB Output is correct
20 Correct 257 ms 31112 KB Output is correct
21 Correct 231 ms 31100 KB Output is correct
22 Correct 210 ms 31172 KB Output is correct
23 Correct 272 ms 31392 KB Output is correct
24 Correct 138 ms 30532 KB Output is correct
25 Correct 227 ms 37212 KB Output is correct
26 Correct 103 ms 37056 KB Output is correct
27 Correct 290 ms 57000 KB Output is correct
28 Correct 952 ms 81600 KB Output is correct
29 Correct 951 ms 81612 KB Output is correct
30 Correct 290 ms 57072 KB Output is correct
31 Correct 285 ms 56968 KB Output is correct
32 Correct 406 ms 57028 KB Output is correct
33 Correct 478 ms 56504 KB Output is correct
34 Correct 871 ms 69628 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 5068 KB Output is correct
6 Correct 2 ms 5068 KB Output is correct
7 Correct 2 ms 5068 KB Output is correct
8 Correct 3 ms 5248 KB Output is correct
9 Correct 3 ms 5068 KB Output is correct
10 Correct 3 ms 5068 KB Output is correct
11 Correct 2 ms 5008 KB Output is correct
12 Correct 2 ms 5068 KB Output is correct
13 Correct 2 ms 5068 KB Output is correct
14 Correct 2 ms 5068 KB Output is correct
15 Correct 3 ms 5068 KB Output is correct
16 Correct 3 ms 5068 KB Output is correct
17 Correct 3 ms 5068 KB Output is correct
18 Correct 2 ms 5068 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 2 ms 5068 KB Output is correct
21 Correct 4 ms 5324 KB Output is correct
22 Correct 4 ms 5324 KB Output is correct
23 Correct 4 ms 5324 KB Output is correct
24 Correct 4 ms 5324 KB Output is correct
25 Correct 4 ms 5276 KB Output is correct
26 Correct 4 ms 5324 KB Output is correct
27 Correct 3 ms 5276 KB Output is correct
28 Correct 4 ms 5276 KB Output is correct
29 Correct 5 ms 5452 KB Output is correct
30 Correct 4 ms 5324 KB Output is correct
31 Correct 4 ms 5272 KB Output is correct
32 Correct 4 ms 5324 KB Output is correct
33 Correct 4 ms 5324 KB Output is correct
34 Correct 4 ms 5324 KB Output is correct
35 Correct 3 ms 5324 KB Output is correct
36 Correct 4 ms 5324 KB Output is correct
37 Correct 3 ms 5324 KB Output is correct
38 Correct 4 ms 5324 KB Output is correct
39 Correct 238 ms 31108 KB Output is correct
40 Correct 257 ms 31112 KB Output is correct
41 Correct 231 ms 31100 KB Output is correct
42 Correct 210 ms 31172 KB Output is correct
43 Correct 272 ms 31392 KB Output is correct
44 Correct 138 ms 30532 KB Output is correct
45 Correct 227 ms 37212 KB Output is correct
46 Correct 103 ms 37056 KB Output is correct
47 Correct 290 ms 57000 KB Output is correct
48 Correct 952 ms 81600 KB Output is correct
49 Correct 951 ms 81612 KB Output is correct
50 Correct 290 ms 57072 KB Output is correct
51 Correct 285 ms 56968 KB Output is correct
52 Correct 406 ms 57028 KB Output is correct
53 Correct 478 ms 56504 KB Output is correct
54 Correct 871 ms 69628 KB Output is correct
55 Correct 21 ms 8004 KB Output is correct
56 Correct 14 ms 7628 KB Output is correct
57 Correct 135 ms 31380 KB Output is correct
58 Correct 53 ms 29956 KB Output is correct
59 Correct 265 ms 41572 KB Output is correct
60 Correct 965 ms 80556 KB Output is correct
61 Correct 326 ms 58948 KB Output is correct
62 Correct 307 ms 56996 KB Output is correct
63 Correct 395 ms 57028 KB Output is correct
64 Correct 994 ms 63800 KB Output is correct
65 Correct 875 ms 70500 KB Output is correct
66 Correct 967 ms 81880 KB Output is correct
67 Correct 178 ms 56160 KB Output is correct
68 Correct 531 ms 67756 KB Output is correct
69 Correct 525 ms 68296 KB Output is correct
70 Correct 486 ms 64832 KB Output is correct