oj.uz

답안 #581034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
581034 2022-06-22T08:38:34 Z 조영욱(#8362) 구슬과 끈 (APIO14_beads) C++17
100 / 100
 369 ms 38144 KB 
#include <bits/stdc++.h>
using namespace std;

int n;
typedef pair<int,int> P;
vector<P> adj[200001];
long long dp[200001][4];
vector<P> son[200001];
const long long nnn=-1e16;
const long long nn=-1e12-7;

void dfs(int v,int prev) {
    for(int i=0;i<adj[v].size();i++) {
        P nt=adj[v][i];
        if (nt.first!=prev) {
            son[v].push_back(nt);
            dfs(nt.first,v);
        }
    }
}

long long ans(int v,int type) {
    if (dp[v][type]!=nnn) {
        return dp[v][type];
    }
    if (type==0) {
        vector<long long> temp0(son[v].size()+2);
        vector<long long> temp2(son[v].size()+2);
        temp0[son[v].size()]=nn;
        temp0[son[v].size()+1]=nn;
        temp2[son[v].size()]=nn;
        temp2[son[v].size()+1]=nn;
        int ind01=son[v].size();
        int ind02=son[v].size()+1;
        int ind21=son[v].size();
        int ind22=son[v].size()+1;
        long long ret=0;
        for(int i=0;i<son[v].size();i++) {
            ret+=max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second);
            temp0[i]=son[v][i].second+ans(son[v][i].first,0)-max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second);
            temp2[i]=son[v][i].second+ans(son[v][i].first,2)-max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second);
        }
        for(int i=0;i<son[v].size();i++) {
            if (temp0[i]>temp0[ind01]) {
                ind02=ind01;
                ind01=i;
            }
            else if (temp0[i]>temp0[ind02]) {
                ind02=i;
            }
            if (temp2[i]>temp2[ind21]) {
                ind22=ind21;
                ind21=i;
            }
            else if (temp2[i]>temp2[ind22]) {
                ind22=i;
            }
        }
        long long mxv=nn;
        if (ind01!=ind21) {
            mxv=temp0[ind01]+temp2[ind21];
        }
        else {
            mxv=max(temp0[ind01]+temp2[ind22],temp0[ind02]+temp2[ind21]);
        }
        ret+=mxv;
        long long val=0;
        long long mx=0;
        for(int i=0;i<son[v].size();i++) {
            val+=max({ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second});
            mx=max(mx,max(ans(son[v][i].first,0),ans(son[v][i].first,1)+son[v][i].second)-max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second));
        }
        ret=max(ret,val+mx);
        return dp[v][type]=ret;
    }
    if (type==2){
        long long mx1=nn;
        long long mx2=nn;
        long long ret=0;
        for(int i=0;i<son[v].size();i++) {
            ret+=max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second);
        }
        return dp[v][type]=ret;
    }
    if (type==3) {
        long long mx=nn;
        long long ret=0;
        for(int i=0;i<son[v].size();i++) {
            ret+=max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second);
            mx=max(mx,ans(son[v][i].first,2)+son[v][i].second-max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second));
        }
        return dp[v][type]=ret+mx;
    }
    long long mx=nn;
    long long ret=0;
    for(int i=0;i<son[v].size();i++) {
        ret+=max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second);
        if (mx<son[v][i].second+ans(son[v][i].first,0)-max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second)) {
            mx=son[v][i].second+ans(son[v][i].first,0)-max(ans(son[v][i].first,2),ans(son[v][i].first,3)+son[v][i].second);
        }
    }
    return dp[v][type]=ret+mx;
}

int main(void) {
    scanf("%d",&n);
    for(int i=1;i<n;i++) {
        int u,v,w;
        scanf("%d %d %d",&u,&v,&w);
        u--;
        v--;
        adj[u].push_back(P(v,w));
        adj[v].push_back(P(u,w));
    }
    for(int i=0;i<=n;i++) {
        dp[i][0]=nnn;
        dp[i][1]=nnn;
        dp[i][2]=nnn;
        dp[i][3]=nnn;
    }
    dfs(0,-1);
    printf("%lld",ans(0,0));
    //printf("%d",ans1(0,(1<<(n-1))-1,(1<<n)-1));
}

Compilation message

