#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long long
#define sqrt sqrtl
using namespace std;
const long long oo = 1000000000000000000;
long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
/*
ViHHiPuh
(( `'-""``""-'` ))
)-__-_.._-__-(
/ --- (o _ o) --- \
\ .-* ( .0. ) *-. /
_'-. ,_ '=' _, .-'_
/ `;#'#'# - #'#'#;` \
\_)) -----'#'----- ((_/
# --------- #
'# ------- ------ #'
/..-'# ------- #'-.\
_\...-\'# -- #'/-.../_
((____)- '#' -(____))
cout << fixed << setprecision(6) << x;
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
freopen ( "sum.in", "r", stdin )
*/
int n, m, a[ 200001 ], x, y, p[ 200001 ], r[ 200001 ], c[ 200001 ];
int an[ 200001 ];
vector <int> v[ 200001 ], v1;
vector <pair<int, pair<int, int> > > vv;
map <int, vector <int> > mp;
set <int> st, stt;
int fin( int a ) {
if ( p[ a ] == a )
return a;
return p[ a ] = fin( p[ a ] );
}
void unin( int a, int b ) {
a = fin( a );
b = fin( b );
if ( a == b )
return;
if ( r[ a ] < r[ b ] )
swap( a, b );
r[ a] += r[ b ];
c[ a ] += c[ b ];
p[ b ] = a;
}
void dfs( int u ) {
an[ u ] = 0;
for ( auto to : v[ u ] ) {
if ( an[ to ] )
dfs( to );
}
}
main () {
cin >> n >> m;
for ( int i = 1; i <= n; i ++ ) {
cin >> a[ i ], an[ i ] = 1;
p[ i ] = i;
r[ i ] = 1;
c[ i ] = a[ i ];
mp[ a[ i] ].push_back( i );
st.insert( a[ i ] );
}
for ( int i = 1; i <= m; i ++ ) {
cin >> x >> y;
if ( a[ x ] < a[ y ] )
swap( x, y );
vv.push_back( { a[ x ], make_pair( x, y ) } );
}
sort( vv.begin(), vv.end() );
reverse( vv.begin(), vv.end() );
stt = st;
for ( auto i : st ) {
if ( stt.size() )
stt.erase( stt.begin() );
if ( stt.size() )
ans = *stt.begin();
else
ans = 0;
while ( vv.size() && vv.back().first == i ) {
v[ vv.back().second.first ].push_back( vv.back().second.second );
v[ vv.back().second.second ].push_back( vv.back().second.first );
unin( vv.back().second.first, vv.back().second.second );
vv.pop_back();
}
v1 = mp[ i ];
for ( int j = 0; j < v1.size() ;j ++ ) {
num = fin( v1[ j ] );
if ( c[ num ] < ans && an[ v1[ j ] ] )
dfs( v1[ j ] );
}
}
for ( int i = 1; i <= n; i ++ )
cout << an[ i ];
}
Compilation message
island.cpp:80:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
80 | main () {
| ^~~~
island.cpp: In function 'int main()':
island.cpp:113:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
113 | for ( int j = 0; j < v1.size() ;j ++ ) {
| ~~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 4 |
Incorrect |
6 ms |
5536 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
424 ms |
61040 KB |
Output is correct |
| 4 |
Correct |
214 ms |
31144 KB |
Output is correct |
| 5 |
Incorrect |
400 ms |
59452 KB |
Output isn't correct |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 2 |
Incorrect |
594 ms |
60624 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 2 |
Incorrect |
313 ms |
29180 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 4 |
Incorrect |
6 ms |
5536 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
