oj.uz

답안 #146869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146869 2019-08-26T12:24:17 Z MvC 구슬과 끈 (APIO14_beads) C++11
28 / 100
 234 ms 5376 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=2e5+50;
const int mod=1e9+7;
using namespace std;
int n,i,x,y,j;
int c,f[nmax][2],rs;
vector<pair<int,int> >a[nmax];
vector<int>id;
void dfs(int x,int p)
{
	f[x][1]=f[x][0]=0;
	for(int i=0;i<a[x].size();i++)
	{
		int y=a[x][i].fr;
		int c=a[x][i].sc;
		if(y==p)continue;
		dfs(y,x);
		if(a[y].size()>1)f[x][0]+=max(f[y][0],f[y][1]+c);
		else f[x][0]+=f[y][0];
	}
	for(int i=0;i<a[x].size();i++)
	{
		int y=a[x][i].fr,c=a[x][i].sc;
		if(y==p)continue;
		if(a[y].size()>1)f[x][1]=max(f[x][1],f[x][0]-max(f[y][0],f[y][1]+c)+f[y][0]+c);
		else f[x][1]=max(f[x][1],f[x][0]+c);
	}
	//cout<<x<<" "<<f[x][0]<<" "<<f[x][1]<<endl;
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<n;i++)
	{
		cin>>x>>y>>c;
		a[x].pb(mkp(y,c));
		a[y].pb(mkp(x,c));
	}
	for(i=1;i<=n;i++)id.pb(i);
	shuffle(id.begin(),id.end(),rng);
	for(i=0;i<min(n,1000);i++)
	{
		dfs(id[i],0);
		rs=max(f[id[i]][0],rs);
		//if((double)clock()/CLOCKS_PER_SEC>0.970)break;
	}
	cout<<rs<<endl;
	return 0;
}

Compilation message

beads.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
beads.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
 
beads.cpp: In function 'void dfs(int, int)':
beads.cpp:29:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<a[x].size();i++)
              ~^~~~~~~~~~~~
beads.cpp:38:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<a[x].size();i++)
              ~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 7 ms 4984 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 7 ms 4984 KB Output is correct
15 Correct 7 ms 4984 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 7 ms 5108 KB Output is correct
18 Correct 7 ms 4988 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 7 ms 4984 KB Output is correct
21 Correct 8 ms 5072 KB Output is correct
22 Correct 8 ms 5112 KB Output is correct

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 7 ms 4984 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 7 ms 4984 KB Output is correct
15 Correct 7 ms 4984 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 7 ms 5108 KB Output is correct
18 Correct 7 ms 4988 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 7 ms 4984 KB Output is correct
21 Correct 8 ms 5072 KB Output is correct
22 Correct 8 ms 5112 KB Output is correct
23 Correct 231 ms 5376 KB Output is correct
24 Correct 234 ms 5368 KB Output is correct
25 Incorrect 231 ms 5368 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 7 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 4984 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 7 ms 4984 KB Output is correct
12 Correct 7 ms 5112 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 7 ms 4984 KB Output is correct
15 Correct 7 ms 4984 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 7 ms 5108 KB Output is correct
18 Correct 7 ms 4988 KB Output is correct
19 Correct 7 ms 5112 KB Output is correct
20 Correct 7 ms 4984 KB Output is correct
21 Correct 8 ms 5072 KB Output is correct
22 Correct 8 ms 5112 KB Output is correct
23 Correct 231 ms 5376 KB Output is correct
24 Correct 234 ms 5368 KB Output is correct
25 Incorrect 231 ms 5368 KB Output isn't correct
26 Halted 0 ms 0 KB -