제출 #294733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
294733		khangal	경주 (Race) (IOI11_race)	C++14	0 / 100	25 ms	32256 KiB

race

#include<bits/stdc++.h>
#include "race.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0)
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
typedef tree<ll , null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_multi_set;
typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b,c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z,t,xx,yy;
bool used[1234567];
pl p[1234567];
vector<pl> v[123456],vec,vv1,vv2,vtr[1234567];
string s1,s;
ll sz[1234567];
// ll tr[5234567],par[1234567],maxx,arr[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
map<ll,ll> mp;
ll son[1234567],arr[1234567],node;
void dfs(ll x,ll y,ll dis){
//	cout<<x<<" "<<y<<'\n';
        d[x] = d[y] + 1;
        c[x] = c[y] + dis;
    for(auto u:v[x]){
        if(u.ff == y)con;
        dfs(u.ff,x,u.ss);
    }
}
int best_path(int N, int K, int H[][2], int L[])
{   
    ll mn=MAX;
    for(int i=0;i<N-1;i++){
        v[H[i][0]].pb({H[i][1],L[i]});
        v[H[i][1]].pb({H[i][0],L[i]});
    }
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++)used[j]=0,c[j]=0,d[j]=0;
        dfs(i,-1,0);
//        cout<<'\n';
        for(int j=0;j<N;j++){
//        	cout<<d[j]<<" ";
            if(K==c[j] && mn > d[j])mn = d[j];
        }
//        cout<<'\n';
    }
//    cout<<mn<<'\n';
    if(mn == MAX)return -1;
    else return mn;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57