oj.uz

Submission #33634

# Submission time Handle Problem Language Result Execution time Memory
33634 2017-10-31T04:18:24 Z comtalyst Beads and wires (APIO14_beads) C++14
100 / 100
 240 ms 23612 KB 
/*
 *	Task: apio14_beads
 *	Lang: C/C++11
 *	Author: comtalyst
 *	Site: oj.uz
 *	Last Update: 31/10/2017
 */

#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
using namespace std;

/* Note
----------------------------
Learned : 
Bugs found & solved :
- bad state definition (many subbugs)
Optimizations :
----------------------------
0 = Void 	[0],[1]
1 = Core 	[0]
2 = Halfcore with void 	[0],[1]
3 = Halfcore with core 	[0]
Every Core must match with Void+Void or Core+Void
3rd state : can this joints to dad node? (joint = connect by it, not its dad)
*/	

#define x first
#define y second
#define umap unordered_map
#define pqueue priority_queue
#define mset multiset
#define mp make_pair
#define mt make_tuple
#define long long long
#define MOD 1000000007
#define MAX (int)1e9
#define MIN (int)-1e9
#define FILEIN_ freopen("__in.txt","r",stdin)
#define FILEOUT_ freopen("__out.txt","w",stdout)
#define FILEIN(text) freopen(text,"r",stdin)
#define FILEOUT(text) freopen(text,"w",stdout)

int data[200005][4][2];
vector<pair<int,int>> adl[200005];
int dp(int x,int f){
	int i,y,w,sxc=0,sxc2=0,v;
	pair<int,int> mxv01={MIN,MIN},mxv02={MIN,MIN},mxc1={MIN,MIN},mxc2={MIN,MIN},mxd={MIN,MIN},mxv11={MIN,MIN},mxv12={MIN,MIN};
	for(i = 0; i < adl[x].size(); i++){
		y = adl[x][i].x;
		w = adl[x][i].y;
		if(y == f) continue;
		dp(y,x);
	}
	for(i = 0; i < adl[x].size(); i++){
		y = adl[x][i].x;
		w = adl[x][i].y;
		if(y == f) continue;
		v = max(data[y][0][1],data[y][2][1]+w);
		data[x][0][1] += v;
		if(max(data[y][0][0],max(data[y][1][0],max(data[y][2][0]+w,data[y][3][0]+w))) -v > mxd.x){
			mxd = {max(data[y][0][0],max(data[y][1][0],max(data[y][2][0]+w,data[y][3][0]+w))) -v,y};
		}
	}
	data[x][0][0] = data[x][0][1]+mxd.x;
	for(i = 0; i < adl[x].size(); i++){
		y = adl[x][i].x;
		w = adl[x][i].y;
		if(y == f) continue;
		v = max(data[y][0][1],data[y][2][1]+w);
		data[x][1][0] += v;
		data[x][2][0] += v;
		data[x][2][1] += v;
		data[x][3][0] += v;
		if(data[y][0][0]+w -v > mxv01.x){
			mxv02 = mxv01;
			mxv01 = {data[y][0][0]+w -v,y};
		}
		else if(data[y][0][0]+w -v > mxv02.x){
			mxv02 = {data[y][0][0]+w -v,y};
		}
		if(data[y][0][1]+w -v > mxv11.x){
			mxv12 = mxv11;
			mxv11 = {data[y][0][1]+w -v,y};
		}
		else if(data[y][0][1]+w -v > mxv12.x){
			mxv12 = {data[y][0][1]+w -v,y};
		}
		if(data[y][1][0]+w -v > mxc1.x){
			mxc2 = mxc1;
			mxc1 = {data[y][1][0]+w -v,y};
		}
		else if(data[y][1][0]+w -v > mxc2.x){
			mxc2 = {data[y][1][0]+w -v,y};
		}
	}
	if(mxv11.y == mxc1.y){
		if(mxv11.y == mxv01.y){
			data[x][1][0] = data[x][1][0]+max(max(mxv11.x+mxv12.x,max(mxv11.x+mxv02.x,mxv12.x+mxv01.x)),max(mxv11.x+mxc2.x,mxv12.x+mxc1.x));
		}
		else{
			data[x][1][0] = data[x][1][0]+max(max(mxv11.x+mxv12.x,mxv11.x+mxv01.x),max(mxv11.x+mxc2.x,mxv12.x+mxc1.x));
		}
	}
	else{
		if(mxv11.y == mxv01.y){
			data[x][1][0] = data[x][1][0]+max(max(mxv11.x+mxv12.x,max(mxv11.x+mxv02.x,mxv12.x+mxv01.x)),mxv11.x+mxc1.x);
		}
		else{
			data[x][1][0] = data[x][1][0]+max(max(mxv11.x+mxv12.x,mxv11.x+mxv01.x),mxv11.x+mxc1.x);
		}
	}
	data[x][2][0] += mxv01.x;
	data[x][2][1] += mxv11.x;
	data[x][3][0] += mxc1.x;

	//printf("%d :\n%d %d %d %d\n%d %d %d %d\n",x,mxe1,mxe2,mxd1,mxd2,data[x][0],data[x][1],data[x][2],data[x][4]);
}

