| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 947395 |
2024-03-16T05:55:30 Z |
parlimoos |
Toll (APIO13_toll) |
C++14 |
|
12 ms |
2396 KB |
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define cl clear
#define bg begin
#define arr(x) array<int , x>
#define endl '\n'
int n , m , k;
vector<arr(3)> mst , cnds , uss;
vector<int> a , bckis;
vector<arr(2)> adds;
ll dsu[100000][2] , mem[100000] , bck[100000][2];
bool dsumd = 0;
multiset<int> ms;
void init(){
for(int v = 0 ; v < n ; v++) dsu[v][0] = -1 , dsu[v][1] = a[v] , bck[v][0] = -2 , bck[v][1] = -2;
}
int findDsu(int v){
if(dsu[v][0] == -1) return v;
if(dsumd and bck[v][0] == -2) bck[v][0] = dsu[v][0] , bck[v][1] = dsu[v][1] , bckis.pb(v);
if((int)bckis.size() > n) exit(0);
return (dsu[v][0] = findDsu(dsu[v][0]));
}
void uDsu(int a , int b){
a = findDsu(a) , b = findDsu(b);
if(a == b) return;
if(dsumd){
if(bck[a][0] == -2) bck[a][0] = dsu[a][0] , bck[a][1] = dsu[a][1] , bckis.pb(a);
if(bck[b][0] == -2) bck[b][0] = dsu[b][0] , bck[b][1] = dsu[b][1] , bckis.pb(b);
}
if((int)bckis.size() > n) exit(0);
dsu[a][1] += dsu[b][1] , dsu[b][0] = a;
}
void clDsu(){
for(int v : bckis) dsu[v][0] = bck[v][0] , dsu[v][1] = bck[v][1] , bck[v][0] = -2 , bck[v][1] = -2;
bckis.resize(0);
}
void getCnds(){
for(auto e : adds) uDsu(e[0] , e[1]);
for(auto e : mst){
if(findDsu(e[1]) == findDsu(e[2])) cnds.pb(e);
else uDsu(e[1] , e[2]);
}
init();
for(auto e : mst){
if(!(binary_search(cnds.bg() , cnds.end() , e))) uDsu(e[1] , e[2]);
}
dsumd = 1;
}
bool jg(int e , int msk , int c){
for(int i = 0 ; i < k ; i++){
if(i == e or !((msk >> i) & 1)) continue;
uDsu(adds[i][0] , adds[i][1]);
}
bool res = 1;
for(auto ee : cnds){
if(ee[0] >= c){
if(findDsu(adds[e][0]) == findDsu(adds[e][1])) res = 0;
clDsu();
return res;
}
uDsu(ee[1] , ee[2]);
}
if(findDsu(adds[e][0]) == findDsu(adds[e][1])) res = 0;
clDsu();
return res;
}
int bs(int e , int msk){
int l = 0 , r = int(1e6) + 1;
while(r - l - 1 > 1){
int c = l + (r - l - 1) / 2 + 1;
if(jg(e , msk , c)) l = c - 1;
else r = c;
}
if(r - l - 1 == 1){
if(jg(e , msk , l + 1)) return l + 1;
}
return l;
}
ll dfs1(int v , int p , int msk){
ll res = 0;
mem[v] = dsu[v][1] , ms.insert(v);
for(int e = 0 ; e < k ; e++){
if(!((msk >> e) & 1)) continue;
if(findDsu(adds[e][0]) != v and findDsu(adds[e][1]) != v) continue;
int u = findDsu(adds[e][0]) + findDsu(adds[e][1]) - v;
if(ms.find(u) != ms.end()) continue;
res += dfs1(u , v , msk) , mem[v] += mem[u];
ll d = bs(e , msk);
res += d * mem[u];
}
return res;
}
ll getCst(int msk){
ll res;
for(int e = 0 ; e < k ; e++){
if(!((msk >> e) & 1)) continue;
uDsu(adds[e][0] , adds[e][1]);
}
for(auto e : cnds){
if(findDsu(e[1]) == findDsu(e[2])) continue;
uss.pb(e);
}
clDsu();
for(auto e : uss) uDsu(e[1] , e[2]);
ms.cl() , res = dfs1(findDsu(0) , -1 , msk);
clDsu() , uss.cl();
return res;
}
ll f(){
ll res = 0;
for(int msk = 1 ; msk < (1 << k) ; msk++){
res = max(res , getCst(msk));
}
return res;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k;
vector<arr(3)> es;
for(int i = 0 ; i < m ; i++){
int v , u , c;
cin >> v >> u >> c;
v-- , u--;
es.pb({c , v , u});
}
for(int i = 0 ; i < k ; i++){
int v , u;
cin >> v >> u;
adds.pb({v - 1 , u - 1});
}
for(int i = 0 ; i < n ; i++){
int d;
cin >> d;
a.pb(d);
}
init();
sort(es.bg() , es.end());
for(auto e : es){
if(findDsu(e[1]) == findDsu(e[2])) continue;
mst.pb(e) , uDsu(e[1] , e[2]);
}
// exit(0);
init() , getCnds();
cout << f();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 3 |
Incorrect |
12 ms |
2396 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 3 |
Incorrect |
12 ms |
2396 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 3 |
Incorrect |
12 ms |
2396 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 3 |
Incorrect |
12 ms |
2396 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
