oj.uz

Submission #1093688

# Submission time Handle Problem Language Result Execution time Memory
1093688 2024-09-27T09:07:16 Z asli_bg Race (IOI11_race) C++11
0 / 100
 3 ms 4956 KB 
#pragma GCC optimize("O3,unroll-loops")

#include "race.h"

#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
 
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> inset;
 
//#define int long long
 
#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 pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<bool> vb;
 
const int MAXN=2e5+5;
const long long INF=1e18;
const int MOD=1e9+7;
 
vii adj[MAXN];
int n,k;
long long res;
pii t[MAXN];

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

    /*cout<<"nd" sp nd-1<<endl;
    DEBUG(aranan);
    DEBUG(cikar);

    contp(a);
    contp(b);*/

    auto itt=a.lower_bound({aranan,0});
    if((*itt).fi==aranan){
        res=min(res,(long long) (*itt).se-cikar);
    }

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

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

    /*DEBUG(nd-1);
    contp(a);
    contp(b);*/
}

set<pii> dfs(int nd,int ata,int h,int edg){
    set<pii> s;
    t[nd]={edg,h};
    
    //DEBUG(nd);
    //cout<<"control tree "<< t[nd].fi sp t[nd].se<<endl;
    //DEBUG(adj[nd].size());

    if(adj[nd].size()<=1 and nd!=1){
        /*cout<<"nd" sp nd-1<<endl;
        DEBUG(t[nd].fi);
        DEBUG(t[nd].se);*/

        s.insert({t[nd].se,t[nd].fi});
        return s;
    }

    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);
        }
    }

    return s;
}

int best_path(int N, int K, int H[][2], int L[]){
    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);

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

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Incorrect 2 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Incorrect 2 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Incorrect 2 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Incorrect 2 ms 4956 KB Output isn't correct
5 Halted 0 ms 0 KB -