제출 #604964

#제출 시각아이디문제언어결과실행 시간메모리
604964jhnah917Designated Cities (JOI19_designated_cities)C++14
7 / 100
195 ms33932 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; ll N, Q, Sum, CostTo1, C[202020]; vector<pair<ll,ll>> G[202020]; void TreeDP(int v, int b=-1, ll up=0, ll dw=0){ for(auto [i,w] : G[v]) if(i == b) CostTo1 += w, up += w; C[v] = dw - up; for(auto [i,w] : G[v]) if(i != b) TreeDP(i, v, up, dw+w); } ll CostToRoot(int root){ return CostTo1 + C[root]; } int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> N; for(int i=1; i<N; i++){ int a, b, c, d; cin >> a >> b >> c >> d; Sum += c + d; G[a].emplace_back(b, c); G[b].emplace_back(a, d); } TreeDP(1); cin >> Q; ll mx = 0; for(int i=1; i<=N; i++) mx = max(mx, CostToRoot(i)); for(int i=1; i<=Q; i++){ int t; cin >> t; cout << Sum - mx << "\n"; } }

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

designated_cities.cpp: In function 'void TreeDP(int, int, ll, ll)':
designated_cities.cpp:9:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
    9 |     for(auto [i,w] : G[v]) if(i == b) CostTo1 += w, up += w;
      |              ^
designated_cities.cpp:11:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   11 |     for(auto [i,w] : G[v]) if(i != b) TreeDP(i, v, up, dw+w);
      |              ^
#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...