oj.uz

Submission #734353

# Submission time Handle Problem Language Result Execution time Memory
734353 2023-05-02T10:04:56 Z bin9638 Road Closures (APIO21_roads) C++17
12 / 100
 181 ms 38984 KB 
#include <bits/stdc++.h>

#ifndef SKY
#include "roads.h"
#endif // SKY

using namespace std;

#define N 100010
#define ll long long
#define fs first
#define sc second
#define ii pair<ll,int>
#define pb push_back

#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("omit-frame-pointer")
#pragma GCC optimize("unroll-loops")

const ll MAX_VAL=2e14;

int cnt,BLOCKS,k,n,ktr[N],spec[N];
vector<ii>g[N],edge[N];
ll tong,them,cost[N],dp[N][2];
vector<ll>sum[N];
vector<int>lis,ds[N];

struct nho
{
    void build(int u,int p)
    {
        for(auto v:g[u])
            if(v.sc!=p)
            {
                build(v.sc,u);
                cost[v.sc]=v.fs;
            }
    }

    ll solve(int u,int p,int sl,const vector<ll>&s)
    {

        if(sl<0)
            return MAX_VAL;
        ll res=0;
        for(auto v:g[u])
            if(v.sc!=p)
                if(dp[v.sc][0]<=dp[v.sc][1])
                {
                    res+=dp[v.sc][0];
                }else
                {
                    res+=dp[v.sc][1];
                }
        for(int i=0;i<(int)s.size()-sl;i++)
            res+=s[i];
        return res;
    }

    void DFS(int u,int p)
    {
        for(auto v:g[u])
            if(v.sc!=p)
                DFS(v.sc,u);
        vector<ll>s;
        for(auto v:g[u])
            if(v.sc!=p&&dp[v.sc][0]>dp[v.sc][1])
                s.pb(dp[v.sc][0]-dp[v.sc][1]);
        if((int)s.size()>k-(u!=0))
            sort(s.begin(),s.end());
        //0
        dp[u][0]=solve(u,p,k,s)+cost[u];
        //1
        dp[u][1]=solve(u,p,k-(u!=0),s);
    }
}nho;

ll get(int u,int sl)
{
    if(sl>=sum[u].size())
        return 0;
    if(sl==0)
        return sum[u].back();
    return sum[u].back()-sum[u][sl-1];
}

ll solve(int u,int p,int sl,const vector<ll>&s)
{
    if(sl<0)
        return MAX_VAL;
    ll cong=0,res=MAX_VAL;
    for(auto v:edge[u])
        if(v.sc!=p)
        {
             if(dp[v.sc][0]<=dp[v.sc][1])
                {
                    cong+=dp[v.sc][0];
                }else
                {
                    cong+=dp[v.sc][1];
                }
        }
    if((int)s.size()<=sl)
        res=min(res,cong+get(u,sl-(int)s.size()));
    for(int i=0;i<s.size();i++)
    {
        cong+=s[i];
        if((int)s.size()-i-1<=sl)
            res=min(res,cong+get(u,sl-((int)s.size()-i-1)));
        if(sl-((int)s.size()-i-1)>=sum[u].size())
            break;
    }
    return res;
}

void DFS(int u,int p)
{
    ktr[u]=k;
    for(auto v:edge[u])
        if(v.sc!=p)
        {
            cost[v.sc]=v.fs;
            DFS(v.sc,u);
        }
    vector<ll>s;
    for(auto v:edge[u])
        if(v.sc!=p&&dp[v.sc][0]>dp[v.sc][1])
            s.pb(dp[v.sc][0]-dp[v.sc][1]);
    if((int)s.size()+(int)sum[u].size()>k-(p!=-1))
        sort(s.begin(),s.end());
    //0
    dp[u][0]=solve(u,p,k,s)+cost[u];
    //1
    dp[u][1]=solve(u,p,k-(p!=-1),s);
}

