大家都TM很强,可与之共勉 。
2654: tree
Time Limit: 30 Sec Memory Limit: 512 MB
Description
给你一个无向带权连通图,每条边是黑色或白色。让你求一棵最小权的恰好有need条白色边的生成树。
题目保证有解。
Input
第一行V,E,need分别表示点数,边数和需要的白色边数。
接下来E行,每行s,t,c,col表示这边的端点(点从0开始标号),边权,颜色(0白色1黑色)。
Output
一行表示所求生成树的边权和。
V<=50000,E<=100000,所有数据边权为[1,100]中的正整数。
Sample Input
2 2 1
0 1 1 1
0 1 2 0
Sample Output
2
HINT
原数据出错,现已更新 by liutian,但未重测—2016.6.24
Source
做法如下 :
/**************************************************************
Problem: 2654
User: Lazer2001
Language: C++
Result: Accepted
Time:1456 ms
Memory:18872 kb
****************************************************************/
# include <bits/stdc++.h>
const int N = 500005 ;
int n, m ;
int need ;
int ans, tot ;
int ne ;
struct edge {
int u, v, w, col ;
edge ( ) { }
edge ( int u, int v, int w, int col ) : u ( u ), v ( v ), w ( w ), col ( col ) { }
inline short operator < ( const edge& rhs ) const {
return ( w < rhs.w ) || ( w == rhs.w && col < rhs.col ) ;
}
} g [N << 1] ;
int fa [N] ;
inline int find ( int x ) {
while ( x ^ fa [x] ) x = fa [x] = fa [fa [x]] ;
return x ;
}
inline int Check ( int x ) {
for ( int i = 0 ; i < n ; ++ i ) fa [i] = i ;
for ( int i = 1 ; i <= ne ; ++ i ) if ( ! g [i].col ) g [i].w += x ;
std :: sort ( g + 1, g + 1 + ne ) ;
for ( int i = 1 ; i <= ne ; ++ i ) if ( ! g [i].col ) g [i].w -= x ;
int wcnt = 0 ;
tot = 0 ;
for ( int i = 1, ecnt = 0 ; i <= ne ; ++ i ) {
int u = g [i].u, v = g [i].v ;
u = find ( u ), v = find ( v ) ;
if ( u ^ v ) {
fa [u] = fa [v] ;
wcnt += ( g [i].col == 0 ) ;
tot += g [i].w ;
if ( ++ ecnt == n - 1 ) break ;
}
}
return wcnt >= need ;
}
int main ( ) {
scanf ( "%d%d%d", & n, & m, & need ) ;
while ( m -- ) {
static int u, v, w, col ;
scanf ( "%d%d%d%d", & u, & v, & w, & col ) ;
g [++ ne] = edge ( u, v, w, col ) ;
}
int L = -100, R = 100 ;
while ( L ^ R ) {
int mid = ( L >> 1 ) + ( R >> 1 ) + ( L & R & 1 ) ;
( Check ( mid ) ) ? L = mid + 1, ans = tot : R = mid ;
}
printf ( "%d\n", ans ) ;
}