oj.uz

Submission #1119995

# Submission time Handle Problem Language Result Execution time Memory
1119995 2024-11-27T16:32:12 Z yeediot Designated Cities (JOI19_designated_cities) C++17
100 / 100
 292 ms 44504 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=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
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];
pair<ll,int> dp2[mxn];
ll dep[mxn];
int p1;
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;
ll ans[mxn];
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;
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(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    rd(n);
    ans[2]=1e18;
    ans[1]=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];
    }
    int q;
    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 4 ms 5200 KB Output is correct
2 Correct 4 ms 5200 KB Output is correct
3 Correct 4 ms 5200 KB Output is correct
4 Correct 6 ms 5200 KB Output is correct
5 Correct 4 ms 5200 KB Output is correct
6 Correct 5 ms 5200 KB Output is correct
7 Correct 4 ms 5200 KB Output is correct
8 Correct 4 ms 5368 KB Output is correct
9 Correct 4 ms 5200 KB Output is correct
10 Correct 5 ms 5200 KB Output is correct
11 Correct 5 ms 5200 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5212 KB Output is correct
2 Correct 177 ms 22344 KB Output is correct
3 Correct 237 ms 44504 KB Output is correct
4 Correct 179 ms 25160 KB Output is correct
5 Correct 148 ms 23016 KB Output is correct
6 Correct 174 ms 28768 KB Output is correct
7 Correct 140 ms 23980 KB Output is correct
8 Correct 262 ms 40516 KB Output is correct
9 Correct 79 ms 26804 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5200 KB Output is correct
2 Correct 151 ms 22604 KB Output is correct
3 Correct 227 ms 41032 KB Output is correct
4 Correct 192 ms 22344 KB Output is correct
5 Correct 200 ms 26600 KB Output is correct
6 Correct 200 ms 26184 KB Output is correct
7 Correct 99 ms 26868 KB Output is correct
8 Correct 249 ms 35864 KB Output is correct
9 Correct 79 ms 26848 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5200 KB Output is correct
2 Correct 4 ms 5200 KB Output is correct
3 Correct 4 ms 5200 KB Output is correct
4 Correct 6 ms 5200 KB Output is correct
5 Correct 4 ms 5200 KB Output is correct
6 Correct 5 ms 5200 KB Output is correct
7 Correct 4 ms 5200 KB Output is correct
8 Correct 4 ms 5368 KB Output is correct
9 Correct 4 ms 5200 KB Output is correct
10 Correct 5 ms 5200 KB Output is correct
11 Correct 5 ms 5200 KB Output is correct
12 Correct 6 ms 5200 KB Output is correct
13 Correct 5 ms 5200 KB Output is correct
14 Correct 7 ms 5456 KB Output is correct
15 Correct 7 ms 5200 KB Output is correct
16 Correct 6 ms 5456 KB Output is correct
17 Correct 5 ms 5200 KB Output is correct
18 Correct 5 ms 5456 KB Output is correct
19 Correct 6 ms 5200 KB Output is correct
20 Correct 6 ms 5456 KB Output is correct
21 Correct 6 ms 5456 KB Output is correct
22 Correct 5 ms 5200 KB Output is correct
23 Correct 5 ms 5456 KB Output is correct
24 Correct 6 ms 5456 KB Output is correct
25 Correct 7 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 6 ms 5212 KB Output is correct
2 Correct 177 ms 22344 KB Output is correct
3 Correct 237 ms 44504 KB Output is correct
4 Correct 179 ms 25160 KB Output is correct
5 Correct 148 ms 23016 KB Output is correct
6 Correct 174 ms 28768 KB Output is correct
7 Correct 140 ms 23980 KB Output is correct
8 Correct 262 ms 40516 KB Output is correct
9 Correct 79 ms 26804 KB Output is correct
10 Correct 4 ms 5200 KB Output is correct
11 Correct 151 ms 22604 KB Output is correct
12 Correct 227 ms 41032 KB Output is correct
13 Correct 192 ms 22344 KB Output is correct
14 Correct 200 ms 26600 KB Output is correct
15 Correct 200 ms 26184 KB Output is correct
16 Correct 99 ms 26868 KB Output is correct
17 Correct 249 ms 35864 KB Output is correct
18 Correct 79 ms 26848 KB Output is correct
19 Correct 5 ms 5200 KB Output is correct
20 Correct 140 ms 22540 KB Output is correct
21 Correct 204 ms 41000 KB Output is correct
22 Correct 133 ms 22480 KB Output is correct
23 Correct 165 ms 22636 KB Output is correct
24 Correct 133 ms 22600 KB Output is correct
25 Correct 145 ms 22464 KB Output is correct
26 Correct 170 ms 22600 KB Output is correct
27 Correct 173 ms 22664 KB Output is correct
28 Correct 149 ms 25672 KB Output is correct
29 Correct 147 ms 22252 KB Output is correct
30 Correct 136 ms 23348 KB Output is correct
31 Correct 108 ms 24316 KB Output is correct
32 Correct 233 ms 36420 KB Output is correct
33 Correct 78 ms 26844 KB Output is correct

