답안 #163138

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
163138	2019-11-11T13:48:03 Z	arnold518	Chase (CEOI17_chase)	C++14	컴파일 오류	0 ms	0 KB

chase

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const int MAXK = 100;

int N, K;
ll P[MAXN+10], S[MAXN+10], dp1[MAXN+10][MAXK+10], dp2[MAXN+10][MAXK+10], ans;
vector<int> adj[MAXN+10];

void dfs1(int now, int bef)
{
    int i, j;
    for(int nxt : adj[now])
    {
        if(nxt==bef) continue;
        dfs1(nxt, now);
    }
    for(int nxt : adj[now]) S[now]+=P[nxt];

    for(i=1; i<=K; i++)
    {
        ll val=0;
        for(int nxt : adj[now])
        {
            if(nxt==bef) continue;
            val=max(val, dp1[nxt][i-1]);
            dp1[now][i]=max(dp1[now][i], dp1[nxt][i]);
        }
        dp1[now][i]=max(dp1[now][i], S[now]-P[bef]+val);
    }
}

vector<pll> V[MAXK+10];
void dfs2(int now, int bef)
{
    int i, j;

    for(i=0; i<=K; i++) V[i].clear();
    for(int nxt : adj[now])
    {
        if(nxt==bef) continue;
        for(i=0; i<=K; i++) V[i].push_back({dp1[nxt][i], nxt});
    }
    if(bef) for(i=0; i<=K; i++) V[i].push_back({dp2[bef][i], bef});
    for(i=0; i<=K; i++) sort(V[i].begin(), V[i].end(), greater<pll>());

    for(int nxt : adj[now])
    {
        if(nxt==bef) continue;
        for(i=1; i<=K; i++)
        {
            for(j=0; j<V[i].size(); j++)
            {
                if(V[i][j].second==nxt) continue;
                dp2[nxt][i]=max(dp2[nxt][i], V[i][j].first);
                break;
            }
            for(j=0; j<V[i-1].size(); j++)
            {
                if(V[i-1][j].second==nxt) continue;
                dp2[nxt][i]=max(dp2[nxt][i], V[i-1][j].first+S[now]-P[nxt]);
                break;
            }
        }
    }

    for(int nxt : adj[now])
    {
        if(nxt==bef) continue;
        dfs2(nxt, now);
    }
}

void dfs3(int now, int bef)
{
    for(int nxt : adj[now])
    {
        if(nxt==bef) continue;
        dfs3(nxt, now);
    }

    if(bef==0)
    {
        ans=max(ans, dp1[K]);
    }
    else
    {
        ll val1=0, val2=0;
        for(int nxt : adj[now])
        {
            if(nxt==bef) continue;
            val1=max(val1, dp1[nxt][K]);
        }
        val1=max(val1, dp2[now][K]);

        for(int nxt : adj[now])
        {
            if(nxt==bef) continue;
            val2=max(val2, dp1[nxt][K-1]);
        }
        val2=max(val2, dp2[now][K-1]);
        val2+=S[now];

        ans=max({ans, val1, val2});
    }
}

int main()
{
    int i, j, k;

    scanf("%d%d", &N, &K);
    for(i=1; i<=N; i++) scanf("%lld", &P[i]);
    for(i=1; i<N; i++)
    {
        int u, v;
        scanf("%d%d", &u, &v);
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    if(K==0) return !printf("0");

    dfs1(1, 0);
    dfs2(1, 0);
    dfs3(1, 0);
    printf("%lld", ans);
}

Compilation message

chase.cpp: In function 'void dfs1(int, int)':
chase.cpp:17:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
chase.cpp: In function 'void dfs2(int, int)':
chase.cpp:57:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(j=0; j<V[i].size(); j++)
                      ~^~~~~~~~~~~~
chase.cpp:63:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(j=0; j<V[i-1].size(); j++)
                      ~^~~~~~~~~~~~~~
chase.cpp: In function 'void dfs3(int, int)':
chase.cpp:89:28: error: no matching function for call to 'max(ll&, ll [110])'
         ans=max(ans, dp1[K]);
                            ^
In file included from /usr/include/c++/7/bits/char_traits.h:39:0,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/istream:38,
                 from /usr/include/c++/7/sstream:38,
                 from /usr/include/c++/7/complex:45,
                 from /usr/include/c++/7/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:52,
                 from chase.cpp:1:
/usr/include/c++/7/bits/stl_algobase.h:219:5: note: candidate: template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)
     max(const _Tp& __a, const _Tp& __b)
     ^~~
/usr/include/c++/7/bits/stl_algobase.h:219:5: note:   template argument deduction/substitution failed:
chase.cpp:89:28: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'll [110] {aka long long int [110]}')
         ans=max(ans, dp1[K]);
                            ^
In file included from /usr/include/c++/7/bits/char_traits.h:39:0,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/istream:38,
                 from /usr/include/c++/7/sstream:38,
                 from /usr/include/c++/7/complex:45,
                 from /usr/include/c++/7/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:52,
                 from chase.cpp:1:
/usr/include/c++/7/bits/stl_algobase.h:265:5: note: candidate: template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)
     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
     ^~~
/usr/include/c++/7/bits/stl_algobase.h:265:5: note:   template argument deduction/substitution failed:
chase.cpp:89:28: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'll [110] {aka long long int [110]}')
         ans=max(ans, dp1[K]);
                            ^
In file included from /usr/include/c++/7/algorithm:62:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:65,
                 from chase.cpp:1:
/usr/include/c++/7/bits/stl_algo.h:3462:5: note: candidate: template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)
     max(initializer_list<_Tp> __l)
     ^~~
/usr/include/c++/7/bits/stl_algo.h:3462:5: note:   template argument deduction/substitution failed:
chase.cpp:89:28: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
         ans=max(ans, dp1[K]);
                            ^
In file included from /usr/include/c++/7/algorithm:62:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:65,
                 from chase.cpp:1:
/usr/include/c++/7/bits/stl_algo.h:3468:5: note: candidate: template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)
     max(initializer_list<_Tp> __l, _Compare __comp)
     ^~~
/usr/include/c++/7/bits/stl_algo.h:3468:5: note:   template argument deduction/substitution failed:
chase.cpp:89:28: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
         ans=max(ans, dp1[K]);
                            ^
chase.cpp: In function 'int main()':
chase.cpp:115:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j, k;
            ^
chase.cpp:115:15: warning: unused variable 'k' [-Wunused-variable]
     int i, j, k;
               ^
chase.cpp:117:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &K);
     ~~~~~^~~~~~~~~~~~~~~~
chase.cpp:118:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=N; i++) scanf("%lld", &P[i]);
                         ~~~~~^~~~~~~~~~~~~~~
chase.cpp:122:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &u, &v);
         ~~~~~^~~~~~~~~~~~~~~~