# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
992424 |
2024-06-04T12:25:44 Z |
AbodeKu |
Race (IOI11_race) |
C++17 |
|
819 ms |
47440 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2", "popcnt")
using namespace std;
typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
typedef pair<ll , ll> PII ;
typedef vector<bool> vb ;
typedef vector<ll> vi;
typedef vector<PII> vpi;
typedef vector<vector<ll>> vvi;
typedef vector<vector<PII>> vvpi;
typedef vector<char> vc ;
const double EBS = 1e-9;
const double pi = 3.14159265358979 ;
#define Log(x) (31^__builtin_clz(x))
#define logll(x) (63^__builtin_clzll(x))
// processor cycle counter can be used to get a random number easily :)
#define rand __builtin_ia32_rdtsc()
#define popcount(i) __builtin_popcount(i)
#define popcountll(i) __builtin_popcountll(i)
#define mp make_pair
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define testCase ll t; cin >> t; while (t--)
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(f, s, i) for (ll i = f; (int) i < s; i++)
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
#define calunique(v) disance(v.begin(),unique(v.begin(),v.end()));
#define el cout << "\n"
#define mb make_pair
#define pb push_back
#define no cout << "NO\n"
#define yes cout << "YES\n"
#define all(v) v.begin(), v.end()
#define INF (ll) 1e9
#define INFLL (ll)1e9
#define debug cout << "\n___________________________________\n"
// #define int ll
#define Left ((p << 1) + 1)
#define Right ((p << 1) + 2)
const int N = 2e5 + 9 ;
struct edge{
int u , v , w ;
};
vpi adj[N];
vector<edge>e(N);
int ans = INFLL ;
struct Centroid{
vi sub , removed ;
map<int,int> mn_sub , mn ;
int n , sz , k ;
Centroid(int n , int k): n(n) , k(k){
sub = vi(n + 1) ;
removed = vi(n + 1);
}
void build(int node = 1){
int centroid = find_centroid(node);
removed[centroid] = true ;
mn.clear();
mn[0] = 0 ;
for(auto [nd , w] : adj[centroid]){
if(removed[nd])continue ;
mn_sub.clear();
dfs_mn(nd , centroid , w);
for(auto [key , v] : mn_sub){
if(mn.find(k - key) != mn.end()){
ans = min(ans , mn_sub[key] + mn[k - key]);
}
}
for(auto [key , v] : mn_sub){
if(mn.find(key) == mn.end()) mn[key] = v ;
else mn[key] = min(mn[key] , v);
}
}
mn.clear();
for(auto [nd , w] : adj[centroid]){
if(!removed[nd]) build(nd);
}
}
int find_centroid(int node){
sz = dfs_sub(node , node) ;
return dfs_centroid(node , node) ;
}
int dfs_sub(int node , int par){
sub[node] = 1 ;
for(auto [nd , w] : adj[node]){
if(nd == par || removed[nd]) continue ;
sub[node] += dfs_sub(nd , node);
}
return sub[node] ;
}
int dfs_centroid(int node , int par){
for(auto [nd , w] : adj[node]){
if(nd == par || removed[nd]) continue ;
if(sub[nd] * 2 > sz) return dfs_centroid(nd , node);
}
return node ;
}
void dfs_mn(int node , int par , int c , int depth = 1){
if(c > k) return ;
if(mn_sub.find(c) == mn_sub.end()) mn_sub[c] = depth ;
else mn_sub[c] = min(mn_sub[c] , depth);
for(auto [nd , w] : adj[node]){
if(nd == par || removed[nd]) continue ;
dfs_mn(nd , node , c + w , depth + 1);
}
}
};
int best_path(int n , int k , int edges[][2] , int weights[]){
rep(0 , n-1 , i){
int u = edges[i][0] , v = edges[i][1] ;
e[i] = {u , v , 0};
}
rep(0 , n-1 , i){
int w = weights[i];
e[i].w = w ;
auto [u , v , c] = e[i];
adj[u].pb(mp(v , w));
adj[v].pb(mp(u , w));
}
Centroid c(n , k);
c.build();
if(ans == INFLL) return -1;
return ans ;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
11100 KB |
Output is correct |
2 |
Correct |
2 ms |
11100 KB |
Output is correct |
3 |
Correct |
2 ms |
11100 KB |
Output is correct |
4 |
Correct |
2 ms |
11100 KB |
Output is correct |
5 |
Correct |
2 ms |
11100 KB |
Output is correct |
6 |
Correct |
2 ms |
11024 KB |
Output is correct |
7 |
Correct |
2 ms |
11100 KB |
Output is correct |
8 |
Correct |
2 ms |
11100 KB |
Output is correct |
9 |
Correct |
2 ms |
11100 KB |
Output is correct |
10 |
Correct |
2 ms |
11100 KB |
Output is correct |
11 |
Correct |
2 ms |
11100 KB |
Output is correct |
12 |
Correct |
3 ms |
11100 KB |
Output is correct |
13 |
Correct |
2 ms |
11100 KB |
Output is correct |
14 |
Correct |
2 ms |
11100 KB |
Output is correct |
15 |
Correct |
3 ms |
11100 KB |
Output is correct |
16 |
Correct |
3 ms |
11100 KB |
Output is correct |
17 |
Correct |
2 ms |
11100 KB |
Output is correct |
18 |
Correct |
2 ms |
11100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
11100 KB |
Output is correct |
2 |
Correct |
2 ms |
11100 KB |
Output is correct |
3 |
Correct |
2 ms |
11100 KB |
Output is correct |
4 |
Correct |
2 ms |
11100 KB |
Output is correct |
5 |
Correct |
2 ms |
11100 KB |
Output is correct |
6 |
Correct |
2 ms |
11024 KB |
Output is correct |
7 |
Correct |
2 ms |
11100 KB |
Output is correct |
8 |
Correct |
2 ms |
11100 KB |
Output is correct |
9 |
Correct |
2 ms |
11100 KB |
Output is correct |
10 |
Correct |
2 ms |
11100 KB |
Output is correct |
11 |
Correct |
2 ms |
11100 KB |
Output is correct |
12 |
Correct |
3 ms |
11100 KB |
Output is correct |
13 |
Correct |
2 ms |
11100 KB |
Output is correct |
14 |
Correct |
2 ms |
11100 KB |
Output is correct |
15 |
Correct |
3 ms |
11100 KB |
Output is correct |
16 |
Correct |
3 ms |
11100 KB |
Output is correct |
17 |
Correct |
2 ms |
11100 KB |
Output is correct |
18 |
Correct |
2 ms |
11100 KB |
Output is correct |
19 |
Correct |
2 ms |
11100 KB |
Output is correct |
20 |
Correct |
2 ms |
11100 KB |
Output is correct |
21 |
Correct |
4 ms |
11100 KB |
Output is correct |
22 |
Correct |
3 ms |
11100 KB |
Output is correct |
23 |
Correct |
3 ms |
11100 KB |
Output is correct |
24 |
Correct |
3 ms |
11100 KB |
Output is correct |
25 |
Correct |
5 ms |
11100 KB |
Output is correct |
26 |
Correct |
3 ms |
11096 KB |
Output is correct |
27 |
Correct |
3 ms |
11188 KB |
Output is correct |
28 |
Correct |
3 ms |
11100 KB |
Output is correct |
29 |
Correct |
4 ms |
11100 KB |
Output is correct |
30 |
Correct |
4 ms |
11100 KB |
Output is correct |
31 |
Correct |
3 ms |
11100 KB |
Output is correct |
32 |
Correct |
3 ms |
11100 KB |
Output is correct |
33 |
Correct |
4 ms |
11100 KB |
Output is correct |
34 |
Correct |
3 ms |
11100 KB |
Output is correct |
35 |
Correct |
3 ms |
11100 KB |
Output is correct |
36 |
Correct |
4 ms |
11188 KB |
Output is correct |
37 |
Correct |
3 ms |
11100 KB |
Output is correct |
38 |
Correct |
3 ms |
11100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
11100 KB |
Output is correct |
2 |
Correct |
2 ms |
11100 KB |
Output is correct |
3 |
Correct |
2 ms |
11100 KB |
Output is correct |
4 |
Correct |
2 ms |
11100 KB |
Output is correct |
5 |
Correct |
2 ms |
11100 KB |
Output is correct |
6 |
Correct |
2 ms |
11024 KB |
Output is correct |
7 |
Correct |
2 ms |
11100 KB |
Output is correct |
8 |
Correct |
2 ms |
11100 KB |
Output is correct |
9 |
Correct |
2 ms |
11100 KB |
Output is correct |
10 |
Correct |
2 ms |
11100 KB |
Output is correct |
11 |
Correct |
2 ms |
11100 KB |
Output is correct |
12 |
Correct |
3 ms |
11100 KB |
Output is correct |
13 |
Correct |
2 ms |
11100 KB |
Output is correct |
14 |
Correct |
2 ms |
11100 KB |
Output is correct |
15 |
Correct |
3 ms |
11100 KB |
Output is correct |
16 |
Correct |
3 ms |
11100 KB |
Output is correct |
17 |
Correct |
2 ms |
11100 KB |
Output is correct |
18 |
Correct |
2 ms |
11100 KB |
Output is correct |
19 |
Correct |
150 ms |
19872 KB |
Output is correct |
20 |
Correct |
150 ms |
19804 KB |
Output is correct |
21 |
Correct |
152 ms |
19788 KB |
Output is correct |
22 |
Correct |
141 ms |
20052 KB |
Output is correct |
23 |
Correct |
59 ms |
20264 KB |
Output is correct |
24 |
Correct |
58 ms |
19536 KB |
Output is correct |
25 |
Correct |
89 ms |
23632 KB |
Output is correct |
26 |
Correct |
67 ms |
24304 KB |
Output is correct |
27 |
Correct |
137 ms |
26960 KB |
Output is correct |
28 |
Correct |
153 ms |
34388 KB |
Output is correct |
29 |
Correct |
151 ms |
31312 KB |
Output is correct |
30 |
Correct |
144 ms |
26964 KB |
Output is correct |
31 |
Correct |
146 ms |
26960 KB |
Output is correct |
32 |
Correct |
140 ms |
26960 KB |
Output is correct |
33 |
Correct |
210 ms |
25684 KB |
Output is correct |
34 |
Correct |
108 ms |
25680 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
11100 KB |
Output is correct |
2 |
Correct |
2 ms |
11100 KB |
Output is correct |
3 |
Correct |
2 ms |
11100 KB |
Output is correct |
4 |
Correct |
2 ms |
11100 KB |
Output is correct |
5 |
Correct |
2 ms |
11100 KB |
Output is correct |
6 |
Correct |
2 ms |
11024 KB |
Output is correct |
7 |
Correct |
2 ms |
11100 KB |
Output is correct |
8 |
Correct |
2 ms |
11100 KB |
Output is correct |
9 |
Correct |
2 ms |
11100 KB |
Output is correct |
10 |
Correct |
2 ms |
11100 KB |
Output is correct |
11 |
Correct |
2 ms |
11100 KB |
Output is correct |
12 |
Correct |
3 ms |
11100 KB |
Output is correct |
13 |
Correct |
2 ms |
11100 KB |
Output is correct |
14 |
Correct |
2 ms |
11100 KB |
Output is correct |
15 |
Correct |
3 ms |
11100 KB |
Output is correct |
16 |
Correct |
3 ms |
11100 KB |
Output is correct |
17 |
Correct |
2 ms |
11100 KB |
Output is correct |
18 |
Correct |
2 ms |
11100 KB |
Output is correct |
19 |
Correct |
2 ms |
11100 KB |
Output is correct |
20 |
Correct |
2 ms |
11100 KB |
Output is correct |
21 |
Correct |
4 ms |
11100 KB |
Output is correct |
22 |
Correct |
3 ms |
11100 KB |
Output is correct |
23 |
Correct |
3 ms |
11100 KB |
Output is correct |
24 |
Correct |
3 ms |
11100 KB |
Output is correct |
25 |
Correct |
5 ms |
11100 KB |
Output is correct |
26 |
Correct |
3 ms |
11096 KB |
Output is correct |
27 |
Correct |
3 ms |
11188 KB |
Output is correct |
28 |
Correct |
3 ms |
11100 KB |
Output is correct |
29 |
Correct |
4 ms |
11100 KB |
Output is correct |
30 |
Correct |
4 ms |
11100 KB |
Output is correct |
31 |
Correct |
3 ms |
11100 KB |
Output is correct |
32 |
Correct |
3 ms |
11100 KB |
Output is correct |
33 |
Correct |
4 ms |
11100 KB |
Output is correct |
34 |
Correct |
3 ms |
11100 KB |
Output is correct |
35 |
Correct |
3 ms |
11100 KB |
Output is correct |
36 |
Correct |
4 ms |
11188 KB |
Output is correct |
37 |
Correct |
3 ms |
11100 KB |
Output is correct |
38 |
Correct |
3 ms |
11100 KB |
Output is correct |
39 |
Correct |
150 ms |
19872 KB |
Output is correct |
40 |
Correct |
150 ms |
19804 KB |
Output is correct |
41 |
Correct |
152 ms |
19788 KB |
Output is correct |
42 |
Correct |
141 ms |
20052 KB |
Output is correct |
43 |
Correct |
59 ms |
20264 KB |
Output is correct |
44 |
Correct |
58 ms |
19536 KB |
Output is correct |
45 |
Correct |
89 ms |
23632 KB |
Output is correct |
46 |
Correct |
67 ms |
24304 KB |
Output is correct |
47 |
Correct |
137 ms |
26960 KB |
Output is correct |
48 |
Correct |
153 ms |
34388 KB |
Output is correct |
49 |
Correct |
151 ms |
31312 KB |
Output is correct |
50 |
Correct |
144 ms |
26964 KB |
Output is correct |
51 |
Correct |
146 ms |
26960 KB |
Output is correct |
52 |
Correct |
140 ms |
26960 KB |
Output is correct |
53 |
Correct |
210 ms |
25684 KB |
Output is correct |
54 |
Correct |
108 ms |
25680 KB |
Output is correct |
55 |
Correct |
19 ms |
11868 KB |
Output is correct |
56 |
Correct |
12 ms |
11868 KB |
Output is correct |
57 |
Correct |
94 ms |
20176 KB |
Output is correct |
58 |
Correct |
36 ms |
19468 KB |
Output is correct |
59 |
Correct |
334 ms |
29944 KB |
Output is correct |
60 |
Correct |
819 ms |
47440 KB |
Output is correct |
61 |
Correct |
198 ms |
27296 KB |
Output is correct |
62 |
Correct |
227 ms |
27252 KB |
Output is correct |
63 |
Correct |
258 ms |
27380 KB |
Output is correct |
64 |
Correct |
816 ms |
33068 KB |
Output is correct |
65 |
Correct |
108 ms |
26712 KB |
Output is correct |
66 |
Correct |
481 ms |
33876 KB |
Output is correct |
67 |
Correct |
91 ms |
25992 KB |
Output is correct |
68 |
Correct |
300 ms |
30240 KB |
Output is correct |
69 |
Correct |
304 ms |
30288 KB |
Output is correct |
70 |
Correct |
278 ms |
29520 KB |
Output is correct |