oj.uz

Submission #1119998

# Submission time Handle Problem Language Result Execution time Memory
1119998 2024-11-27T16:33:53 Z yeediot Designated Cities (JOI19_designated_cities) C++17
100 / 100
 204 ms 34060 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)
#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], 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(){
    setio();
    int n,q;
    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];
    }
    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 5080 KB Output is correct
3 Correct 5 ms 4956 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 4944 KB Output is correct
8 Correct 5 ms 4944 KB Output is correct
9 Correct 5 ms 4944 KB Output is correct
10 Correct 5 ms 4944 KB Output is correct
11 Correct 5 ms 4944 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4944 KB Output is correct
2 Correct 168 ms 22424 KB Output is correct
3 Correct 177 ms 34060 KB Output is correct
4 Correct 140 ms 22420 KB Output is correct
5 Correct 120 ms 24656 KB Output is correct
6 Correct 141 ms 24396 KB Output is correct
7 Correct 100 ms 23960 KB Output is correct
8 Correct 135 ms 32240 KB Output is correct
9 Correct 68 ms 26756 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 102 ms 22504 KB Output is correct
3 Correct 133 ms 32328 KB Output is correct
4 Correct 120 ms 22492 KB Output is correct
5 Correct 113 ms 22944 KB Output is correct
6 Correct 162 ms 24904 KB Output is correct
7 Correct 99 ms 26272 KB Output is correct
8 Correct 155 ms 30280 KB Output is correct
9 Correct 77 ms 26772 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 5080 KB Output is correct
3 Correct 5 ms 4956 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 4944 KB Output is correct
8 Correct 5 ms 4944 KB Output is correct
9 Correct 5 ms 4944 KB Output is correct
10 Correct 5 ms 4944 KB Output is correct
11 Correct 5 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 5456 KB Output is correct
15 Correct 5 ms 5388 KB Output is correct
16 Correct 5 ms 5200 KB Output is correct
17 Correct 5 ms 5200 KB Output is correct
18 Correct 7 ms 5200 KB Output is correct
19 Correct 8 ms 5200 KB Output is correct
20 Correct 5 ms 5200 KB Output is correct
21 Correct 6 ms 5200 KB Output is correct
22 Correct 6 ms 5368 KB Output is correct
23 Correct 5 ms 5368 KB Output is correct
24 Correct 5 ms 5328 KB Output is correct
25 Correct 5 ms 5456 KB Output is correct
26 Correct 6 ms 5344 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4944 KB Output is correct
2 Correct 168 ms 22424 KB Output is correct
3 Correct 177 ms 34060 KB Output is correct
4 Correct 140 ms 22420 KB Output is correct
5 Correct 120 ms 24656 KB Output is correct
6 Correct 141 ms 24396 KB Output is correct
7 Correct 100 ms 23960 KB Output is correct
8 Correct 135 ms 32240 KB Output is correct
9 Correct 68 ms 26756 KB Output is correct
10 Correct 5 ms 4944 KB Output is correct
11 Correct 102 ms 22504 KB Output is correct
12 Correct 133 ms 32328 KB Output is correct
13 Correct 120 ms 22492 KB Output is correct
14 Correct 113 ms 22944 KB Output is correct
15 Correct 162 ms 24904 KB Output is correct
16 Correct 99 ms 26272 KB Output is correct
17 Correct 155 ms 30280 KB Output is correct
18 Correct 77 ms 26772 KB Output is correct
19 Correct 4 ms 4944 KB Output is correct
20 Correct 115 ms 22556 KB Output is correct
21 Correct 204 ms 32180 KB Output is correct
22 Correct 147 ms 22444 KB Output is correct
23 Correct 171 ms 22600 KB Output is correct
24 Correct 167 ms 22540 KB Output is correct
25 Correct 186 ms 22344 KB Output is correct
26 Correct 141 ms 22440 KB Output is correct
27 Correct 150 ms 22736 KB Output is correct
28 Correct 161 ms 24596 KB Output is correct
29 Correct 198 ms 22088 KB Output is correct
30 Correct 163 ms 23276 KB Output is correct
31 Correct 152 ms 24316 KB Output is correct
32 Correct 188 ms 30540 KB Output is correct
33 Correct 79 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 5080 KB Output is correct
3 Correct 5 ms 4956 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 4944 KB Output is correct
8 Correct 5 ms 4944 KB Output is correct
9 Correct 5 ms 4944 KB Output is correct
10 Correct 5 ms 4944 KB Output is correct
11 Correct 5 ms 4944 KB Output is correct
12 Correct 7 ms 4944 KB Output is correct
13 Correct 168 ms 22424 KB Output is correct
14 Correct 177 ms 34060 KB Output is correct
15 Correct 140 ms 22420 KB Output is correct
16 Correct 120 ms 24656 KB Output is correct
17 Correct 141 ms 24396 KB Output is correct
18 Correct 100 ms 23960 KB Output is correct
19 Correct 135 ms 32240 KB Output is correct
20 Correct 68 ms 26756 KB Output is correct
21 Correct 5 ms 4944 KB Output is correct
22 Correct 102 ms 22504 KB Output is correct
23 Correct 133 ms 32328 KB Output is correct
24 Correct 120 ms 22492 KB Output is correct
25 Correct 113 ms 22944 KB Output is correct
26 Correct 162 ms 24904 KB Output is correct
27 Correct 99 ms 26272 KB Output is correct
28 Correct 155 ms 30280 KB Output is correct
29 Correct 77 ms 26772 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 5456 KB Output is correct
33 Correct 5 ms 5388 KB Output is correct
34 Correct 5 ms 5200 KB Output is correct
35 Correct 5 ms 5200 KB Output is correct
36 Correct 7 ms 5200 KB Output is correct
37 Correct 8 ms 5200 KB Output is correct
38 Correct 5 ms 5200 KB Output is correct
39 Correct 6 ms 5200 KB Output is correct
40 Correct 6 ms 5368 KB Output is correct
41 Correct 5 ms 5368 KB Output is correct
42 Correct 5 ms 5328 KB Output is correct
43 Correct 5 ms 5456 KB Output is correct
44 Correct 6 ms 5344 KB Output is correct
45 Correct 4 ms 4944 KB Output is correct
46 Correct 115 ms 22556 KB Output is correct
47 Correct 204 ms 32180 KB Output is correct
48 Correct 147 ms 22444 KB Output is correct
49 Correct 171 ms 22600 KB Output is correct
50 Correct 167 ms 22540 KB Output is correct
51 Correct 186 ms 22344 KB Output is correct
52 Correct 141 ms 22440 KB Output is correct
53 Correct 150 ms 22736 KB Output is correct
54 Correct 161 ms 24596 KB Output is correct
55 Correct 198 ms 22088 KB Output is correct
56 Correct 163 ms 23276 KB Output is correct
57 Correct 152 ms 24316 KB Output is correct
58 Correct 188 ms 30540 KB Output is correct
59 Correct 79 ms 26616 KB Output is correct
60 Correct 5 ms 4944 KB Output is correct
61 Correct 180 ms 23820 KB Output is correct
62 Correct 196 ms 32596 KB Output is correct
63 Correct 161 ms 23788 KB Output is correct
64 Correct 158 ms 23880 KB Output is correct
65 Correct 156 ms 23540 KB Output is correct
66 Correct 191 ms 23880 KB Output is correct
67 Correct 165 ms 23612 KB Output is correct
68 Correct 186 ms 24344 KB Output is correct
69 Correct 170 ms 25800 KB Output is correct
70 Correct 156 ms 23268 KB Output is correct
71 Correct 186 ms 24788 KB Output is correct
72 Correct 146 ms 26232 KB Output is correct
73 Correct 184 ms 31652 KB Output is correct
74 Correct 116 ms 29656 KB Output is correct