oj.uz

Submission #1093751

# Submission time Handle Problem Language Result Execution time Memory
1093751 2024-09-27T11:10:20 Z asli_bg Race (IOI11_race) C++11
21 / 100
 71 ms 19436 KB 
#pragma GCC optimize("O3,unroll-loops")

#include "race.h"

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define pb push_back
 
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define cont(x) {for(auto el:x) cout<<el<<' ';cout<<endl;}
#define contp(x) {for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;}
#define sp <<" "<<
#define mid (l+r)/2
#define endl '\n'
 
#define DEBUG(X) {cout<<#X<<' '<<(X)<<endl;}
 
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
 
typedef vector<int> vi;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;

const int MAXN=5e5+5;
const int INF=INT_MAX;
const int MOD=1e9+7;
 
vii adj[MAXN];
int n,k;
int res;
pii t[MAXN];

void merge(set<pii>& a,set<pii>& b, int nd){
    if(a.size()<b.size()) swap(a,b);
    //setteki elemanlar--> {dist,edge sayisi}
    //adjdeki elemanlar--> {kom,dist}
    int aranan=k+t[nd].se;
    int cikar=t[nd].fi;

    //önce cevabı bul
    for(auto el:b){
        auto deg=aranan-el.fi+t[nd].se;
        if(deg<=0) continue;
        auto it=a.lower_bound({deg,1});
        auto bir=(*it).fi; //distance
        auto iki=(*it).se; //no of edges
    
        if(bir==deg){
            res=min(res,iki+el.se-2*cikar);
        }
    }

    //sonra insertle
    for(auto el:b) a.insert(el);
}

set<pii> dfs(int nd,int ata,int h,int edg){
    set<pii> s;
    t[nd]={edg,h};

    for(auto el:adj[nd]){
        int kom=el.fi;
        int cost=el.se;
        if(kom!=ata){
            auto c=dfs(kom,nd,h+cost,edg+1);
            merge(s,c,nd);
        }
    }

    int aranan=k+t[nd].se;
    int cikar=t[nd].fi;

    auto it=s.lower_bound({aranan,1});
    if((*it).fi==aranan){
        res=min(res,(*it).se-cikar);
    }
    s.insert({t[nd].se,t[nd].fi});
    return s;
}


