Submission #105421

#TimeUsernameProblemLanguageResultExecution timeMemory
105421turbatDreaming (IOI13_dreaming)C++14
0 / 100
60 ms11640 KiB
#include "dreaming.h" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; using pii = pair<int, int>; using vi = vector <int>; #define F first #define S second #define mp make_pair #define pb push_back #define lb lower_bound #define ub upper_bound #define ll long long #define ook order_of_key #define fbo find_by_order #define sq(x) (x) * (x) #define N 100005 vector <pii> edg[N]; multiset <ll> se; ll dist, dp[N]; int vis[N]; void dfs(int u, ll mx){ vis[u] = 1; for (pii v : edg[u]) if (!vis[v.F]){ dfs(v.F, max(mx, dp[u]) + v.S); dp[u] = max(dp[u], dp[v.F] + v.S); } dist = min(dist, max(dp[u], mx)); dp[u] = 0; } void dfs1(int u, ll mx){ vis[u] = 2; for (int i = edg[u].size() - 1;i >= 0;i--){ pii v = edg[u][i]; if (vis[v.F] < 2){ dfs1(v.F, max(mx, dp[u]) + v.S); dp[u] = max(dp[u], dp[v.F] + v.S); } } dist = min(dist, max(dp[u], mx)); } int travelTime(int n, int m, int L, int A[], int B[], int T[]) { for (int i = 0;i < m;i++){ edg[A[i]].pb(mp(B[i], T[i])); edg[B[i]].pb(mp(A[i], T[i])); } for (int i = 0;i < n;i++) if (!vis[i]){ dist = 1e12; dfs(i, 0); dfs1(i, 0); se.insert(dist); } while (se.size() > 1){ dist = L; dist += *se.begin(); se.erase(se.begin()); dist += *se.begin(); se.erase(se.begin()); se.insert(dist); } return *se.begin(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...