oj.uz

Submission #1120001

# Submission time Handle Problem Language Result Execution time Memory
1120001 2024-11-27T16:36:40 Z yeediot Designated Cities (JOI19_designated_cities) C++17
100 / 100
 224 ms 33164 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))
        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];
        }
        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 4944 KB Output is correct
2 Correct 5 ms 4944 KB Output is correct
3 Correct 5 ms 4944 KB Output is correct
4 Correct 5 ms 4944 KB Output is correct
5 Correct 5 ms 4944 KB Output is correct
6 Correct 5 ms 4944 KB Output is correct
7 Correct 6 ms 4944 KB Output is correct
8 Correct 5 ms 4944 KB Output is correct
9 Correct 4 ms 4944 KB Output is correct
10 Correct 4 ms 4944 KB Output is correct
11 Correct 6 ms 4964 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 165 ms 22332 KB Output is correct
3 Correct 201 ms 32328 KB Output is correct
4 Correct 167 ms 22292 KB Output is correct
5 Correct 181 ms 23012 KB Output is correct
6 Correct 140 ms 24408 KB Output is correct
7 Correct 110 ms 23912 KB Output is correct
8 Correct 224 ms 33164 KB Output is correct
9 Correct 94 ms 26624 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 154 ms 23492 KB Output is correct
3 Correct 176 ms 32116 KB Output is correct
4 Correct 164 ms 22532 KB Output is correct
5 Correct 153 ms 22864 KB Output is correct
6 Correct 167 ms 24876 KB Output is correct
7 Correct 87 ms 26300 KB Output is correct
8 Correct 221 ms 30372 KB Output is correct
9 Correct 104 ms 26728 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 5 ms 4944 KB Output is correct
3 Correct 5 ms 4944 KB Output is correct
4 Correct 5 ms 4944 KB Output is correct
5 Correct 5 ms 4944 KB Output is correct
6 Correct 5 ms 4944 KB Output is correct
7 Correct 6 ms 4944 KB Output is correct
8 Correct 5 ms 4944 KB Output is correct
9 Correct 4 ms 4944 KB Output is correct
10 Correct 4 ms 4944 KB Output is correct
11 Correct 6 ms 4964 KB Output is correct
12 Correct 6 ms 4956 KB Output is correct
13 Correct 6 ms 5200 KB Output is correct
14 Correct 6 ms 5388 KB Output is correct
15 Correct 6 ms 5368 KB Output is correct
16 Correct 5 ms 5200 KB Output is correct
17 Correct 5 ms 5200 KB Output is correct
18 Correct 6 ms 5272 KB Output is correct
19 Correct 7 ms 5200 KB Output is correct
20 Correct 6 ms 5200 KB Output is correct
21 Correct 6 ms 5200 KB Output is correct
22 Correct 5 ms 5200 KB Output is correct
23 Correct 6 ms 5200 KB Output is correct
24 Correct 7 ms 5456 KB Output is correct
25 Correct 6 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 5 ms 4944 KB Output is correct
2 Correct 165 ms 22332 KB Output is correct
3 Correct 201 ms 32328 KB Output is correct
4 Correct 167 ms 22292 KB Output is correct
5 Correct 181 ms 23012 KB Output is correct
6 Correct 140 ms 24408 KB Output is correct
7 Correct 110 ms 23912 KB Output is correct
8 Correct 224 ms 33164 KB Output is correct
9 Correct 94 ms 26624 KB Output is correct
10 Correct 5 ms 4944 KB Output is correct
11 Correct 154 ms 23492 KB Output is correct
12 Correct 176 ms 32116 KB Output is correct
13 Correct 164 ms 22532 KB Output is correct
14 Correct 153 ms 22864 KB Output is correct
15 Correct 167 ms 24876 KB Output is correct
16 Correct 87 ms 26300 KB Output is correct
17 Correct 221 ms 30372 KB Output is correct
18 Correct 104 ms 26728 KB Output is correct
19 Correct 5 ms 4944 KB Output is correct
20 Correct 182 ms 22488 KB Output is correct
21 Correct 218 ms 32244 KB Output is correct
22 Correct 159 ms 22368 KB Output is correct
23 Correct 185 ms 22596 KB Output is correct
24 Correct 154 ms 22344 KB Output is correct
25 Correct 143 ms 22344 KB Output is correct
26 Correct 179 ms 22600 KB Output is correct
27 Correct 146 ms 22664 KB Output is correct
28 Correct 166 ms 24620 KB Output is correct
29 Correct 184 ms 22124 KB Output is correct
30 Correct 133 ms 23276 KB Output is correct
31 Correct 118 ms 24220 KB Output is correct
32 Correct 172 ms 30520 KB Output is correct
33 Correct 74 ms 26616 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 5 ms 4944 KB Output is correct
3 Correct 5 ms 4944 KB Output is correct
4 Correct 5 ms 4944 KB Output is correct
5 Correct 5 ms 4944 KB Output is correct
6 Correct 5 ms 4944 KB Output is correct
7 Correct 6 ms 4944 KB Output is correct
8 Correct 5 ms 4944 KB Output is correct
9 Correct 4 ms 4944 KB Output is correct
10 Correct 4 ms 4944 KB Output is correct
11 Correct 6 ms 4964 KB Output is correct
12 Correct 5 ms 4944 KB Output is correct
13 Correct 165 ms 22332 KB Output is correct
14 Correct 201 ms 32328 KB Output is correct
15 Correct 167 ms 22292 KB Output is correct
16 Correct 181 ms 23012 KB Output is correct
17 Correct 140 ms 24408 KB Output is correct
18 Correct 110 ms 23912 KB Output is correct
19 Correct 224 ms 33164 KB Output is correct
20 Correct 94 ms 26624 KB Output is correct
21 Correct 5 ms 4944 KB Output is correct
22 Correct 154 ms 23492 KB Output is correct
23 Correct 176 ms 32116 KB Output is correct
24 Correct 164 ms 22532 KB Output is correct
25 Correct 153 ms 22864 KB Output is correct
26 Correct 167 ms 24876 KB Output is correct
27 Correct 87 ms 26300 KB Output is correct
28 Correct 221 ms 30372 KB Output is correct
29 Correct 104 ms 26728 KB Output is correct
30 Correct 6 ms 4956 KB Output is correct
31 Correct 6 ms 5200 KB Output is correct
32 Correct 6 ms 5388 KB Output is correct
33 Correct 6 ms 5368 KB Output is correct
34 Correct 5 ms 5200 KB Output is correct
35 Correct 5 ms 5200 KB Output is correct
36 Correct 6 ms 5272 KB Output is correct
37 Correct 7 ms 5200 KB Output is correct
38 Correct 6 ms 5200 KB Output is correct
39 Correct 6 ms 5200 KB Output is correct
40 Correct 5 ms 5200 KB Output is correct
41 Correct 6 ms 5200 KB Output is correct
42 Correct 7 ms 5456 KB Output is correct
43 Correct 6 ms 5456 KB Output is correct
44 Correct 7 ms 5456 KB Output is correct
45 Correct 5 ms 4944 KB Output is correct
46 Correct 182 ms 22488 KB Output is correct
47 Correct 218 ms 32244 KB Output is correct
48 Correct 159 ms 22368 KB Output is correct
49 Correct 185 ms 22596 KB Output is correct
50 Correct 154 ms 22344 KB Output is correct
51 Correct 143 ms 22344 KB Output is correct
52 Correct 179 ms 22600 KB Output is correct
53 Correct 146 ms 22664 KB Output is correct
54 Correct 166 ms 24620 KB Output is correct
55 Correct 184 ms 22124 KB Output is correct
56 Correct 133 ms 23276 KB Output is correct
57 Correct 118 ms 24220 KB Output is correct
58 Correct 172 ms 30520 KB Output is correct
59 Correct 74 ms 26616 KB Output is correct
60 Correct 5 ms 5116 KB Output is correct
61 Correct 164 ms 23880 KB Output is correct
62 Correct 188 ms 32584 KB Output is correct
63 Correct 148 ms 23880 KB Output is correct
64 Correct 148 ms 23780 KB Output is correct
65 Correct 148 ms 23624 KB Output is correct
66 Correct 167 ms 23844 KB Output is correct
67 Correct 173 ms 25672 KB Output is correct
68 Correct 159 ms 24320 KB Output is correct
69 Correct 162 ms 25928 KB Output is correct
70 Correct 177 ms 23364 KB Output is correct
71 Correct 129 ms 24788 KB Output is correct
72 Correct 141 ms 26232 KB Output is correct
73 Correct 208 ms 31560 KB Output is correct
74 Correct 105 ms 29656 KB Output is correct