Submission #1120003

# Submission time Handle Problem Language Result Execution time Memory
1120003 2024-11-27T16:37:27 Z yeediot Designated Cities (JOI19_designated_cities) C++17
100 / 100
287 ms 34952 KB
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=x<y?x:y
#define chmax(x,y) x=x>y?x:y
const int mxn=2e5+5;
inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
inline void rd() {}
template <typename T, typename... U>
inline void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}
template <typename T>
inline void prt(T x)
{
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}
vector<tuple<int,int,int>>adj[mxn];
ll dp[mxn][2], dep[mxn];
pair<ll,int> dp2[mxn];
int p1;
inline void dfs(int v,int pa){
    for(auto [u,d,d2]:adj[v]){
        if(u==pa)continue;
        dp[u][0]+=dp[v][0]+d;
        dep[u]=dep[v]+d;
        dfs(u,v);
        dp[v][1]+=d2+dp[u][1];
    }
}
ll all,ans[mxn];
inline void calc(int v,int pa){
    ll mx=0;
    dp2[v].F=dep[v];
    dp2[v].S=v;
    int t1=0;
    for(auto [u,d,d2]:adj[v]){
        if(u==pa)continue;
        dp[u][1]+=dp[v][1]-dp[u][1]-d2;
        calc(u,v);
        if(dp2[v].F+dp2[u].F-2*dep[v]>mx){
            t1=dp2[v].S;
            mx=dp2[v].F+dp2[u].F-2*dep[v];
        }
        chmax(dp2[v],dp2[u]);
    }
    chmin(ans[1],all-dp[v][0]-dp[v][1]);
    if(ans[2]>all-dp[v][0]-dp[v][1]-mx){
        p1=t1;
        ans[2]=all-dp[v][0]-dp[v][1]-mx;
    }
}
ll len[mxn];
int idx;
inline ll dfs2(int v,int pa){
    vector<ll>temp;
    for(auto [u,d,d2]:adj[v]){
        if(u==pa)continue;
        temp.pb(dfs2(u,v)+d);
    }
    if(sz(temp)==0)return 0;
    auto it=max_element(temp.begin(),temp.end());
    for(auto it2=temp.begin();it2!=temp.end();it2++){
        if(it2==it)continue;
        len[idx++]=*it2;
    }
    return *it;
}
signed main(){
    int n,q;
    rd(n);
    ans[1] = ans[2]=1e18;
    for(int i=1;i<n;i++){
        int a,b,c,d;
        rd(a),rd(b),rd(c),rd(d);
        adj[a].pb({b,c,d});
        adj[b].pb({a,d,c});
        all+=c+d;
    }
    dfs(1,1);
    calc(1,1);
    ll v=dfs2(p1,p1);
    len[idx++]=v;
    sort(len,len+idx,greater<ll>());
    for(int i=1;i<idx;i++){
        ans[2+i]=ans[1+i]-len[i];
    }
    rd(q);
    while(q--){
        int x;
        rd(x);
        prt(ans[x]);
        putchar('\n');
    }
}
 /*
 input:
 
 */
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 5 ms 4944 KB Output is correct
3 Correct 4 ms 4944 KB Output is correct
4 Correct 7 ms 4944 KB Output is correct
5 Correct 5 ms 4960 KB Output is correct
6 Correct 6 ms 4944 KB Output is correct
7 Correct 4 ms 4944 KB Output is correct
8 Correct 6 ms 4944 KB Output is correct
9 Correct 7 ms 4944 KB Output is correct
10 Correct 4 ms 4944 KB Output is correct
11 Correct 4 ms 4944 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 4964 KB Output is correct
2 Correct 189 ms 22336 KB Output is correct
3 Correct 255 ms 32256 KB Output is correct
4 Correct 232 ms 22492 KB Output is correct
5 Correct 209 ms 23928 KB Output is correct
6 Correct 216 ms 24280 KB Output is correct
7 Correct 164 ms 23892 KB Output is correct
8 Correct 226 ms 33480 KB Output is correct
9 Correct 97 ms 26792 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 4944 KB Output is correct
2 Correct 215 ms 23636 KB Output is correct
3 Correct 240 ms 33220 KB Output is correct
4 Correct 211 ms 23772 KB Output is correct
5 Correct 206 ms 23052 KB Output is correct
6 Correct 190 ms 24844 KB Output is correct
7 Correct 99 ms 26280 KB Output is correct
8 Correct 237 ms 32028 KB Output is correct
9 Correct 104 ms 26700 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 5 ms 4944 KB Output is correct
3 Correct 4 ms 4944 KB Output is correct
4 Correct 7 ms 4944 KB Output is correct
5 Correct 5 ms 4960 KB Output is correct
6 Correct 6 ms 4944 KB Output is correct
7 Correct 4 ms 4944 KB Output is correct
8 Correct 6 ms 4944 KB Output is correct
9 Correct 7 ms 4944 KB Output is correct
10 Correct 4 ms 4944 KB Output is correct
11 Correct 4 ms 4944 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 7 ms 5364 KB Output is correct
14 Correct 6 ms 5456 KB Output is correct
15 Correct 5 ms 5172 KB Output is correct
16 Correct 7 ms 5204 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 5 ms 5204 KB Output is correct
19 Correct 6 ms 5212 KB Output is correct
20 Correct 5 ms 5204 KB Output is correct
21 Correct 7 ms 5468 KB Output is correct
22 Correct 6 ms 5312 KB Output is correct
23 Correct 6 ms 5200 KB Output is correct
24 Correct 6 ms 5456 KB Output is correct
25 Correct 8 ms 5456 KB Output is correct
26 Correct 5 ms 5456 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 4964 KB Output is correct
2 Correct 189 ms 22336 KB Output is correct
3 Correct 255 ms 32256 KB Output is correct
4 Correct 232 ms 22492 KB Output is correct
5 Correct 209 ms 23928 KB Output is correct
6 Correct 216 ms 24280 KB Output is correct
7 Correct 164 ms 23892 KB Output is correct
8 Correct 226 ms 33480 KB Output is correct
9 Correct 97 ms 26792 KB Output is correct
10 Correct 5 ms 4944 KB Output is correct
11 Correct 215 ms 23636 KB Output is correct
12 Correct 240 ms 33220 KB Output is correct
13 Correct 211 ms 23772 KB Output is correct
14 Correct 206 ms 23052 KB Output is correct
15 Correct 190 ms 24844 KB Output is correct
16 Correct 99 ms 26280 KB Output is correct
17 Correct 237 ms 32028 KB Output is correct
18 Correct 104 ms 26700 KB Output is correct
19 Correct 6 ms 4944 KB Output is correct
20 Correct 220 ms 22472 KB Output is correct
21 Correct 279 ms 32532 KB Output is correct
22 Correct 195 ms 22500 KB Output is correct
23 Correct 196 ms 22600 KB Output is correct
24 Correct 186 ms 24288 KB Output is correct
25 Correct 168 ms 22500 KB Output is correct
26 Correct 160 ms 22480 KB Output is correct
27 Correct 176 ms 22672 KB Output is correct
28 Correct 200 ms 24672 KB Output is correct
29 Correct 152 ms 22236 KB Output is correct
30 Correct 145 ms 23372 KB Output is correct
31 Correct 128 ms 24340 KB Output is correct
32 Correct 261 ms 30668 KB Output is correct
33 Correct 107 ms 28224 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 5 ms 4944 KB Output is correct
3 Correct 4 ms 4944 KB Output is correct
4 Correct 7 ms 4944 KB Output is correct
5 Correct 5 ms 4960 KB Output is correct
6 Correct 6 ms 4944 KB Output is correct
7 Correct 4 ms 4944 KB Output is correct
8 Correct 6 ms 4944 KB Output is correct
9 Correct 7 ms 4944 KB Output is correct
10 Correct 4 ms 4944 KB Output is correct
11 Correct 4 ms 4944 KB Output is correct
12 Correct 5 ms 4964 KB Output is correct
13 Correct 189 ms 22336 KB Output is correct
14 Correct 255 ms 32256 KB Output is correct
15 Correct 232 ms 22492 KB Output is correct
16 Correct 209 ms 23928 KB Output is correct
17 Correct 216 ms 24280 KB Output is correct
18 Correct 164 ms 23892 KB Output is correct
19 Correct 226 ms 33480 KB Output is correct
20 Correct 97 ms 26792 KB Output is correct
21 Correct 5 ms 4944 KB Output is correct
22 Correct 215 ms 23636 KB Output is correct
23 Correct 240 ms 33220 KB Output is correct
24 Correct 211 ms 23772 KB Output is correct
25 Correct 206 ms 23052 KB Output is correct
26 Correct 190 ms 24844 KB Output is correct
27 Correct 99 ms 26280 KB Output is correct
28 Correct 237 ms 32028 KB Output is correct
29 Correct 104 ms 26700 KB Output is correct
30 Correct 6 ms 5120 KB Output is correct
31 Correct 7 ms 5364 KB Output is correct
32 Correct 6 ms 5456 KB Output is correct
33 Correct 5 ms 5172 KB Output is correct
34 Correct 7 ms 5204 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 5 ms 5204 KB Output is correct
37 Correct 6 ms 5212 KB Output is correct
38 Correct 5 ms 5204 KB Output is correct
39 Correct 7 ms 5468 KB Output is correct
40 Correct 6 ms 5312 KB Output is correct
41 Correct 6 ms 5200 KB Output is correct
42 Correct 6 ms 5456 KB Output is correct
43 Correct 8 ms 5456 KB Output is correct
44 Correct 5 ms 5456 KB Output is correct
45 Correct 6 ms 4944 KB Output is correct
46 Correct 220 ms 22472 KB Output is correct
47 Correct 279 ms 32532 KB Output is correct
48 Correct 195 ms 22500 KB Output is correct
49 Correct 196 ms 22600 KB Output is correct
50 Correct 186 ms 24288 KB Output is correct
51 Correct 168 ms 22500 KB Output is correct
52 Correct 160 ms 22480 KB Output is correct
53 Correct 176 ms 22672 KB Output is correct
54 Correct 200 ms 24672 KB Output is correct
55 Correct 152 ms 22236 KB Output is correct
56 Correct 145 ms 23372 KB Output is correct
57 Correct 128 ms 24340 KB Output is correct
58 Correct 261 ms 30668 KB Output is correct
59 Correct 107 ms 28224 KB Output is correct
60 Correct 8 ms 4944 KB Output is correct
61 Correct 223 ms 23972 KB Output is correct
62 Correct 262 ms 34952 KB Output is correct
63 Correct 222 ms 23852 KB Output is correct
64 Correct 226 ms 25788 KB Output is correct
65 Correct 206 ms 23556 KB Output is correct
66 Correct 221 ms 26204 KB Output is correct
67 Correct 214 ms 25956 KB Output is correct
68 Correct 216 ms 24148 KB Output is correct
69 Correct 231 ms 25836 KB Output is correct
70 Correct 241 ms 23232 KB Output is correct
71 Correct 228 ms 25820 KB Output is correct
72 Correct 200 ms 26040 KB Output is correct
73 Correct 287 ms 33572 KB Output is correct
74 Correct 122 ms 29552 KB Output is correct