vector<long long> minimum_closure_costs(int NNN, vector<int> UUU, vector<int> VVV, vector<int> WWW)
{
    n=NNN;
    for(int i=0;i<n-1;i++)
    {
        int u=UUU[i],v=VVV[i],w=WWW[i];
        g[u].pb({w,v});
        g[v].pb({w,u});
    }
    cost[0]=1e18;
    nho.build(0,-1);
    vector<ll>kq;
    for(k=0;k<=0;k++)
    {
        nho.DFS(0,-1);
        kq.pb(dp[0][1]);
    }
    for(int i=0;i<n;i++)
        ds[(int)g[i].size()].pb(i);
    for(int i=0;i<n;i++)
        spec[i]=1;
    for(k=1;k<n;k++)
    {
        if(!ds[k].empty())
        {
            for(auto u:ds[k])
                spec[u]=0;
            for(int i=0;i<n;i++)
                sum[i].clear(),edge[i].clear();
            them=tong=0;
             for(int i=0;i<n-1;i++)
                {
                    int u=UUU[i],v=VVV[i],w=WWW[i];
                    tong+=1ll*w;
                    if((int)g[u].size()<(int)g[v].size())
                        swap(u,v);
                    if(spec[u]&&spec[v])
                    {
                        edge[u].pb({w,v});
                        edge[v].pb({w,u});
                        continue;
                    }
                    if(spec[u])
                    {
                        sum[u].pb(w);
                        continue;
                    }
                    them+=1ll*w;
                }
            lis.clear();
             for(int i=0;i<n;i++)
            {
                sort(sum[i].begin(),sum[i].end(),greater<ll>());
                for(int j=1;j<sum[i].size();j++)
                    sum[i][j]+=sum[i][j-1];
            }
            for(int i=0;i<n;i++)
                if(spec[i]==1)
                    lis.pb(i);
             memset(cost,0x3f3f,sizeof(cost));
        }
      //  for(int i=0;i<n;i++)cout<<spec[i]<<" ";cout<<endl;
         ll res=0;
        for(auto u:lis)
            if(ktr[u]!=k)
                DFS(u,-1),res+=dp[u][1];
        kq.pb(res);
    }
    return kq;
}

#ifdef SKY
int main()
{
    freopen("A.inp","r",stdin);
    freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin>>n;
    vector<int>U(n-1),V(n-1),W(n-1);
    for(int i=0;i<n-1;i++)
        cin>>U[i]>>V[i]>>W[i];
    vector<ll>kq=minimum_closure_costs(n,U,V,W);
    for(auto u:kq)cout<<u<<" ";
    return 0;
}
#endif

Compilation message

roads.cpp: In member function 'long long int nho::solve(int, int, int, const std::vector<long long int>&)':
roads.cpp:48:15: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   48 |             if(v.sc!=p)
      |               ^
roads.cpp: In function 'long long int get(int, int)':
roads.cpp:81:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     if(sl>=sum[u].size())
      |        ~~^~~~~~~~~~~~~~~
roads.cpp: In function 'long long int solve(int, int, int, const std::vector<long long int>&)':
roads.cpp:106:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |     for(int i=0;i<s.size();i++)
      |                 ~^~~~~~~~~
roads.cpp:111:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |         if(sl-((int)s.size()-i-1)>=sum[u].size())
      |            ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:191:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  191 |                 for(int j=1;j<sum[i].size();j++)
      |                             ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 7 ms 10708 KB Output is correct
