oj.uz

Submission #114194

# Submission time Handle Problem Language Result Execution time Memory
114194 2019-05-31T08:50:15 Z dorijanlendvaj Beads and wires (APIO14_beads) C++14
0 / 100
 9 ms 7424 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back

using namespace std;
using namespace __gnu_pbds;

typedef long long int ll;
typedef unsigned long long int ull;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w)
{
	cout<<w.size()<<endl;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<endl;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=10;
		k+=a[i]-'0';
	}
	return k;
}

string its(ll k)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%10)+'0');
		k/=10;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

ll has(string x)
{
	ll h1=0,h2=0;
	x=to_lower(x);
	for (char a: x)
	{
		h1*=bases[0];
		h1+=a-'a';
		h1%=bases[3];
		h2*=bases[1];
		h2+=a-'a';
		h2%=bases[4];
	}
	return h1*(MOD+13893829)+h2;
}

const int N=300010;
int n,par[N],dp[3][N],l[N];
vector<pii> ch[N];
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};

void dfs(int i)
{
	vector<int> s;
	int su=0;
	for (auto d: ch[i])
	{
		if (d.x==par[i]) continue;
		par[d.x]=i;
		l[d.x]=d.y;
		dfs(d.x);
		su+=max(dp[2][d.x],max(dp[1][d.x],dp[0][d.x]));
		s.pb(d.y-max(0,dp[2][d.x]-max(dp[1][d.x],dp[0][d.x])));
	}
	sort(s.begin(),s.end());
	reverse(s.begin(),s.end());
	dp[0][i]=su;
	if (s.size()>=2) dp[1][i]=su+s[0]+s[1];
	if (s.size()>=1) dp[2][i]=su+l[i]+s[0];
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back((rand()%MOD+13893829)%MOD);
	cin>>n;
	par[1]=-1;
	l[1]=-MOD;
	for (int i=1;i<n;++i)
	{
		int a,b,c;
		cin>>a>>b>>c;
		ch[a].pb({b,c});
		ch[b].pb({a,c});
	}
	dfs(1);
	cout<<max(max(dp[0][1],dp[1][1]),dp[2][1]);
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7424 KB Output is correct
2 Correct 7 ms 7396 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 7 ms 7424 KB Output is correct
5 Correct 8 ms 7424 KB Output is correct
6 Incorrect 7 ms 7408 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7424 KB Output is correct
2 Correct 7 ms 7396 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 7 ms 7424 KB Output is correct
5 Correct 8 ms 7424 KB Output is correct
6 Incorrect 7 ms 7408 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7424 KB Output is correct
2 Correct 7 ms 7396 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 7 ms 7424 KB Output is correct
5 Correct 8 ms 7424 KB Output is correct
6 Incorrect 7 ms 7408 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7424 KB Output is correct
2 Correct 7 ms 7396 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 7 ms 7424 KB Output is correct
5 Correct 8 ms 7424 KB Output is correct
6 Incorrect 7 ms 7408 KB Output isn't correct
7 Halted 0 ms 0 KB -