Subtask #6
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5200 KB Output is correct
2 Correct 4 ms 5200 KB Output is correct
3 Correct 4 ms 5200 KB Output is correct
4 Correct 6 ms 5200 KB Output is correct
5 Correct 4 ms 5200 KB Output is correct
6 Correct 5 ms 5200 KB Output is correct
7 Correct 4 ms 5200 KB Output is correct
8 Correct 4 ms 5368 KB Output is correct
9 Correct 4 ms 5200 KB Output is correct
10 Correct 5 ms 5200 KB Output is correct
11 Correct 5 ms 5200 KB Output is correct
12 Correct 6 ms 5212 KB Output is correct
13 Correct 177 ms 22344 KB Output is correct
14 Correct 237 ms 44504 KB Output is correct
15 Correct 179 ms 25160 KB Output is correct
16 Correct 148 ms 23016 KB Output is correct
17 Correct 174 ms 28768 KB Output is correct
18 Correct 140 ms 23980 KB Output is correct
19 Correct 262 ms 40516 KB Output is correct
20 Correct 79 ms 26804 KB Output is correct
21 Correct 4 ms 5200 KB Output is correct
22 Correct 151 ms 22604 KB Output is correct
23 Correct 227 ms 41032 KB Output is correct
24 Correct 192 ms 22344 KB Output is correct
25 Correct 200 ms 26600 KB Output is correct
26 Correct 200 ms 26184 KB Output is correct
27 Correct 99 ms 26868 KB Output is correct
28 Correct 249 ms 35864 KB Output is correct
29 Correct 79 ms 26848 KB Output is correct
30 Correct 6 ms 5200 KB Output is correct
31 Correct 5 ms 5200 KB Output is correct
32 Correct 7 ms 5456 KB Output is correct
33 Correct 7 ms 5200 KB Output is correct
34 Correct 6 ms 5456 KB Output is correct
35 Correct 5 ms 5200 KB Output is correct
36 Correct 5 ms 5456 KB Output is correct
37 Correct 6 ms 5200 KB Output is correct
38 Correct 6 ms 5456 KB Output is correct
39 Correct 6 ms 5456 KB Output is correct
40 Correct 5 ms 5200 KB Output is correct
41 Correct 5 ms 5456 KB Output is correct
42 Correct 6 ms 5456 KB Output is correct
43 Correct 7 ms 5456 KB Output is correct
44 Correct 7 ms 5456 KB Output is correct
45 Correct 5 ms 5200 KB Output is correct
46 Correct 140 ms 22540 KB Output is correct
47 Correct 204 ms 41000 KB Output is correct
48 Correct 133 ms 22480 KB Output is correct
49 Correct 165 ms 22636 KB Output is correct
50 Correct 133 ms 22600 KB Output is correct
51 Correct 145 ms 22464 KB Output is correct
52 Correct 170 ms 22600 KB Output is correct
53 Correct 173 ms 22664 KB Output is correct
54 Correct 149 ms 25672 KB Output is correct
55 Correct 147 ms 22252 KB Output is correct
56 Correct 136 ms 23348 KB Output is correct
57 Correct 108 ms 24316 KB Output is correct
58 Correct 233 ms 36420 KB Output is correct
59 Correct 78 ms 26844 KB Output is correct
60 Correct 5 ms 5200 KB Output is correct
61 Correct 124 ms 23788 KB Output is correct
62 Correct 169 ms 41548 KB Output is correct
63 Correct 107 ms 23800 KB Output is correct
64 Correct 123 ms 23880 KB Output is correct
65 Correct 115 ms 23772 KB Output is correct
66 Correct 117 ms 23844 KB Output is correct
67 Correct 116 ms 23880 KB Output is correct
68 Correct 149 ms 24240 KB Output is correct
69 Correct 163 ms 26944 KB Output is correct
70 Correct 148 ms 23464 KB Output is correct
71 Correct 121 ms 24788 KB Output is correct
72 Correct 149 ms 26128 KB Output is correct
73 Correct 292 ms 37316 KB Output is correct
74 Correct 156 ms 29636 KB Output is correct