beads.cpp: In function 'void dfs(int, int)':
beads.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i=0;i<adj[v].size();i++) {
      |                 ~^~~~~~~~~~~~~~
beads.cpp: In function 'long long int ans(int, int)':
beads.cpp:38:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for(int i=0;i<son[v].size();i++) {
      |                     ~^~~~~~~~~~~~~~
beads.cpp:43:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for(int i=0;i<son[v].size();i++) {
      |                     ~^~~~~~~~~~~~~~
beads.cpp:69:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for(int i=0;i<son[v].size();i++) {
      |                     ~^~~~~~~~~~~~~~
beads.cpp:80:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for(int i=0;i<son[v].size();i++) {
      |                     ~^~~~~~~~~~~~~~
beads.cpp:77:19: warning: unused variable 'mx1' [-Wunused-variable]
   77 |         long long mx1=nn;
      |                   ^~~
beads.cpp:78:19: warning: unused variable 'mx2' [-Wunused-variable]
   78 |         long long mx2=nn;
      |                   ^~~
beads.cpp:88:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |         for(int i=0;i<son[v].size();i++) {
      |                     ~^~~~~~~~~~~~~~
beads.cpp:96:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |     for(int i=0;i<son[v].size();i++) {
      |                 ~^~~~~~~~~~~~~~
beads.cpp: In function 'int main()':
beads.cpp:106:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
beads.cpp:109:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  109 |         scanf("%d %d %d",&u,&v,&w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9644 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 8 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9600 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 8 ms 9684 KB Output is correct
12 Correct 6 ms 9660 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9644 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 8 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9600 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 8 ms 9684 KB Output is correct
12 Correct 6 ms 9660 KB Output is correct
13 Correct 6 ms 9640 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 8 ms 9684 KB Output is correct
16 Correct 8 ms 9684 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 6 ms 9700 KB Output is correct
19 Correct 8 ms 9704 KB Output is correct
20 Correct 8 ms 9684 KB Output is correct
21 Correct 8 ms 9700 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9644 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 8 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9600 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 8 ms 9684 KB Output is correct
12 Correct 6 ms 9660 KB Output is correct
13 Correct 6 ms 9640 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 8 ms 9684 KB Output is correct
16 Correct 8 ms 9684 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 6 ms 9700 KB Output is correct
19 Correct 8 ms 9704 KB Output is correct
20 Correct 8 ms 9684 KB Output is correct
21 Correct 8 ms 9700 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 13 ms 10172 KB Output is correct
24 Correct 10 ms 10132 KB Output is correct
25 Correct 12 ms 10068 KB Output is correct
26 Correct 18 ms 10488 KB Output is correct
27 Correct 14 ms 10580 KB Output is correct
28 Correct 12 ms 10616 KB Output is correct
29 Correct 12 ms 10580 KB Output is correct
30 Correct 11 ms 10580 KB Output is correct
31 Correct 14 ms 11476 KB Output is correct

Subtask #4
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9644 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 8 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 5 ms 9600 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 7 ms 9684 KB Output is correct
11 Correct 8 ms 9684 KB Output is correct
12 Correct 6 ms 9660 KB Output is correct
13 Correct 6 ms 9640 KB Output is correct
14 Correct 7 ms 9684 KB Output is correct
15 Correct 8 ms 9684 KB Output is correct
16 Correct 8 ms 9684 KB Output is correct
17 Correct 8 ms 9684 KB Output is correct
18 Correct 6 ms 9700 KB Output is correct
19 Correct 8 ms 9704 KB Output is correct
20 Correct 8 ms 9684 KB Output is correct
21 Correct 8 ms 9700 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 13 ms 10172 KB Output is correct
24 Correct 10 ms 10132 KB Output is correct
25 Correct 12 ms 10068 KB Output is correct
26 Correct 18 ms 10488 KB Output is correct
27 Correct 14 ms 10580 KB Output is correct
28 Correct 12 ms 10616 KB Output is correct
29 Correct 12 ms 10580 KB Output is correct
30 Correct 11 ms 10580 KB Output is correct
31 Correct 14 ms 11476 KB Output is correct
32 Correct 49 ms 14028 KB Output is correct
33 Correct 72 ms 14156 KB Output is correct
34 Correct 53 ms 14052 KB Output is correct
35 Correct 266 ms 27160 KB Output is correct
36 Correct 291 ms 27176 KB Output is correct
37 Correct 294 ms 27072 KB Output is correct
38 Correct 273 ms 28740 KB Output is correct
39 Correct 258 ms 28764 KB Output is correct
40 Correct 252 ms 28424 KB Output is correct
41 Correct 369 ms 38144 KB Output is correct