3 Correct 7 ms 10708 KB Output is correct
4 Correct 7 ms 10708 KB Output is correct
5 Correct 5 ms 10452 KB Output is correct
6 Correct 6 ms 10452 KB Output is correct
7 Correct 6 ms 10452 KB Output is correct
8 Correct 7 ms 10712 KB Output is correct
9 Correct 7 ms 10720 KB Output is correct
10 Correct 6 ms 10452 KB Output is correct
11 Correct 6 ms 10452 KB Output is correct
12 Correct 45 ms 17536 KB Output is correct
13 Correct 73 ms 22460 KB Output is correct
14 Correct 70 ms 21480 KB Output is correct
15 Correct 80 ms 22576 KB Output is correct
16 Correct 77 ms 22704 KB Output is correct
17 Correct 76 ms 22792 KB Output is correct
18 Correct 5 ms 10452 KB Output is correct
19 Correct 63 ms 21376 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10452 KB Output is correct
2 Correct 79 ms 34360 KB Output is correct
3 Correct 84 ms 37184 KB Output is correct
4 Correct 87 ms 38944 KB Output is correct
5 Correct 86 ms 38940 KB Output is correct
6 Correct 6 ms 10964 KB Output is correct
7 Correct 7 ms 10964 KB Output is correct
8 Correct 7 ms 10964 KB Output is correct
9 Correct 5 ms 10452 KB Output is correct
10 Correct 6 ms 10452 KB Output is correct
11 Correct 5 ms 10452 KB Output is correct
12 Correct 52 ms 27668 KB Output is correct
13 Correct 84 ms 38984 KB Output is correct
14 Correct 5 ms 10452 KB Output is correct
15 Correct 73 ms 36248 KB Output is correct
16 Correct 81 ms 38960 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10452 KB Output is correct
2 Correct 5 ms 10452 KB Output is correct
3 Correct 6 ms 10452 KB Output is correct
4 Incorrect 6 ms 10452 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10452 KB Output is correct
2 Correct 5 ms 10452 KB Output is correct
3 Correct 6 ms 10452 KB Output is correct
4 Incorrect 6 ms 10452 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 181 ms 26628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 181 ms 26628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 7 ms 10708 KB Output is correct
3 Correct 7 ms 10708 KB Output is correct
4 Correct 7 ms 10708 KB Output is correct
5 Correct 5 ms 10452 KB Output is correct
6 Correct 6 ms 10452 KB Output is correct
7 Correct 6 ms 10452 KB Output is correct
8 Correct 7 ms 10712 KB Output is correct
9 Correct 7 ms 10720 KB Output is correct
10 Correct 6 ms 10452 KB Output is correct
11 Correct 6 ms 10452 KB Output is correct
12 Correct 45 ms 17536 KB Output is correct
13 Correct 73 ms 22460 KB Output is correct
14 Correct 70 ms 21480 KB Output is correct
15 Correct 80 ms 22576 KB Output is correct
16 Correct 77 ms 22704 KB Output is correct
17 Correct 76 ms 22792 KB Output is correct
18 Correct 5 ms 10452 KB Output is correct
19 Correct 63 ms 21376 KB Output is correct
20 Correct 6 ms 10452 KB Output is correct
21 Correct 79 ms 34360 KB Output is correct
22 Correct 84 ms 37184 KB Output is correct
23 Correct 87 ms 38944 KB Output is correct
24 Correct 86 ms 38940 KB Output is correct
25 Correct 6 ms 10964 KB Output is correct
26 Correct 7 ms 10964 KB Output is correct
27 Correct 7 ms 10964 KB Output is correct
28 Correct 5 ms 10452 KB Output is correct
29 Correct 6 ms 10452 KB Output is correct
30 Correct 5 ms 10452 KB Output is correct
31 Correct 52 ms 27668 KB Output is correct
32 Correct 84 ms 38984 KB Output is correct
33 Correct 5 ms 10452 KB Output is correct
34 Correct 73 ms 36248 KB Output is correct
35 Correct 81 ms 38960 KB Output is correct
36 Correct 6 ms 10452 KB Output is correct
37 Correct 5 ms 10452 KB Output is correct
38 Correct 6 ms 10452 KB Output is correct
39 Incorrect 6 ms 10452 KB Output isn't correct
40 Halted 0 ms 0 KB -