oj.uz

답안 #943825

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943825 2024-03-12T01:53:13 Z yeediot Designated Cities (JOI19_designated_cities) C++14
7 / 100
 240 ms 41556 KB 
#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;
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){
    int 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;
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);
    }
    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;
    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);
    calc(1,1);
    int v=dfs2(p1,p1);
    len[idx++]=v;
    sort(len,len+idx,greater<int>());
    for(int i=1;i<idx;i++){
        ans[2+i]=ans[1+i]-len[i];
    }
    int q;
    cin>>q;
    while(q--){
        int x;
        cin>>x;
        cout<<ans[x]<<'\n';
    }
}

Compilation message

designated_cities.cpp: In function 'void dfs(int, int)':
designated_cities.cpp:48:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   48 |     for(auto [u,d,d2]:adj[v]){
      |              ^
designated_cities.cpp: In function 'void calc(int, int)':
designated_cities.cpp:63:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   63 |     for(auto [u,d,d2]:adj[v]){
      |              ^
designated_cities.cpp: In function 'int dfs2(int, int)':
designated_cities.cpp:83:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   83 |     for(auto [u,d,d2]:adj[v]){
      |              ^

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11608 KB Output is correct
2 Incorrect 2 ms 11612 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 158 ms 24196 KB Output is correct
3 Correct 224 ms 40172 KB Output is correct
4 Correct 148 ms 24232 KB Output is correct
5 Correct 173 ms 24584 KB Output is correct
6 Correct 169 ms 26864 KB Output is correct
7 Correct 133 ms 24920 KB Output is correct
8 Correct 240 ms 41556 KB Output is correct
9 Correct 110 ms 26880 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11608 KB Output is correct
2 Incorrect 185 ms 24200 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11608 KB Output is correct
2 Incorrect 2 ms 11612 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 158 ms 24196 KB Output is correct
3 Correct 224 ms 40172 KB Output is correct
4 Correct 148 ms 24232 KB Output is correct
5 Correct 173 ms 24584 KB Output is correct
6 Correct 169 ms 26864 KB Output is correct
7 Correct 133 ms 24920 KB Output is correct
8 Correct 240 ms 41556 KB Output is correct
9 Correct 110 ms 26880 KB Output is correct
10 Correct 2 ms 11608 KB Output is correct
11 Incorrect 185 ms 24200 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11608 KB Output is correct
2 Incorrect 2 ms 11612 KB Output isn't correct
3 Halted 0 ms 0 KB -