oj.uz

답안 #719939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719939 2023-04-07T06:16:47 Z vinnipuh01 Stranded Far From Home (BOI22_island) C++17
0 / 100
 563 ms 67820 KB 
#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> s[ 200001 ];
set <int> st, stt;
int used[ 200001 ];

pair<int, int> fin( int a, int ans ) {
	ans = ans & an[ a ];
	if ( p[ a ] == a )
		return { a, ans };
	pair<int, int> pp = fin( p[ a ], ans );
	p[ a ] = pp.first;
	an[ a ] = pp.second;
	return { p[ a ], ans };
}

void unin( int a, int b ) {
	a = fin( a, an[ a ] ).first;
	b = fin( b, an[ b ] ).first;
	if ( a == b )
		return;
	if ( r[ a ] < r[ b ] && ::a[ a ] < ::a[ b ] )
		swap( a, b );
	r[ a ] += r[ b ];
	c[ a ] += c[ b ];
	p[ b ] = a;
}

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 ) {
			num = fin( vv.back().second.second, an[ vv.back().second.second ] ).first;
			if ( c[ num ] < vv.back().first ) {
				an[ num ] = 0;
			}
			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();
		}
	}
	for ( int i = 1; i <= n; i ++ ) {
		fin( i, an[ i ] );
		cout << an[ i ];
	}
}

Compilation message

island.cpp:78:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   78 | main () {
      | ^~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Incorrect 10 ms 14936 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14548 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Incorrect 362 ms 67820 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Incorrect 563 ms 67576 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Incorrect 317 ms 35952 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Incorrect 10 ms 14936 KB Output isn't correct
5 Halted 0 ms 0 KB -