oj.uz

Submission #1120000

# Submission time Handle Problem Language Result Execution time Memory
1120000 2024-11-27T16:35:26 Z yeediot Designated Cities (JOI19_designated_cities) C++17
100 / 100
 234 ms 32720 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=min(x,y)
#define chmax(x,y) x=max(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))
        f ^= !(c ^ 45), 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 < 0)
        putchar('-'), x = -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];
        }
        dp2[v]=max(dp2[v],dp2[u]);
    }
    ans[1]=min(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 4944 KB Output is correct
2 Correct 6 ms 5140 KB Output is correct
3 Correct 6 ms 5100 KB Output is correct
4 Correct 5 ms 5112 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 5 ms 4944 KB Output is correct
9 Correct 5 ms 5124 KB Output is correct
10 Correct 6 ms 4944 KB Output is correct
11 Correct 4 ms 4944 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4944 KB Output is correct
2 Correct 176 ms 22544 KB Output is correct
3 Correct 169 ms 32260 KB Output is correct
4 Correct 124 ms 22344 KB Output is correct
5 Correct 141 ms 23016 KB Output is correct
6 Correct 180 ms 24392 KB Output is correct
7 Correct 98 ms 24028 KB Output is correct
8 Correct 153 ms 32164 KB Output is correct
9 Correct 74 ms 26620 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4944 KB Output is correct
2 Correct 124 ms 22560 KB Output is correct
3 Correct 139 ms 32332 KB Output is correct
4 Correct 109 ms 22344 KB Output is correct
5 Correct 95 ms 23032 KB Output is correct
6 Correct 109 ms 24904 KB Output is correct
7 Correct 65 ms 26224 KB Output is correct
8 Correct 173 ms 30280 KB Output is correct
9 Correct 73 ms 26616 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4944 KB Output is correct
2 Correct 6 ms 5140 KB Output is correct
3 Correct 6 ms 5100 KB Output is correct
4 Correct 5 ms 5112 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 5 ms 4944 KB Output is correct
9 Correct 5 ms 5124 KB Output is correct
10 Correct 6 ms 4944 KB Output is correct
11 Correct 4 ms 4944 KB Output is correct
12 Correct 5 ms 4944 KB Output is correct
13 Correct 5 ms 5200 KB Output is correct
14 Correct 5 ms 5624 KB Output is correct
15 Correct 5 ms 5200 KB Output is correct
16 Correct 6 ms 5328 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 4 ms 5200 KB Output is correct
21 Correct 4 ms 5200 KB Output is correct
22 Correct 5 ms 5200 KB Output is correct
23 Correct 5 ms 5200 KB Output is correct
24 Correct 5 ms 5456 KB Output is correct
25 Correct 5 ms 5468 KB Output is correct
26 Correct 6 ms 5456 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4944 KB Output is correct
2 Correct 176 ms 22544 KB Output is correct
3 Correct 169 ms 32260 KB Output is correct
4 Correct 124 ms 22344 KB Output is correct
5 Correct 141 ms 23016 KB Output is correct
6 Correct 180 ms 24392 KB Output is correct
7 Correct 98 ms 24028 KB Output is correct
8 Correct 153 ms 32164 KB Output is correct
9 Correct 74 ms 26620 KB Output is correct
10 Correct 5 ms 4944 KB Output is correct
11 Correct 124 ms 22560 KB Output is correct
12 Correct 139 ms 32332 KB Output is correct
13 Correct 109 ms 22344 KB Output is correct
14 Correct 95 ms 23032 KB Output is correct
15 Correct 109 ms 24904 KB Output is correct
16 Correct 65 ms 26224 KB Output is correct
17 Correct 173 ms 30280 KB Output is correct
18 Correct 73 ms 26616 KB Output is correct
19 Correct 4 ms 4944 KB Output is correct
20 Correct 117 ms 22348 KB Output is correct
21 Correct 234 ms 32200 KB Output is correct
22 Correct 140 ms 22344 KB Output is correct
23 Correct 155 ms 22600 KB Output is correct
24 Correct 137 ms 22512 KB Output is correct
25 Correct 156 ms 22312 KB Output is correct
26 Correct 176 ms 22604 KB Output is correct
27 Correct 154 ms 22664 KB Output is correct
28 Correct 190 ms 24524 KB Output is correct
29 Correct 162 ms 22148 KB Output is correct
30 Correct 126 ms 23276 KB Output is correct
31 Correct 112 ms 24316 KB Output is correct
32 Correct 204 ms 30716 KB Output is correct
33 Correct 87 ms 26744 KB Output is correct

Subtask #6
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4944 KB Output is correct
2 Correct 6 ms 5140 KB Output is correct
3 Correct 6 ms 5100 KB Output is correct
4 Correct 5 ms 5112 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 5 ms 4944 KB Output is correct
9 Correct 5 ms 5124 KB Output is correct
10 Correct 6 ms 4944 KB Output is correct
11 Correct 4 ms 4944 KB Output is correct
12 Correct 5 ms 4944 KB Output is correct
13 Correct 176 ms 22544 KB Output is correct
14 Correct 169 ms 32260 KB Output is correct
15 Correct 124 ms 22344 KB Output is correct
16 Correct 141 ms 23016 KB Output is correct
17 Correct 180 ms 24392 KB Output is correct
18 Correct 98 ms 24028 KB Output is correct
19 Correct 153 ms 32164 KB Output is correct
20 Correct 74 ms 26620 KB Output is correct
21 Correct 5 ms 4944 KB Output is correct
22 Correct 124 ms 22560 KB Output is correct
23 Correct 139 ms 32332 KB Output is correct
24 Correct 109 ms 22344 KB Output is correct
25 Correct 95 ms 23032 KB Output is correct
26 Correct 109 ms 24904 KB Output is correct
27 Correct 65 ms 26224 KB Output is correct
28 Correct 173 ms 30280 KB Output is correct
29 Correct 73 ms 26616 KB Output is correct
30 Correct 5 ms 4944 KB Output is correct
31 Correct 5 ms 5200 KB Output is correct
32 Correct 5 ms 5624 KB Output is correct
33 Correct 5 ms 5200 KB Output is correct
34 Correct 6 ms 5328 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 4 ms 5200 KB Output is correct
39 Correct 4 ms 5200 KB Output is correct
40 Correct 5 ms 5200 KB Output is correct
41 Correct 5 ms 5200 KB Output is correct
42 Correct 5 ms 5456 KB Output is correct
43 Correct 5 ms 5468 KB Output is correct
44 Correct 6 ms 5456 KB Output is correct
45 Correct 4 ms 4944 KB Output is correct
46 Correct 117 ms 22348 KB Output is correct
47 Correct 234 ms 32200 KB Output is correct
48 Correct 140 ms 22344 KB Output is correct
49 Correct 155 ms 22600 KB Output is correct
50 Correct 137 ms 22512 KB Output is correct
51 Correct 156 ms 22312 KB Output is correct
52 Correct 176 ms 22604 KB Output is correct
53 Correct 154 ms 22664 KB Output is correct
54 Correct 190 ms 24524 KB Output is correct
55 Correct 162 ms 22148 KB Output is correct
56 Correct 126 ms 23276 KB Output is correct
57 Correct 112 ms 24316 KB Output is correct
58 Correct 204 ms 30716 KB Output is correct
59 Correct 87 ms 26744 KB Output is correct
60 Correct 6 ms 4944 KB Output is correct
61 Correct 211 ms 23764 KB Output is correct
62 Correct 199 ms 32720 KB Output is correct
63 Correct 167 ms 23880 KB Output is correct
64 Correct 192 ms 23760 KB Output is correct
65 Correct 173 ms 23664 KB Output is correct
66 Correct 146 ms 23880 KB Output is correct
67 Correct 140 ms 23624 KB Output is correct
68 Correct 151 ms 24240 KB Output is correct
69 Correct 181 ms 25780 KB Output is correct
70 Correct 137 ms 23324 KB Output is correct
71 Correct 152 ms 24788 KB Output is correct
72 Correct 141 ms 26004 KB Output is correct
73 Correct 203 ms 31560 KB Output is correct
74 Correct 103 ms 29668 KB Output is correct