Submission #417481

#TimeUsernameProblemLanguageResultExecution timeMemory
417481iulia13Dreaming (IOI13_dreaming)C++14
18 / 100
57 ms13544 KiB
#include <bits/stdc++.h> #include "dreaming.h" using namespace std; const int N = 1e5 + 5; struct ura{ int x, c; }; vector <ura> g[N]; int maxi = 2e9, dp[N], dp2[N], dp_up[N]; int lover[N]; int viz[N]; vector <int> A; void dfs(int nod, int dad = -1) { viz[nod] = 1; for (auto son : g[nod]) { if (son.x == dad) continue; dfs(son.x, nod); if (dp[nod] < dp[son.x] + son.c) { dp2[nod] = dp[nod]; dp[nod] = dp[son.x] + son.c; } else dp2[nod] = max(dp2[nod], dp[son.x] + son.c); } } void dfs2(int nod, int dad = -1) { for (auto son : g[nod]) { if (son.x == dad) continue; int c = dp[nod]; if (c == dp[son.x] + son.c) c = dp2[nod]; dp_up[son.x] = max(dp_up[nod], c) + son.c; dfs2(son.x, nod); } lover[nod] = max(dp_up[nod], dp[nod]); maxi = min(lover[nod], maxi); } int travelTime(int n, int m, int l, int a[], int b[], int t[]) { int i, j; for (i = 0; i < m; i++) { g[a[i]].push_back({b[i], t[i]}); g[b[i]].push_back({a[i], t[i]}); } for (i = 0; i < n; i++) { if (viz[i]) continue; maxi = 2e9; dfs(i); dfs2(i); A.push_back(maxi); } if (A.size() == 1) return A[0]; sort(A.begin(), A.end()); reverse(A.begin(), A.end()); int c = A[0] + A[1] + l; if (A.size() == 2) return c; else return max(c, A[1] + A[2] + 2 * l); }/* int a[N]; int b[N]; int t[N]; int main() { int n, m, l, i; cin >> n >> m >> l; for (i = 0; i < m; i++) cin >> a[i] >> b[i] >> t[i]; cout << travelTime(n, m, l, a, b, t); return 0; }*/

Compilation message (stderr)

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:47:12: warning: unused variable 'j' [-Wunused-variable]
   47 |     int i, j;
      |            ^
#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...