oj.uz

Submission #1120004

# Submission time Handle Problem Language Result Execution time Memory
1120004 2024-11-27T16:37:45 Z yeediot Designated Cities (JOI19_designated_cities) C++17
100 / 100
 286 ms 33032 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<array<int,3>>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:
 
 */

Subtask #1
6.0 / 6.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 193 ms 22512 KB Output is correct
3 Correct 221 ms 33032 KB Output is correct
4 Correct 197 ms 22484 KB Output is correct
5 Correct 230 ms 25204 KB Output is correct
6 Correct 225 ms 24320 KB Output is correct
7 Correct 182 ms 23904 KB Output is correct
8 Correct 228 ms 32164 KB Output is correct
9 Correct 110 ms 26792 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4940 KB Output is correct
2 Correct 215 ms 22500 KB Output is correct
3 Correct 248 ms 32316 KB Output is correct
4 Correct 204 ms 22548 KB Output is correct
5 Correct 197 ms 22928 KB Output is correct
6 Correct 208 ms 24924 KB Output is correct
7 Correct 113 ms 26264 KB Output is correct
8 Correct 261 ms 30280 KB Output is correct
9 Correct 99 ms 26728 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5120 KB Output is correct
2 Correct 5 ms 5148 KB Output is correct
3 Correct 5 ms 4944 KB Output is correct
4 Correct 6 ms 5068 KB Output is correct
5 Correct 5 ms 4944 KB Output is correct
6 Correct 5 ms 4944 KB Output is correct
7 Correct 5 ms 4944 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 5 ms 4944 KB Output is correct
10 Correct 6 ms 4944 KB Output is correct
11 Correct 6 ms 4944 KB Output is correct
12 Correct 5 ms 4952 KB Output is correct
13 Correct 5 ms 5200 KB Output is correct
14 Correct 6 ms 5388 KB Output is correct
15 Correct 5 ms 5236 KB Output is correct
16 Correct 6 ms 5200 KB Output is correct
17 Correct 6 ms 5200 KB Output is correct
18 Correct 6 ms 5200 KB Output is correct
19 Correct 5 ms 5200 KB Output is correct
20 Correct 5 ms 5368 KB Output is correct
21 Correct 5 ms 5200 KB Output is correct
22 Correct 9 ms 5348 KB Output is correct
23 Correct 5 ms 5200 KB Output is correct
24 Correct 5 ms 5456 KB Output is correct
25 Correct 9 ms 5456 KB Output is correct
26 Correct 7 ms 5456 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 193 ms 22512 KB Output is correct
3 Correct 221 ms 33032 KB Output is correct
4 Correct 197 ms 22484 KB Output is correct
5 Correct 230 ms 25204 KB Output is correct
6 Correct 225 ms 24320 KB Output is correct
7 Correct 182 ms 23904 KB Output is correct
8 Correct 228 ms 32164 KB Output is correct
9 Correct 110 ms 26792 KB Output is correct
10 Correct 5 ms 4940 KB Output is correct
11 Correct 215 ms 22500 KB Output is correct
12 Correct 248 ms 32316 KB Output is correct
13 Correct 204 ms 22548 KB Output is correct
14 Correct 197 ms 22928 KB Output is correct
15 Correct 208 ms 24924 KB Output is correct
16 Correct 113 ms 26264 KB Output is correct
17 Correct 261 ms 30280 KB Output is correct
18 Correct 99 ms 26728 KB Output is correct
19 Correct 6 ms 4944 KB Output is correct
20 Correct 169 ms 22552 KB Output is correct
21 Correct 234 ms 32280 KB Output is correct
22 Correct 176 ms 22464 KB Output is correct
23 Correct 202 ms 22496 KB Output is correct
24 Correct 210 ms 22384 KB Output is correct
25 Correct 191 ms 22500 KB Output is correct
26 Correct 212 ms 22460 KB Output is correct
27 Correct 178 ms 22792 KB Output is correct
28 Correct 210 ms 24452 KB Output is correct
29 Correct 222 ms 22060 KB Output is correct
30 Correct 237 ms 23276 KB Output is correct
31 Correct 175 ms 24316 KB Output is correct
32 Correct 236 ms 30696 KB Output is correct
33 Correct 103 ms 26776 KB Output is correct

