oj.uz

답안 #805676

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
805676 2023-08-03T20:11:46 Z shadow_sami 경주 (Race) (IOI11_race) C++17
100 / 100
 309 ms 84764 KB 
#include "race.h"
#include<bits/stdc++.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 int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
set<pi> st[mx];
vector<pi> adj[mx];
ll dep[mx];
ll dis[mx];
int sr,de;

void merge(ll a,ll b){
	if(st[a].size() < st[b].size())
		st[a].swap(st[b]);
	res = m + 2*dis[a];
	fx(st[b]){
		if(st[a].lower_bound({res - x.ff,0}) == st[a].end())
			continue;
		auto it = st[a].lower_bound({res - x.ff,0});
		if(res-x.ff!=it->ff)
			continue;
		ans = min(ans,it->ss+x.ss - 2*dep[a]);
	}
	fx(st[b])
		st[a].insert(x);
	st[b].clear();
	return;
}

void dfs(ll u,ll par){
	fx(adj[u])
		if(x.ff!=par){
			dis[x.ff] = dis[u] + x.ss;
			dep[x.ff] = dep[u] + 1;
			dfs(x.ff,u);
			merge(u,x.ff);
		}		
	tp = m + dis[u];
	if(st[u].lower_bound({tp,0}) != st[u].end()){
		auto it = st[u].lower_bound({tp,0});
		if(tp==it->ff)
			ans = min(ans,it->ss - dep[u]);
	}
	st[u].insert({dis[u],dep[u]});	
	return;	
}

int best_path(int N, int K, int H[][2], int L[]){
	ans = 1e18;
	n = N;
	m = K;	
	fip(0,n-1){
		sr = H[i][0];
		de = H[i][1];
		tp = L[i];
		adj[sr].push_back({de,tp});
		adj[de].push_back({sr,tp});
	}
	dep[0] = 0;
	dis[0] = 0;
	dfs(0,-1);
	if(ans==1e18)
		ans = -1;
	return ans;
}

// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         ll N,K;
//         cin>>N>>K;
//         int H[N-1][2];
//         int L[N-1];
//         fip(0,N-1)
//         	cin>>H[i][0]>>H[i][1]>>L[i];
//         cout<<best_path(N,K,H,L)<<nli;
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 16 ms 35532 KB Output is correct
3 Correct 16 ms 35544 KB Output is correct
4 Correct 16 ms 35532 KB Output is correct
5 Correct 17 ms 35580 KB Output is correct
6 Correct 19 ms 35516 KB Output is correct
7 Correct 17 ms 35532 KB Output is correct
8 Correct 17 ms 35536 KB Output is correct
9 Correct 17 ms 35564 KB Output is correct
10 Correct 16 ms 35484 KB Output is correct
11 Correct 16 ms 35552 KB Output is correct
12 Correct 18 ms 35556 KB Output is correct
13 Correct 17 ms 35540 KB Output is correct
14 Correct 17 ms 35540 KB Output is correct
15 Correct 16 ms 35540 KB Output is correct
16 Correct 15 ms 35540 KB Output is correct
17 Correct 18 ms 35540 KB Output is correct
18 Correct 21 ms 35492 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 16 ms 35532 KB Output is correct
3 Correct 16 ms 35544 KB Output is correct
4 Correct 16 ms 35532 KB Output is correct
5 Correct 17 ms 35580 KB Output is correct
6 Correct 19 ms 35516 KB Output is correct
7 Correct 17 ms 35532 KB Output is correct
8 Correct 17 ms 35536 KB Output is correct
9 Correct 17 ms 35564 KB Output is correct
10 Correct 16 ms 35484 KB Output is correct
11 Correct 16 ms 35552 KB Output is correct
12 Correct 18 ms 35556 KB Output is correct
13 Correct 17 ms 35540 KB Output is correct
14 Correct 17 ms 35540 KB Output is correct
15 Correct 16 ms 35540 KB Output is correct
16 Correct 15 ms 35540 KB Output is correct
17 Correct 18 ms 35540 KB Output is correct
18 Correct 21 ms 35492 KB Output is correct
19 Correct 19 ms 35560 KB Output is correct
20 Correct 16 ms 35548 KB Output is correct
21 Correct 20 ms 35664 KB Output is correct
22 Correct 20 ms 35660 KB Output is correct
23 Correct 16 ms 35668 KB Output is correct
24 Correct 22 ms 35712 KB Output is correct
25 Correct 19 ms 35648 KB Output is correct
26 Correct 19 ms 35660 KB Output is correct
27 Correct 16 ms 35556 KB Output is correct
28 Correct 18 ms 35660 KB Output is correct
29 Correct 18 ms 35660 KB Output is correct
30 Correct 18 ms 35704 KB Output is correct
31 Correct 18 ms 35672 KB Output is correct
32 Correct 18 ms 35672 KB Output is correct
33 Correct 18 ms 35668 KB Output is correct
34 Correct 18 ms 35672 KB Output is correct
35 Correct 18 ms 35660 KB Output is correct
36 Correct 17 ms 35644 KB Output is correct
37 Correct 19 ms 35664 KB Output is correct
38 Correct 18 ms 35668 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 16 ms 35532 KB Output is correct
3 Correct 16 ms 35544 KB Output is correct
4 Correct 16 ms 35532 KB Output is correct
5 Correct 17 ms 35580 KB Output is correct
6 Correct 19 ms 35516 KB Output is correct
7 Correct 17 ms 35532 KB Output is correct
8 Correct 17 ms 35536 KB Output is correct
9 Correct 17 ms 35564 KB Output is correct
10 Correct 16 ms 35484 KB Output is correct
11 Correct 16 ms 35552 KB Output is correct
12 Correct 18 ms 35556 KB Output is correct
13 Correct 17 ms 35540 KB Output is correct
14 Correct 17 ms 35540 KB Output is correct
15 Correct 16 ms 35540 KB Output is correct
16 Correct 15 ms 35540 KB Output is correct
17 Correct 18 ms 35540 KB Output is correct
18 Correct 21 ms 35492 KB Output is correct
19 Correct 125 ms 45204 KB Output is correct
20 Correct 109 ms 45132 KB Output is correct
21 Correct 97 ms 45076 KB Output is correct
22 Correct 108 ms 45012 KB Output is correct
23 Correct 117 ms 45848 KB Output is correct
24 Correct 91 ms 44468 KB Output is correct
25 Correct 106 ms 58348 KB Output is correct
26 Correct 70 ms 59952 KB Output is correct
27 Correct 152 ms 57972 KB Output is correct
28 Correct 186 ms 84764 KB Output is correct
29 Correct 222 ms 84284 KB Output is correct
30 Correct 170 ms 57956 KB Output is correct
31 Correct 153 ms 57900 KB Output is correct
32 Correct 205 ms 58016 KB Output is correct
33 Correct 154 ms 54000 KB Output is correct
34 Correct 287 ms 66900 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 35540 KB Output is correct
2 Correct 16 ms 35532 KB Output is correct
3 Correct 16 ms 35544 KB Output is correct
4 Correct 16 ms 35532 KB Output is correct
5 Correct 17 ms 35580 KB Output is correct
6 Correct 19 ms 35516 KB Output is correct
7 Correct 17 ms 35532 KB Output is correct
8 Correct 17 ms 35536 KB Output is correct
9 Correct 17 ms 35564 KB Output is correct
10 Correct 16 ms 35484 KB Output is correct
11 Correct 16 ms 35552 KB Output is correct
12 Correct 18 ms 35556 KB Output is correct
13 Correct 17 ms 35540 KB Output is correct
14 Correct 17 ms 35540 KB Output is correct
15 Correct 16 ms 35540 KB Output is correct
16 Correct 15 ms 35540 KB Output is correct
17 Correct 18 ms 35540 KB Output is correct
18 Correct 21 ms 35492 KB Output is correct
19 Correct 19 ms 35560 KB Output is correct
20 Correct 16 ms 35548 KB Output is correct
21 Correct 20 ms 35664 KB Output is correct
22 Correct 20 ms 35660 KB Output is correct
23 Correct 16 ms 35668 KB Output is correct
24 Correct 22 ms 35712 KB Output is correct
25 Correct 19 ms 35648 KB Output is correct
26 Correct 19 ms 35660 KB Output is correct
27 Correct 16 ms 35556 KB Output is correct
28 Correct 18 ms 35660 KB Output is correct
29 Correct 18 ms 35660 KB Output is correct
30 Correct 18 ms 35704 KB Output is correct
31 Correct 18 ms 35672 KB Output is correct
32 Correct 18 ms 35672 KB Output is correct
33 Correct 18 ms 35668 KB Output is correct
34 Correct 18 ms 35672 KB Output is correct
35 Correct 18 ms 35660 KB Output is correct
36 Correct 17 ms 35644 KB Output is correct
37 Correct 19 ms 35664 KB Output is correct
38 Correct 18 ms 35668 KB Output is correct
39 Correct 125 ms 45204 KB Output is correct
40 Correct 109 ms 45132 KB Output is correct
41 Correct 97 ms 45076 KB Output is correct
42 Correct 108 ms 45012 KB Output is correct
43 Correct 117 ms 45848 KB Output is correct
44 Correct 91 ms 44468 KB Output is correct
45 Correct 106 ms 58348 KB Output is correct
46 Correct 70 ms 59952 KB Output is correct
47 Correct 152 ms 57972 KB Output is correct
48 Correct 186 ms 84764 KB Output is correct
49 Correct 222 ms 84284 KB Output is correct
50 Correct 170 ms 57956 KB Output is correct
51 Correct 153 ms 57900 KB Output is correct
52 Correct 205 ms 58016 KB Output is correct
53 Correct 154 ms 54000 KB Output is correct
54 Correct 287 ms 66900 KB Output is correct
55 Correct 27 ms 37068 KB Output is correct
56 Correct 24 ms 36436 KB Output is correct
57 Correct 61 ms 45064 KB Output is correct
58 Correct 51 ms 43944 KB Output is correct
59 Correct 68 ms 59852 KB Output is correct
60 Correct 183 ms 84348 KB Output is correct
61 Correct 182 ms 62012 KB Output is correct
62 Correct 143 ms 58056 KB Output is correct
63 Correct 178 ms 57968 KB Output is correct
64 Correct 309 ms 66564 KB Output is correct
65 Correct 296 ms 67912 KB Output is correct
66 Correct 211 ms 83424 KB Output is correct
67 Correct 132 ms 53976 KB Output is correct
68 Correct 249 ms 67068 KB Output is correct
69 Correct 260 ms 71732 KB Output is correct
70 Correct 244 ms 65584 KB Output is correct