| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 580903 |
2022-06-22T05:53:06 Z |
조영욱(#8362) |
Beads and wires (APIO14_beads) |
C++17 |
|
15 ms |
28176 KB |
#include <bits/stdc++.h>
using namespace std;
int n;
typedef pair<int,int> P;
vector<P> adj[200001];
long long dp[200001][2];
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) {
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,0),ans(son[v][i].first,1)+son[v][i].second);
if (mx1<son[v][i].second+ans(son[v][i].first,0)-max(ans(son[v][i].first,0),ans(son[v][i].first,1)+son[v][i].second)) {
mx2=mx1;
mx1=son[v][i].second+ans(son[v][i].first,0)-max(ans(son[v][i].first,0),ans(son[v][i].first,1)+son[v][i].second);
}
else if (mx2<son[v][i].second+ans(son[v][i].first,0)-max(ans(son[v][i].first,0),ans(son[v][i].first,1)+son[v][i].second)) {
mx2=son[v][i].second+ans(son[v][i].first,0)-max(ans(son[v][i].first,0),ans(son[v][i].first,1)+son[v][i].second);
}
}
if (mx1+mx2>0) {
ret+=mx1+mx2;
}
return dp[v][type]=ret;
}
long long mx=nn;
long long ret=0;
for(int i=0;i<son[v].size();i++) {
ret+=max(ans(son[v][i].first,0),ans(son[v][i].first,1)+son[v][i].second);
if (mx<son[v][i].second+ans(son[v][i].first,0)-max(ans(son[v][i].first,0),ans(son[v][i].first,1)+son[v][i].second)) {
mx=son[v][i].second+ans(son[v][i].first,0)-max(ans(son[v][i].first,0),ans(son[v][i].first,1)+son[v][i].second);
}
}
return dp[v][type]=ret+mx;
}
int dp1[9][512][1024];
typedef pair<P,int> Pi;
vector<Pi> edge;
int ans1(int ind,int ebit,int vbit) {
if (ind==n-1) {
return 0;
}
if (dp1[ind][ebit][vbit]!=-1) {
return dp1[ind][ebit][vbit];
}
if (ebit&(1<<ind)) {
}
else {
return 0;
}
int ret=ans1(ind+1,ebit,vbit);
for(int i=0;i<edge.size();i++) {
if (ebit&(1<<i)) {
if (i==ind){
continue;
}
int same=-1;
if (edge[ind].first.first==edge[i].first.first||edge[ind].first.first==edge[i].first.second) {
same=edge[ind].first.first;
}
if (edge[ind].first.second==edge[i].first.first||edge[ind].first.second==edge[i].first.second) {
same=edge[ind].first.second;
}
if (same!=-1) {
if (vbit&(1<<same)) {
ret=max(ret,ans1(ind+1,ebit-(1<<i)-(1<<ind),vbit-(1<<same))+edge[i].second+edge[ind].second);
}
}
}
}
return dp1[ind][ebit][vbit]=ret;
}
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));
edge.push_back(Pi(P(u,v),w));
}
for(int i=0;i<=n;i++) {
dp[i][0]=nnn;
dp[i][1]=nnn;
}
dfs(0,-1);
memset(dp1,-1,sizeof(dp1));
//printf("%lld",ans(1,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:30: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]
30 | for(int i=0;i<son[v].size();i++) {
| ~^~~~~~~~~~~~~~
beads.cpp:47: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]
47 | for(int i=0;i<son[v].size();i++) {
| ~^~~~~~~~~~~~~~
beads.cpp: In function 'int ans1(int, int, int)':
beads.cpp:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
74 | for(int i=0;i<edge.size();i++) {
| ~^~~~~~~~~~~~
beads.cpp: In function 'int main()':
beads.cpp:97:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
97 | scanf("%d",&n);
| ~~~~~^~~~~~~~~
beads.cpp:100:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
100 | scanf("%d %d %d",&u,&v,&w);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
28156 KB |
Output is correct |
| 2 |
Correct |
15 ms |
28112 KB |
Output is correct |
| 3 |
Correct |
12 ms |
28116 KB |
Output is correct |
| 4 |
Correct |
12 ms |
28116 KB |
Output is correct |
| 5 |
Correct |
13 ms |
28176 KB |
Output is correct |
| 6 |
Incorrect |
14 ms |
28104 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
28156 KB |
Output is correct |
| 2 |
Correct |
15 ms |
28112 KB |
Output is correct |
| 3 |
Correct |
12 ms |
28116 KB |
Output is correct |
| 4 |
Correct |
12 ms |
28116 KB |
Output is correct |
| 5 |
Correct |
13 ms |
28176 KB |
Output is correct |
| 6 |
Incorrect |
14 ms |
28104 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
28156 KB |
Output is correct |
| 2 |
Correct |
15 ms |
28112 KB |
Output is correct |
| 3 |
Correct |
12 ms |
28116 KB |
Output is correct |
| 4 |
Correct |
12 ms |
28116 KB |
Output is correct |
| 5 |
Correct |
13 ms |
28176 KB |
Output is correct |
| 6 |
Incorrect |
14 ms |
28104 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
28156 KB |
Output is correct |
| 2 |
Correct |
15 ms |
28112 KB |
Output is correct |
| 3 |
Correct |
12 ms |
28116 KB |
Output is correct |
| 4 |
Correct |
12 ms |
28116 KB |
Output is correct |
| 5 |
Correct |
13 ms |
28176 KB |
Output is correct |
| 6 |
Incorrect |
14 ms |
28104 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
