제출 #728866

#제출 시각아이디문제언어결과실행 시간메모리
728866Rasoul006꿈 (IOI13_dreaming)C++17
0 / 100
48 ms15220 KiB
#include "dreaming.h" #include <bits/stdc++.h> #define endl "\n" #define F first #define S second #define pb push_back #define all(x) x.begin() , x.end() typedef long long ll; using namespace std; const int N = 1e5+5; const long long oo = 1e18 ; vector <pair <ll,ll>> v[N] ; vector <ll> vec ; ll n , m , ans , best , mx , dis[N] , len , bans ; bool vis[N] ; pair <ll,ll> dfs (ll u , ll p) { vis[u] = true ; pair <ll,ll> ret = {0 , u} ; for (auto it : v[u]) { if (it.F == p) continue ; pair <ll,ll> p = dfs(it.F , u) ; p.F += it.S ; ret = max(ret , p) ; } best = min(best , max(len - ret.F , ret.F) ) ; return ret ; } ll get (ll p) { ll p1 , p2 ; p1 = dfs(p , p).S ; p2 = dfs(p1 , p1).S ; len = dfs(p1 , p1).F ; bans = max(bans , len); best = oo ; dfs(p1 , p1) ; return best ; } int travelTime(int N, int M, int L, int A[], int B[], int T[]) { n = N ; m = M ; for (int i = 0 ; i<m ; i++) { v[B[i]].pb({A[i] , T[i]}); v[A[i]].pb({B[i] , T[i]}); } for (int i = 0 ; i<n ; i++) { if (!vis[i]) { vec.pb(get(i)) ; break ; } } while (vec.size() < 3) vec.pb(-oo) ; sort (all(vec)); reverse(all(vec)); return max({bans , vec[0] + vec[1] + L , vec[1] + vec[2] + L + L}) ; }

컴파일 시 표준 에러 (stderr) 메시지

dreaming.cpp: In function 'll get(ll)':
dreaming.cpp:56:13: warning: variable 'p2' set but not used [-Wunused-but-set-variable]
   56 |     ll p1 , p2 ;
      |             ^~
#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...