int best_path(int N, int K, int H[][2], int L[]){
    #define int long long
    res=INF;
    k=K;
    n=N;
    FOR(i,n-1){
        adj[H[i][0]+1].pb({H[i][1]+1,L[i]});
        adj[H[i][1]+1].pb({H[i][0]+1,L[i]});
    }
    
    dfs(1,0,0,0);

    #undef int

    if(res==INF) res=-1;
    return (int) res;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12120 KB Output is correct
2 Correct 6 ms 12124 KB Output is correct
3 Correct 6 ms 12204 KB Output is correct
4 Correct 7 ms 12124 KB Output is correct
5 Correct 6 ms 12124 KB Output is correct
6 Correct 7 ms 12184 KB Output is correct
7 Correct 7 ms 12128 KB Output is correct
8 Correct 6 ms 11996 KB Output is correct
9 Correct 8 ms 12124 KB Output is correct
10 Correct 7 ms 12128 KB Output is correct
11 Correct 7 ms 12184 KB Output is correct
12 Correct 7 ms 12184 KB Output is correct
13 Correct 7 ms 12208 KB Output is correct
14 Correct 6 ms 12076 KB Output is correct
15 Correct 6 ms 12124 KB Output is correct
16 Correct 7 ms 11992 KB Output is correct
17 Correct 9 ms 11988 KB Output is correct
18 Correct 6 ms 12136 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12120 KB Output is correct
2 Correct 6 ms 12124 KB Output is correct
3 Correct 6 ms 12204 KB Output is correct
4 Correct 7 ms 12124 KB Output is correct
5 Correct 6 ms 12124 KB Output is correct
6 Correct 7 ms 12184 KB Output is correct
7 Correct 7 ms 12128 KB Output is correct
8 Correct 6 ms 11996 KB Output is correct
9 Correct 8 ms 12124 KB Output is correct
10 Correct 7 ms 12128 KB Output is correct
11 Correct 7 ms 12184 KB Output is correct
12 Correct 7 ms 12184 KB Output is correct
13 Correct 7 ms 12208 KB Output is correct
14 Correct 6 ms 12076 KB Output is correct
15 Correct 6 ms 12124 KB Output is correct
16 Correct 7 ms 11992 KB Output is correct
17 Correct 9 ms 11988 KB Output is correct
18 Correct 6 ms 12136 KB Output is correct
19 Correct 7 ms 12128 KB Output is correct
20 Correct 7 ms 12128 KB Output is correct
21 Correct 6 ms 12124 KB Output is correct
22 Correct 7 ms 12268 KB Output is correct
23 Correct 7 ms 12128 KB Output is correct
24 Correct 7 ms 12120 KB Output is correct
25 Correct 7 ms 12120 KB Output is correct
26 Correct 7 ms 12124 KB Output is correct
27 Correct 7 ms 12272 KB Output is correct
28 Correct 7 ms 12124 KB Output is correct
29 Correct 6 ms 12124 KB Output is correct
30 Correct 7 ms 12328 KB Output is correct
31 Correct 7 ms 12124 KB Output is correct
32 Correct 7 ms 12124 KB Output is correct
33 Correct 7 ms 12124 KB Output is correct
34 Correct 7 ms 12124 KB Output is correct
35 Correct 7 ms 12336 KB Output is correct
36 Correct 7 ms 12120 KB Output is correct
37 Correct 7 ms 12120 KB Output is correct
38 Correct 7 ms 12192 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12120 KB Output is correct
2 Correct 6 ms 12124 KB Output is correct
3 Correct 6 ms 12204 KB Output is correct
4 Correct 7 ms 12124 KB Output is correct
5 Correct 6 ms 12124 KB Output is correct
6 Correct 7 ms 12184 KB Output is correct
7 Correct 7 ms 12128 KB Output is correct
8 Correct 6 ms 11996 KB Output is correct
9 Correct 8 ms 12124 KB Output is correct
10 Correct 7 ms 12128 KB Output is correct
11 Correct 7 ms 12184 KB Output is correct
12 Correct 7 ms 12184 KB Output is correct
13 Correct 7 ms 12208 KB Output is correct
14 Correct 6 ms 12076 KB Output is correct
15 Correct 6 ms 12124 KB Output is correct
16 Correct 7 ms 11992 KB Output is correct
17 Correct 9 ms 11988 KB Output is correct
18 Correct 6 ms 12136 KB Output is correct
19 Incorrect 71 ms 19436 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12120 KB Output is correct
2 Correct 6 ms 12124 KB Output is correct
3 Correct 6 ms 12204 KB Output is correct
4 Correct 7 ms 12124 KB Output is correct
5 Correct 6 ms 12124 KB Output is correct
6 Correct 7 ms 12184 KB Output is correct
7 Correct 7 ms 12128 KB Output is correct
8 Correct 6 ms 11996 KB Output is correct
9 Correct 8 ms 12124 KB Output is correct
10 Correct 7 ms 12128 KB Output is correct
11 Correct 7 ms 12184 KB Output is correct
12 Correct 7 ms 12184 KB Output is correct
13 Correct 7 ms 12208 KB Output is correct
14 Correct 6 ms 12076 KB Output is correct
15 Correct 6 ms 12124 KB Output is correct
16 Correct 7 ms 11992 KB Output is correct
17 Correct 9 ms 11988 KB Output is correct
18 Correct 6 ms 12136 KB Output is correct
19 Correct 7 ms 12128 KB Output is correct
20 Correct 7 ms 12128 KB Output is correct
21 Correct 6 ms 12124 KB Output is correct
22 Correct 7 ms 12268 KB Output is correct
23 Correct 7 ms 12128 KB Output is correct
24 Correct 7 ms 12120 KB Output is correct
25 Correct 7 ms 12120 KB Output is correct
26 Correct 7 ms 12124 KB Output is correct
27 Correct 7 ms 12272 KB Output is correct
28 Correct 7 ms 12124 KB Output is correct
29 Correct 6 ms 12124 KB Output is correct
30 Correct 7 ms 12328 KB Output is correct
31 Correct 7 ms 12124 KB Output is correct
32 Correct 7 ms 12124 KB Output is correct
33 Correct 7 ms 12124 KB Output is correct
34 Correct 7 ms 12124 KB Output is correct
35 Correct 7 ms 12336 KB Output is correct
36 Correct 7 ms 12120 KB Output is correct
37 Correct 7 ms 12120 KB Output is correct
38 Correct 7 ms 12192 KB Output is correct
39 Incorrect 71 ms 19436 KB Output isn't correct
40 Halted 0 ms 0 KB -