oj.uz

Submission #1120005

# Submission time Handle Problem Language Result Execution time Memory
1120005 2024-11-27T16:39:23 Z yeediot Designated Cities (JOI19_designated_cities) C++17
100 / 100
 226 ms 38756 KB 
#pragma GCC optimize("O3")
#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 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 4 ms 5048 KB Output is correct
8 Correct 4 ms 4944 KB Output is correct
9 Correct 5 ms 4944 KB Output is correct
10 Correct 4 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 4 ms 4944 KB Output is correct
2 Correct 123 ms 27464 KB Output is correct
3 Correct 199 ms 36880 KB Output is correct
4 Correct 189 ms 25976 KB Output is correct
5 Correct 166 ms 28648 KB Output is correct
6 Correct 176 ms 29772 KB Output is correct
7 Correct 129 ms 27776 KB Output is correct
8 Correct 192 ms 35356 KB Output is correct
9 Correct 87 ms 26624 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4944 KB Output is correct
2 Correct 176 ms 27264 KB Output is correct
3 Correct 185 ms 37356 KB Output is correct
4 Correct 143 ms 26884 KB Output is correct
5 Correct 144 ms 27300 KB Output is correct
6 Correct 222 ms 24840 KB Output is correct
7 Correct 89 ms 26744 KB Output is correct
8 Correct 216 ms 34868 KB Output is correct
9 Correct 116 ms 29420 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 4 ms 5048 KB Output is correct
8 Correct 4 ms 4944 KB Output is correct
9 Correct 5 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 4 ms 4944 KB Output is correct
13 Correct 6 ms 5456 KB Output is correct
14 Correct 5 ms 5456 KB Output is correct
15 Correct 5 ms 5456 KB Output is correct
16 Correct 6 ms 5472 KB Output is correct
17 Correct 5 ms 5396 KB Output is correct
18 Correct 7 ms 5472 KB Output is correct
19 Correct 5 ms 5456 KB Output is correct
20 Correct 6 ms 5456 KB Output is correct
21 Correct 5 ms 5456 KB Output is correct
22 Correct 6 ms 5456 KB Output is correct
23 Correct 7 ms 5456 KB Output is correct
24 Correct 6 ms 5388 KB Output is correct
25 Correct 5 ms 5456 KB Output is correct
26 Correct 5 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 123 ms 27464 KB Output is correct
3 Correct 199 ms 36880 KB Output is correct
4 Correct 189 ms 25976 KB Output is correct
5 Correct 166 ms 28648 KB Output is correct
6 Correct 176 ms 29772 KB Output is correct
7 Correct 129 ms 27776 KB Output is correct
8 Correct 192 ms 35356 KB Output is correct
9 Correct 87 ms 26624 KB Output is correct
10 Correct 4 ms 4944 KB Output is correct
11 Correct 176 ms 27264 KB Output is correct
12 Correct 185 ms 37356 KB Output is correct
13 Correct 143 ms 26884 KB Output is correct
14 Correct 144 ms 27300 KB Output is correct
15 Correct 222 ms 24840 KB Output is correct
16 Correct 89 ms 26744 KB Output is correct
17 Correct 216 ms 34868 KB Output is correct
18 Correct 116 ms 29420 KB Output is correct
19 Correct 6 ms 4944 KB Output is correct
20 Correct 197 ms 25824 KB Output is correct
21 Correct 210 ms 37448 KB Output is correct
22 Correct 172 ms 22348 KB Output is correct
23 Correct 186 ms 25220 KB Output is correct
24 Correct 147 ms 26804 KB Output is correct
25 Correct 194 ms 27492 KB Output is correct
26 Correct 168 ms 22604 KB Output is correct
27 Correct 170 ms 22664 KB Output is correct
28 Correct 196 ms 24548 KB Output is correct
29 Correct 173 ms 22184 KB Output is correct
30 Correct 168 ms 25856 KB Output is correct
31 Correct 128 ms 27792 KB Output is correct
32 Correct 226 ms 34032 KB Output is correct
33 Correct 103 ms 29572 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 4 ms 5048 KB Output is correct
8 Correct 4 ms 4944 KB Output is correct
9 Correct 5 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 4 ms 4944 KB Output is correct
13 Correct 123 ms 27464 KB Output is correct
14 Correct 199 ms 36880 KB Output is correct
15 Correct 189 ms 25976 KB Output is correct
16 Correct 166 ms 28648 KB Output is correct
17 Correct 176 ms 29772 KB Output is correct
18 Correct 129 ms 27776 KB Output is correct
19 Correct 192 ms 35356 KB Output is correct
20 Correct 87 ms 26624 KB Output is correct
21 Correct 4 ms 4944 KB Output is correct
22 Correct 176 ms 27264 KB Output is correct
23 Correct 185 ms 37356 KB Output is correct
24 Correct 143 ms 26884 KB Output is correct
25 Correct 144 ms 27300 KB Output is correct
26 Correct 222 ms 24840 KB Output is correct
27 Correct 89 ms 26744 KB Output is correct
28 Correct 216 ms 34868 KB Output is correct
29 Correct 116 ms 29420 KB Output is correct
30 Correct 4 ms 4944 KB Output is correct
31 Correct 6 ms 5456 KB Output is correct
32 Correct 5 ms 5456 KB Output is correct
33 Correct 5 ms 5456 KB Output is correct
34 Correct 6 ms 5472 KB Output is correct
35 Correct 5 ms 5396 KB Output is correct
36 Correct 7 ms 5472 KB Output is correct
37 Correct 5 ms 5456 KB Output is correct
38 Correct 6 ms 5456 KB Output is correct
39 Correct 5 ms 5456 KB Output is correct
40 Correct 6 ms 5456 KB Output is correct
41 Correct 7 ms 5456 KB Output is correct
42 Correct 6 ms 5388 KB Output is correct
43 Correct 5 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 197 ms 25824 KB Output is correct
47 Correct 210 ms 37448 KB Output is correct
48 Correct 172 ms 22348 KB Output is correct
49 Correct 186 ms 25220 KB Output is correct
50 Correct 147 ms 26804 KB Output is correct
51 Correct 194 ms 27492 KB Output is correct
52 Correct 168 ms 22604 KB Output is correct
53 Correct 170 ms 22664 KB Output is correct
54 Correct 196 ms 24548 KB Output is correct
55 Correct 173 ms 22184 KB Output is correct
56 Correct 168 ms 25856 KB Output is correct
57 Correct 128 ms 27792 KB Output is correct
58 Correct 226 ms 34032 KB Output is correct
59 Correct 103 ms 29572 KB Output is correct
60 Correct 6 ms 4944 KB Output is correct
61 Correct 173 ms 27192 KB Output is correct
62 Correct 167 ms 38756 KB Output is correct
63 Correct 125 ms 23964 KB Output is correct
64 Correct 151 ms 26872 KB Output is correct
65 Correct 151 ms 23720 KB Output is correct
66 Correct 174 ms 29948 KB Output is correct
67 Correct 151 ms 28748 KB Output is correct
68 Correct 164 ms 30404 KB Output is correct
69 Correct 191 ms 31944 KB Output is correct
70 Correct 187 ms 23380 KB Output is correct
71 Correct 176 ms 27788 KB Output is correct
72 Correct 174 ms 32252 KB Output is correct
73 Correct 216 ms 38152 KB Output is correct
74 Correct 116 ms 35832 KB Output is correct