| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 581029 |
2022-06-22T08:33:23 Z |
조영욱(#8362) |
Beads and wires (APIO14_beads) |
C++17 |
|
7 ms |
9684 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());
vector<long long> temp2(son[v].size());
int ind01=0;
int ind02=0;
int ind21=0;
int ind22=0;
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 (son[v].size()>=2) {
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:34: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]
34 | for(int i=0;i<son[v].size();i++) {
| ~^~~~~~~~~~~~~~
beads.cpp:39: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]
39 | for(int i=0;i<son[v].size();i++) {
| ~^~~~~~~~~~~~~~
beads.cpp:67: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]
67 | for(int i=0;i<son[v].size();i++) {
| ~^~~~~~~~~~~~~~
beads.cpp:78: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]
78 | for(int i=0;i<son[v].size();i++) {
| ~^~~~~~~~~~~~~~
beads.cpp:75:19: warning: unused variable 'mx1' [-Wunused-variable]
75 | long long mx1=nn;
| ^~~
beads.cpp:76:19: warning: unused variable 'mx2' [-Wunused-variable]
76 | long long mx2=nn;
| ^~~
beads.cpp:86: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]
86 | for(int i=0;i<son[v].size();i++) {
| ~^~~~~~~~~~~~~~
beads.cpp:94: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]
94 | for(int i=0;i<son[v].size();i++) {
| ~^~~~~~~~~~~~~~
beads.cpp: In function 'int main()':
beads.cpp:104:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
104 | scanf("%d",&n);
| ~~~~~^~~~~~~~~
beads.cpp:107:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
107 | scanf("%d %d %d",&u,&v,&w);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
9684 KB |
Output is correct |
| 2 |
Correct |
7 ms |
9684 KB |
Output is correct |
| 3 |
Incorrect |
5 ms |
9684 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
9684 KB |
Output is correct |
| 2 |
Correct |
7 ms |
9684 KB |
Output is correct |
| 3 |
Incorrect |
5 ms |
9684 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
9684 KB |
Output is correct |
| 2 |
Correct |
7 ms |
9684 KB |
Output is correct |
| 3 |
Incorrect |
5 ms |
9684 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
9684 KB |
Output is correct |
| 2 |
Correct |
7 ms |
9684 KB |
Output is correct |
| 3 |
Incorrect |
5 ms |
9684 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