main(){
	int t,i,j,n,m,x,y,w;
	
	//FILEIN_;
	//FILEOUT_;

	scanf("%d",&n);
	for(i = 1; i < n; i++){
		scanf("%d %d %d",&x,&y,&w);
		adl[x].emplace_back(y,w);
		adl[y].emplace_back(x,w);
	}
	dp(1,0);
	printf("%d\n",max(max(data[1][0][0],data[1][0][1]),data[1][1][0]));

	return 0;	
}

Compilation message

beads.cpp: In function 'int dp(int, int)':
beads.cpp:49:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i = 0; i < adl[x].size(); i++){
             ~~^~~~~~~~~~~~~~~
beads.cpp:55:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i = 0; i < adl[x].size(); i++){
             ~~^~~~~~~~~~~~~~~
beads.cpp:66:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i = 0; i < adl[x].size(); i++){
             ~~^~~~~~~~~~~~~~~
beads.cpp:47:12: warning: unused variable 'sxc' [-Wunused-variable]
  int i,y,w,sxc=0,sxc2=0,v;
            ^~~
beads.cpp:47:18: warning: unused variable 'sxc2' [-Wunused-variable]
  int i,y,w,sxc=0,sxc2=0,v;
                  ^~~~
beads.cpp:118:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
beads.cpp: At global scope:
beads.cpp:120:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
beads.cpp: In function 'int main()':
beads.cpp:121:6: warning: unused variable 't' [-Wunused-variable]
  int t,i,j,n,m,x,y,w;
      ^
beads.cpp:121:10: warning: unused variable 'j' [-Wunused-variable]
  int t,i,j,n,m,x,y,w;
          ^
beads.cpp:121:14: warning: unused variable 'm' [-Wunused-variable]
  int t,i,j,n,m,x,y,w;
              ^
beads.cpp:126:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
beads.cpp:128:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&x,&y,&w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct
14 Correct 6 ms 4992 KB Output is correct
15 Correct 5 ms 4992 KB Output is correct
16 Correct 5 ms 4992 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 5 ms 5120 KB Output is correct
19 Correct 6 ms 5092 KB Output is correct
20 Correct 6 ms 5120 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 5 ms 4992 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct
14 Correct 6 ms 4992 KB Output is correct
15 Correct 5 ms 4992 KB Output is correct
16 Correct 5 ms 4992 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 5 ms 5120 KB Output is correct
19 Correct 6 ms 5092 KB Output is correct
20 Correct 6 ms 5120 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 5 ms 4992 KB Output is correct
23 Correct 8 ms 5376 KB Output is correct
24 Correct 26 ms 5412 KB Output is correct
25 Correct 9 ms 5324 KB Output is correct
26 Correct 12 ms 5632 KB Output is correct
27 Correct 12 ms 5732 KB Output is correct
28 Correct 12 ms 5760 KB Output is correct
29 Correct 11 ms 5732 KB Output is correct
30 Correct 11 ms 5732 KB Output is correct
31 Correct 12 ms 6144 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 6 ms 4992 KB Output is correct
3 Correct 6 ms 4992 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 6 ms 4992 KB Output is correct
7 Correct 6 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 4992 KB Output is correct
11 Correct 6 ms 4992 KB Output is correct
12 Correct 6 ms 4992 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct
14 Correct 6 ms 4992 KB Output is correct
15 Correct 5 ms 4992 KB Output is correct
16 Correct 5 ms 4992 KB Output is correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 5 ms 5120 KB Output is correct
19 Correct 6 ms 5092 KB Output is correct
20 Correct 6 ms 5120 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 5 ms 4992 KB Output is correct
23 Correct 8 ms 5376 KB Output is correct
24 Correct 26 ms 5412 KB Output is correct
25 Correct 9 ms 5324 KB Output is correct
26 Correct 12 ms 5632 KB Output is correct
27 Correct 12 ms 5732 KB Output is correct
28 Correct 12 ms 5760 KB Output is correct
29 Correct 11 ms 5732 KB Output is correct
30 Correct 11 ms 5732 KB Output is correct
31 Correct 12 ms 6144 KB Output is correct
32 Correct 41 ms 8476 KB Output is correct
33 Correct 38 ms 8496 KB Output is correct
34 Correct 42 ms 8568 KB Output is correct
35 Correct 228 ms 18808 KB Output is correct
36 Correct 218 ms 18896 KB Output is correct
37 Correct 240 ms 18844 KB Output is correct
38 Correct 170 ms 19248 KB Output is correct
39 Correct 168 ms 19156 KB Output is correct
40 Correct 229 ms 19040 KB Output is correct
41 Correct 237 ms 23612 KB Output is correct