oj.uz

Submission #943823

# Submission time Handle Problem Language Result Execution time Memory
943823 2024-03-12T01:45:28 Z yeediot Designated Cities (JOI19_designated_cities) C++14
100 / 100
 344 ms 62460 KB 
#include<bits/stdc++.h>
using namespace std;
#define int 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
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=2e5+5;
vector<tuple<int,int,int>>adj[mxn];
int dp[mxn][2];
pii dp2[mxn];
int dep[mxn];
int p1,p2;
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];
    }
}
int all;
int ans[mxn];
void calc(int v,int pa){
    int mx=0;
    dp2[v].F=dep[v];
    dp2[v].S=v;
    int t1=0,t2=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);
        dp[u][1]-=dp[v][1]-dp[u][1]-d2;
        if(dp2[v].F+dp2[u].F-2*dep[v]>mx){
            t1=dp2[v].S;
            t2=dp2[u].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;
        p2=t2;
        ans[2]=all-dp[v][0]-dp[v][1]-mx;
    }
}
int len[mxn];
int idx;
int dfs2(int v,int pa){
    vector<int>temp;
    for(auto [u,d,d2]:adj[v]){
        if(u==pa)continue;
        temp.pb(dfs2(u,v)+d);
        debug(temp);
    }
    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;
    }
    //debug(*it);
    return *it;
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    ans[2]=1e18;
    ans[1]=1e18;
    for(int i=1;i<n;i++){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        adj[a].pb({b,c,d});
        adj[b].pb({a,d,c});
        all+=c+d;
    }
    dfs(1,1);
    debug(all);
    for(int i=1;i<=n;i++){
        debug(dp[i][0],dp[i][1],dep[i]);
    }
    calc(1,1);
    debug(p1,p2);
    int v=dfs2(p2,p2);
    len[idx++]=v;
    debug(ans[2]);
    sort(len,len+idx,greater<int>());
    for(int i=1;i<idx;i++){
        ans[2+i]=ans[1+i]-len[i];
        //cout<<len[i]<<' ';
    }
    int q;
    cin>>q;
    while(q--){
        int x;
        cin>>x;
        cout<<ans[x]<<'\n';
    }
}
 /*
 input:
 
 */

Compilation message

