Submission #246936

#	Time	Username	Problem	Language	Result	Execution time	Memory
246936		dorijanlendvaj	Toll (APIO13_toll)	C++14	16 / 100	9 ms	7552 KiB

toll

//DUEL
#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
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
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,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

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();
}

void compress(vi&v)
{
	set<int> s;
	for (auto a: v) s.insert(a);
	vi o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

void compress(vl&v)
{
	set<ll> s;
	for (auto a: v) s.insert(a);
	vl o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

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,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	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;
}

const int N=300010;
int n,m,k,a[N],b[N],par[N];
vector<pii> ch[N];
vector<pair<int,vector<pii>>> po;
ll si[N],ss[N],x[N],re,ma;
vi co;

int find(int i)
{
	if (i==par[i]) return i;
	return par[i]=find(par[i]);
}

void merge(int i,int j)
{
	i=find(i);
	j=find(j);
	par[i]=j;
	si[j]+=si[i];
}

void dfs(int i,int p=-1)
{
	ss[i]=si[i];
	for (auto d: ch[i]) if (d.x!=p)
	{
		dfs(d.x,i);
		ss[i]+=ss[d.x];
		re+=ss[d.x]*d.y;
		//cout<<i<<' '<<d.x<<' '<<ss[d.x]<<en;
	}
}

void wor(int r)
{
	re=0;
	dfs(r);
	ma=max(ma,re);
}

void rek(int i)
{
	if (i==po.size())
	{
		wor(find(1));
		return;
	}
	auto v=po[i].y;
	for (int j=0;j<(int)v.size()-1;++j)
	{
		int a=find(v[j].x),b=find(v[j].y);
		ch[a].eb(b,po[i].x);
		ch[b].eb(a,po[i].x);
		rek(i+1);
		eras(ch[a],mp(b,po[i].x));
		eras(ch[b],mp(a,po[i].x));
	}
	int a=find(v.back().x),b=find(v.back().y);
	ch[a].eb(b,0);
	ch[b].eb(a,0);
	rek(i+1);
	eras(ch[a],mp(b,0));
	eras(ch[b],mp(a,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*2)[phone]);
	cin>>n>>m>>k;
	vector<pair<int,pii>> ed;
	while (m--)
	{
		int a,b,c;
		cin>>a>>b>>c;
		ed.eb(c,mp(a,b));
	}
	sort(all(ed));
	for (int i=0;i<k;++i) cin>>a[i]>>b[i];
	for (int i=1;i<=n;++i)
	{
		cin>>x[i];
		par[i]=i;
	}
	vector<pii> fin;
	for (auto z: ed)
	{
		if (find(z.y.x)==find(z.y.y)) continue;
		vector<pii> cand;
		pii zy={find(z.y.x),find(z.y.y)};
		for (int i=0;i<k;++i)
		{
			//cout<<zy.x<<' '<<zy.y<<' '<<find(a[i])<<' '<<find(b[i])<<en;
			if (zy==mp(find(a[i]),find(b[i])) || zy==mp(find(b[i]),find(a[i]))) cand.eb(a[i],b[i]);
		}
		if (cand.size())
		{
			cand.pb(z.y);
			po.eb(z.x,cand);
		}
		else fin.pb(z.y);
		merge(z.y.x,z.y.y);
	}
	for (int i=1;i<=n;++i) par[i]=i,si[i]=x[i];
	for (auto a: fin)
	{
		merge(a.x,a.y);
		//cout<<a.x<<' '<<a.y<<en;
	}
	/*for (auto a: po)
	{
		cout<<a.x<<en;
		for (auto b: a.y) cout<<b.x<<' '<<b.y<<en;
	}*/
	rek(0);
	cout<<ma;
}

Compilation message (stderr)

toll.cpp: In function 'void rek(int)':
toll.cpp:244:7: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (i==po.size())
      ~^~~~~~~~~~~

• Subtask 1: 16 / 16
• Subtask 2: 0 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 22
• Subtask 5: 0 / 22