제출 #251399

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251399		leaked	경주 (Race) (IOI11_race)	C++14	100 / 100	544 ms	102264 KiB

race

#include<bits/stdc++.h>
#include "race.h"
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//////
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//////#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define ull unsigned long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const int Nmax=2e5+100;
const int M=999999937;
const int pp=73;
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> st;
void bad(){
    cout<<-1;
    exit(0);
}
ll n,sz[Nmax],h[Nmax],k,a[Nmax];
ll s[Nmax];
vector<pll>g[Nmax];
set<pll>* vec[Nmax];
void prec(ll v,ll p,ll gl,ll ss){
    sz[v]=1;
    h[v]=gl;
    s[v]=ss;
    for(auto &z : g[v]){
        if(z.f==p) continue;
        prec(z.f,v,gl+1,z.s+ss);
        sz[v]+=sz[z.f];
    }
//    debug()<<imie(h[v])<<imie(s[v]);
}
ll ans=2e9;
void dfs(ll v,ll p){
    ll big=-1;
    for(auto &u : g[v]){
        if(u.f==p) continue;
        if(big==-1 || sz[u.f]>sz[big]) big=u.f;
    }
    for(auto &u : g[v]){
        if(u.f==p || u.f==big) continue;
        dfs(u.f,v);
    }
    if(big==-1){
        vec[v]=new set<pll>();
    }else{
        dfs(big,v);vec[v]=vec[big];
    }
    vec[v]->insert({s[v],h[v]});
    for(auto &u : g[v]){
        if(u.f==p || u.f==big) continue;
        for(auto &z : *vec[u.f]){
            if(z.f-s[v]>k) continue;
            auto it=vec[v]->lower_bound(m_p(s[v]+(k-(z.f-s[v])),(ll)-2e9));
            if(it!=vec[v]->end()){
                if(it->f+z.f-2*s[v]==k){
                    ans=min(ans,it->s+z.s-2*h[v]);
                }
            }
        }
        vec[v]->insert(all((*vec[u.f])));
    }
//    debug()<<imie(*vec[v]);
    auto it=vec[v]->lower_bound(m_p(s[v]+k,(ll)-2e9));
    if(it!=vec[v]->end()){
        if(it->f==s[v]+k){
            ans=min(ans,it->s-h[v]);
        }
    }

}
int best_path(int N,int K,int H[][2],int L[]){
    fast_io;
    n=N,k=K;
    for(int i=0;i<n-1;i++){
        g[H[i][0]].p_b(m_p(H[i][1],L[i]));
        g[H[i][1]].p_b({H[i][0],L[i]});
    }
    prec(0,0,0,0);
    dfs(0,0);
    if(ans==2e9) ans=-1;
    return int(ans);
}
/*


*/

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