designated_cities.cpp: In function 'void dfs(long long int, long long int)':
designated_cities.cpp:61:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   61 |     for(auto [u,d,d2]:adj[v]){
      |              ^
designated_cities.cpp: In function 'void calc(long long int, long long int)':
designated_cities.cpp:76:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   76 |     for(auto [u,d,d2]:adj[v]){
      |              ^
designated_cities.cpp: In function 'long long int dfs2(long long int, long long int)':
designated_cities.cpp:99:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   99 |     for(auto [u,d,d2]:adj[v]){
      |              ^
designated_cities.cpp: In function 'void setIO(std::string)':
designated_cities.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 3 ms 11612 KB Output is correct
3 Correct 5 ms 11704 KB Output is correct
4 Correct 3 ms 11608 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 2 ms 11612 KB Output is correct
7 Correct 2 ms 11828 KB Output is correct
8 Correct 3 ms 11612 KB Output is correct
9 Correct 2 ms 11612 KB Output is correct
10 Correct 2 ms 11844 KB Output is correct
11 Correct 3 ms 11612 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11824 KB Output is correct
2 Correct 230 ms 34096 KB Output is correct
3 Correct 259 ms 56912 KB Output is correct
4 Correct 220 ms 33104 KB Output is correct
5 Correct 228 ms 34728 KB Output is correct
6 Correct 259 ms 37460 KB Output is correct
7 Correct 143 ms 34992 KB Output is correct
8 Correct 245 ms 57684 KB Output is correct
9 Correct 129 ms 37288 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11608 KB Output is correct
2 Correct 216 ms 34132 KB Output is correct
3 Correct 243 ms 60932 KB Output is correct
4 Correct 239 ms 33172 KB Output is correct
5 Correct 189 ms 34784 KB Output is correct
6 Correct 234 ms 38252 KB Output is correct
7 Correct 119 ms 37108 KB Output is correct
8 Correct 254 ms 49232 KB Output is correct
9 Correct 113 ms 36084 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 3 ms 11612 KB Output is correct
3 Correct 5 ms 11704 KB Output is correct
4 Correct 3 ms 11608 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 2 ms 11612 KB Output is correct
7 Correct 2 ms 11828 KB Output is correct
8 Correct 3 ms 11612 KB Output is correct
9 Correct 2 ms 11612 KB Output is correct
10 Correct 2 ms 11844 KB Output is correct
11 Correct 3 ms 11612 KB Output is correct
12 Correct 2 ms 11612 KB Output is correct
13 Correct 4 ms 11868 KB Output is correct
14 Correct 4 ms 12124 KB Output is correct
15 Correct 3 ms 11868 KB Output is correct
16 Correct 4 ms 11964 KB Output is correct
17 Correct 4 ms 11868 KB Output is correct
18 Correct 3 ms 11864 KB Output is correct
19 Correct 4 ms 11868 KB Output is correct
20 Correct 3 ms 11868 KB Output is correct
21 Correct 4 ms 12124 KB Output is correct
22 Correct 5 ms 11868 KB Output is correct
23 Correct 4 ms 11868 KB Output is correct
24 Correct 3 ms 12124 KB Output is correct
25 Correct 4 ms 12120 KB Output is correct
26 Correct 4 ms 12124 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11824 KB Output is correct
2 Correct 230 ms 34096 KB Output is correct
3 Correct 259 ms 56912 KB Output is correct
4 Correct 220 ms 33104 KB Output is correct
5 Correct 228 ms 34728 KB Output is correct
6 Correct 259 ms 37460 KB Output is correct
7 Correct 143 ms 34992 KB Output is correct
8 Correct 245 ms 57684 KB Output is correct
9 Correct 129 ms 37288 KB Output is correct
10 Correct 2 ms 11608 KB Output is correct
11 Correct 216 ms 34132 KB Output is correct
12 Correct 243 ms 60932 KB Output is correct
13 Correct 239 ms 33172 KB Output is correct
14 Correct 189 ms 34784 KB Output is correct
15 Correct 234 ms 38252 KB Output is correct
16 Correct 119 ms 37108 KB Output is correct
17 Correct 254 ms 49232 KB Output is correct
18 Correct 113 ms 36084 KB Output is correct
19 Correct 2 ms 11612 KB Output is correct
20 Correct 246 ms 35436 KB Output is correct
21 Correct 268 ms 62460 KB Output is correct
22 Correct 202 ms 34128 KB Output is correct
23 Correct 224 ms 35752 KB Output is correct
24 Correct 189 ms 34640 KB Output is correct
25 Correct 209 ms 35740 KB Output is correct
26 Correct 205 ms 34644 KB Output is correct
27 Correct 171 ms 35848 KB Output is correct
28 Correct 204 ms 38912 KB Output is correct
29 Correct 216 ms 36432 KB Output is correct
30 Correct 180 ms 34984 KB Output is correct
31 Correct 144 ms 36076 KB Output is correct
32 Correct 255 ms 51744 KB Output is correct
33 Correct 119 ms 38424 KB Output is correct

Subtask #6
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 3 ms 11612 KB Output is correct
3 Correct 5 ms 11704 KB Output is correct
4 Correct 3 ms 11608 KB Output is correct
5 Correct 3 ms 11612 KB Output is correct
6 Correct 2 ms 11612 KB Output is correct
7 Correct 2 ms 11828 KB Output is correct
8 Correct 3 ms 11612 KB Output is correct
9 Correct 2 ms 11612 KB Output is correct
10 Correct 2 ms 11844 KB Output is correct
11 Correct 3 ms 11612 KB Output is correct
12 Correct 2 ms 11824 KB Output is correct
13 Correct 230 ms 34096 KB Output is correct
14 Correct 259 ms 56912 KB Output is correct
15 Correct 220 ms 33104 KB Output is correct
16 Correct 228 ms 34728 KB Output is correct
17 Correct 259 ms 37460 KB Output is correct
18 Correct 143 ms 34992 KB Output is correct
19 Correct 245 ms 57684 KB Output is correct
20 Correct 129 ms 37288 KB Output is correct
21 Correct 2 ms 11608 KB Output is correct
22 Correct 216 ms 34132 KB Output is correct
23 Correct 243 ms 60932 KB Output is correct
24 Correct 239 ms 33172 KB Output is correct
25 Correct 189 ms 34784 KB Output is correct
26 Correct 234 ms 38252 KB Output is correct
27 Correct 119 ms 37108 KB Output is correct
28 Correct 254 ms 49232 KB Output is correct
29 Correct 113 ms 36084 KB Output is correct
30 Correct 2 ms 11612 KB Output is correct
31 Correct 4 ms 11868 KB Output is correct
32 Correct 4 ms 12124 KB Output is correct
33 Correct 3 ms 11868 KB Output is correct
34 Correct 4 ms 11964 KB Output is correct
35 Correct 4 ms 11868 KB Output is correct
36 Correct 3 ms 11864 KB Output is correct
37 Correct 4 ms 11868 KB Output is correct
38 Correct 3 ms 11868 KB Output is correct
39 Correct 4 ms 12124 KB Output is correct
40 Correct 5 ms 11868 KB Output is correct
41 Correct 4 ms 11868 KB Output is correct
42 Correct 3 ms 12124 KB Output is correct
43 Correct 4 ms 12120 KB Output is correct
44 Correct 4 ms 12124 KB Output is correct
45 Correct 2 ms 11612 KB Output is correct
46 Correct 246 ms 35436 KB Output is correct
47 Correct 268 ms 62460 KB Output is correct
48 Correct 202 ms 34128 KB Output is correct
49 Correct 224 ms 35752 KB Output is correct
50 Correct 189 ms 34640 KB Output is correct
51 Correct 209 ms 35740 KB Output is correct
52 Correct 205 ms 34644 KB Output is correct
53 Correct 171 ms 35848 KB Output is correct
54 Correct 204 ms 38912 KB Output is correct
55 Correct 216 ms 36432 KB Output is correct
56 Correct 180 ms 34984 KB Output is correct
57 Correct 144 ms 36076 KB Output is correct
58 Correct 255 ms 51744 KB Output is correct
59 Correct 119 ms 38424 KB Output is correct
60 Correct 2 ms 11612 KB Output is correct
61 Correct 215 ms 38132 KB Output is correct
62 Correct 344 ms 60216 KB Output is correct
63 Correct 207 ms 36944 KB Output is correct
64 Correct 240 ms 38440 KB Output is correct
65 Correct 202 ms 36944 KB Output is correct
66 Correct 215 ms 38384 KB Output is correct
67 Correct 233 ms 37200 KB Output is correct
68 Correct 209 ms 38664 KB Output is correct
69 Correct 258 ms 41252 KB Output is correct
70 Correct 211 ms 38740 KB Output is correct
71 Correct 198 ms 37752 KB Output is correct
72 Correct 169 ms 39488 KB Output is correct
73 Correct 264 ms 52588 KB Output is correct
74 Correct 158 ms 41248 KB Output is correct