Subtask #6
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5120 KB Output is correct
2 Correct 5 ms 5148 KB Output is correct
3 Correct 5 ms 4944 KB Output is correct
4 Correct 6 ms 5068 KB Output is correct
5 Correct 5 ms 4944 KB Output is correct
6 Correct 5 ms 4944 KB Output is correct
7 Correct 5 ms 4944 KB Output is correct
8 Correct 4 ms 5120 KB Output is correct
9 Correct 5 ms 4944 KB Output is correct
10 Correct 6 ms 4944 KB Output is correct
11 Correct 6 ms 4944 KB Output is correct
12 Correct 4 ms 4944 KB Output is correct
13 Correct 193 ms 22512 KB Output is correct
14 Correct 221 ms 33032 KB Output is correct
15 Correct 197 ms 22484 KB Output is correct
16 Correct 230 ms 25204 KB Output is correct
17 Correct 225 ms 24320 KB Output is correct
18 Correct 182 ms 23904 KB Output is correct
19 Correct 228 ms 32164 KB Output is correct
20 Correct 110 ms 26792 KB Output is correct
21 Correct 5 ms 4940 KB Output is correct
22 Correct 215 ms 22500 KB Output is correct
23 Correct 248 ms 32316 KB Output is correct
24 Correct 204 ms 22548 KB Output is correct
25 Correct 197 ms 22928 KB Output is correct
26 Correct 208 ms 24924 KB Output is correct
27 Correct 113 ms 26264 KB Output is correct
28 Correct 261 ms 30280 KB Output is correct
29 Correct 99 ms 26728 KB Output is correct
30 Correct 5 ms 4952 KB Output is correct
31 Correct 5 ms 5200 KB Output is correct
32 Correct 6 ms 5388 KB Output is correct
33 Correct 5 ms 5236 KB Output is correct
34 Correct 6 ms 5200 KB Output is correct
35 Correct 6 ms 5200 KB Output is correct
36 Correct 6 ms 5200 KB Output is correct
37 Correct 5 ms 5200 KB Output is correct
38 Correct 5 ms 5368 KB Output is correct
39 Correct 5 ms 5200 KB Output is correct
40 Correct 9 ms 5348 KB Output is correct
41 Correct 5 ms 5200 KB Output is correct
42 Correct 5 ms 5456 KB Output is correct
43 Correct 9 ms 5456 KB Output is correct
44 Correct 7 ms 5456 KB Output is correct
45 Correct 6 ms 4944 KB Output is correct
46 Correct 169 ms 22552 KB Output is correct
47 Correct 234 ms 32280 KB Output is correct
48 Correct 176 ms 22464 KB Output is correct
49 Correct 202 ms 22496 KB Output is correct
50 Correct 210 ms 22384 KB Output is correct
51 Correct 191 ms 22500 KB Output is correct
52 Correct 212 ms 22460 KB Output is correct
53 Correct 178 ms 22792 KB Output is correct
54 Correct 210 ms 24452 KB Output is correct
55 Correct 222 ms 22060 KB Output is correct
56 Correct 237 ms 23276 KB Output is correct
57 Correct 175 ms 24316 KB Output is correct
58 Correct 236 ms 30696 KB Output is correct
59 Correct 103 ms 26776 KB Output is correct
60 Correct 6 ms 4944 KB Output is correct
61 Correct 249 ms 23880 KB Output is correct
62 Correct 286 ms 32584 KB Output is correct
63 Correct 251 ms 23828 KB Output is correct
64 Correct 215 ms 23856 KB Output is correct
65 Correct 192 ms 23624 KB Output is correct
66 Correct 162 ms 23840 KB Output is correct
67 Correct 163 ms 23616 KB Output is correct
68 Correct 168 ms 24244 KB Output is correct
69 Correct 195 ms 25928 KB Output is correct
70 Correct 158 ms 23368 KB Output is correct
71 Correct 154 ms 24788 KB Output is correct
72 Correct 125 ms 26088 KB Output is correct
73 Correct 206 ms 31640 KB Output is correct
74 Correct 120 ms 29684 KB Output is correct