제출 #604181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
604181		jhnah917	Designated Cities (JOI19_designated_cities)	C++14	0 / 100	2062 ms	20704 KiB

designated_cities

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll N, Q, P[202020], W[202020], C[202020], D[202020], R[202020], Sum, ToRoot;
vector<pair<ll,ll>> G[202020];
vector<int> L;

void DFS(int v, int b=-1){
    for(auto [i,w] : G[v]){
        if(i != b) P[i] = v, W[i] += w, DFS(i, v);
        else ToRoot += w;
    }
}

ll Solve1(int v, int b=-1){
    ll res = 0;
    for(auto [i,w] : G[v]) res += i != b ? Solve1(i, v) : w;
    return res;
}

void GetAnswer(){
    DFS(1);
    for(int i=1; i<=N; i++) R[1] = max(R[1], Solve1(i));
    for(int bit=0; bit<(1<<L.size()); bit++){
        int cnt = __builtin_popcount(bit);
        if(cnt < 2) continue;
        ll now = 0;
        for(int i=0; i<L.size(); i++) if(bit >> i & 1) for(int v=L[i]; v!=1 && !C[v]; v=P[v]) now += W[v], C[v] = 1;
        R[cnt] = max(R[cnt], now + ToRoot);
        for(int i=0; i<L.size(); i++) if(bit >> i & 1) for(int v=L[i]; v!=1 &&  C[v]; v=P[v]) C[v] = 0;
    }
    for(int i=L.size(); i<=N; i++) R[i] = Sum;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N; memset(R, -1, sizeof R);
    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);
    }
    for(int i=1; i<=N; i++) if(G[i].size() == 1) L.push_back(i);
    GetAnswer();
    cin >> Q;
    for(int i=1; i<=Q; i++){
        int t; cin >> t;
        cout << Sum - R[t] << "\n";
    }
}

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

designated_cities.cpp: In function 'void DFS(int, int)':
designated_cities.cpp:10:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   10 |     for(auto [i,w] : G[v]){
      |              ^
designated_cities.cpp: In function 'll Solve1(int, int)':
designated_cities.cpp:18:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   18 |     for(auto [i,w] : G[v]) res += i != b ? Solve1(i, v) : w;
      |              ^
designated_cities.cpp: In function 'void GetAnswer()':
designated_cities.cpp:29:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for(int i=0; i<L.size(); i++) if(bit >> i & 1) for(int v=L[i]; v!=1 && !C[v]; v=P[v]) now += W[v], C[v] = 1;
      |                      ~^~~~~~~~~
designated_cities.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         for(int i=0; i<L.size(); i++) if(bit >> i & 1) for(int v=L[i]; v!=1 &&  C[v]; v=P[v]) C[v] = 0;
      |                      ~^~~~~~~~~

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 9
• Subtask 4: 0 / 17
• Subtask 5: 0 / 17
• Subtask 6: 0 / 44