oj.uz

Submission #605163

# Submission time Handle Problem Language Result Execution time Memory
605163 2022-07-25T13:35:07 Z jhnah917 Designated Cities (JOI19_designated_cities) C++14
23 / 100
 2000 ms 18364 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll N, Q, Sum, CostTo1, C[202020], R[202020];
vector<pair<int,int>> G[202020];
int S[202020], U[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];
}

pair<ll,ll> V[202020]; int sz;
void CostFromRoot(int root){
    sz = 0;
    function<ll(int,int,int)> dfs = [&](int st, int v, int b) -> ll {
        ll mx = 0;
        for(auto [i,w] : G[v]){
            if(i == b || U[i]) continue;
            ll nxt = dfs(st, i, v) + w;
            if(nxt > mx) swap(nxt, mx);
            if(nxt > 0) V[sz++] = {nxt, st};
        }
        return mx;
    };
    for(auto [i,w] : G[root]) if(!U[i]) V[sz++] = {dfs(i, i, -1) + w, i};
}

int GetSize(int v, int b=-1){
    S[v] = 1;
    for(auto [i,w] : G[v]) if(i != b && !U[i]) S[v] += GetSize(i, v);
    return S[v];
}

int GetCent(int v, int tot, int b=-1){
    for(auto [i,w] : G[v]) if(i != b && !U[i] && S[i]*2 > tot) return GetCent(i, tot, v);
    return v;
}

void GetAnswer(int v=1){
    v = GetCent(v, GetSize(v)); U[v] = 1;
    CostFromRoot(v);
    sort(V, V+sz, greater<>());

    ll now = CostToRoot(v);
    for(int k=2; k<=N; k++){
        if(k-2 < sz) now += V[k-2].first;
        R[k] = min(R[k], Sum - now);
    }

    int mx2 = -1;
    for(int i=1; i<sz; i++) if(V[i].second != V[0].second) { mx2 = i; break; }
    if(mx2 != -1){
        now = CostToRoot(v) + V[mx2].first; sz--;
        for(int i=mx2; i<sz; i++) V[i] = V[i+1];
        for(int k=2; k<=N; k++){
            if(k-2 < sz) now += V[k-2].first;
            R[k] = min(R[k], Sum - now);
        }
    }

    for(auto [i,w] : G[v]) if(!U[i]) GetAnswer(i);
}

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);

    memset(R, 0x3f, sizeof R);
    R[1] = Sum - CostTo1 - *max_element(C+1, C+N+1);
    GetAnswer();

    cin >> Q;
    for(int i=1; i<=Q; i++){
        int t; cin >> t;
        cout << R[t] << "\n";
    }
}

Compilation message

designated_cities.cpp: In function 'void TreeDP(int, int, ll, ll)':
designated_cities.cpp:12:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   12 |     for(auto [i,w] : G[v]) if(i == b) CostTo1 += w, up += w;
      |              ^
designated_cities.cpp:14:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   14 |     for(auto [i,w] : G[v]) if(i != b) TreeDP(i, v, up, dw+w);
      |              ^
designated_cities.cpp: In lambda function:
designated_cities.cpp:26:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   26 |         for(auto [i,w] : G[v]){
      |                  ^
designated_cities.cpp: In function 'void CostFromRoot(int)':
designated_cities.cpp:34:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |     for(auto [i,w] : G[root]) if(!U[i]) V[sz++] = {dfs(i, i, -1) + w, i};
      |              ^
designated_cities.cpp: In function 'int GetSize(int, int)':
designated_cities.cpp:39:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   39 |     for(auto [i,w] : G[v]) if(i != b && !U[i]) S[v] += GetSize(i, v);
      |              ^
designated_cities.cpp: In function 'int GetCent(int, int, int)':
designated_cities.cpp:44:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |     for(auto [i,w] : G[v]) if(i != b && !U[i] && S[i]*2 > tot) return GetCent(i, tot, v);
      |              ^
designated_cities.cpp: In function 'void GetAnswer(int)':
designated_cities.cpp:70:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   70 |     for(auto [i,w] : G[v]) if(!U[i]) GetAnswer(i);
      |              ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 4 ms 6612 KB Output is correct
6 Correct 5 ms 6612 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 3 ms 6612 KB Output is correct
10 Correct 4 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6672 KB Output is correct
2 Execution timed out 2066 ms 18364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Execution timed out 2073 ms 18356 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 4 ms 6612 KB Output is correct
6 Correct 5 ms 6612 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 3 ms 6612 KB Output is correct
10 Correct 4 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 4 ms 6612 KB Output is correct
13 Correct 15 ms 6796 KB Output is correct
14 Correct 10 ms 6788 KB Output is correct
15 Correct 10 ms 6792 KB Output is correct
16 Correct 11 ms 6796 KB Output is correct
17 Correct 11 ms 6696 KB Output is correct
18 Correct 10 ms 6740 KB Output is correct
19 Correct 10 ms 6792 KB Output is correct
20 Correct 10 ms 6800 KB Output is correct
21 Correct 11 ms 6740 KB Output is correct
22 Correct 12 ms 6740 KB Output is correct
23 Correct 10 ms 6808 KB Output is correct
24 Correct 9 ms 6812 KB Output is correct
25 Correct 14 ms 6884 KB Output is correct
26 Correct 10 ms 6740 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6672 KB Output is correct
2 Execution timed out 2066 ms 18364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 4 ms 6612 KB Output is correct
6 Correct 5 ms 6612 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 3 ms 6612 KB Output is correct
10 Correct 4 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 3 ms 6672 KB Output is correct
13 Execution timed out 2066 ms 18364 KB Time limit exceeded
14 Halted 0 ms 0 KB -