oj.uz

답안 #711148

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711148 2023-03-16T08:57:33 Z YeoBL Stranded Far From Home (BOI22_island) C++14
40 / 100
 1000 ms 34404 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#define int long long
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
const int MAX_N = 2e5 + 5;
bool active[MAX_N], ans[MAX_N];
int siz[MAX_N], par[MAX_N], s[MAX_N], powe[MAX_N], requ[MAX_N];
void init(int x){
	for (int i = 0; i < x; i++){
		par[i] = i;
		siz[i] = s[i];
	}
}
int head(int x){
	if (par[x] == x) return x;
	return par[x] = head(par[x]);
}
void merge(int a, int b){
	int pa = head(a), pb = head(b);
	if (pa == pb) return;
	par[pa] = pb;
	siz[pb] += siz[pa];
}
int stronk(int a){
	return siz[head(a)];
}
int32_t main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int n, m, x, y; cin >> n >> m; 
	fill(requ, requ + n, 1e9);
	vector <int> edg[n];
	for (int i = 0; i < n; i++) cin >> s[i];
	pair <int, int> p[n];
	for (int i = 0; i < n; i++){
		p[i].fi = s[i]; p[i].se = i;
	}
	sort(p, p + n);
	for (int i = 0; i < m; i++){
		cin >> x >> y;
		x -= 1; y -= 1;
		edg[x].pb(y); edg[y].pb(x);
	}
	vector <vector <int> > v;
	for (int i = 0; i < n; i++){
		vector <int> nx;
		nx.pb(p[i].se);
		while (i != n - 1){
			if (p[i + 1].fi == p[i].fi){
				nx.pb(p[i + 1].se);
			}
			else break;
			i += 1;
		}
		v.pb(nx);
	}
	init(n);
	for (auto tmp : v){
		for (auto nd : tmp){
			active[nd] = 1;
			for (auto nx : edg[nd]){
				if (active[nx]) merge(nx, nd);
			}
		}
		for (auto nd : tmp){
			powe[nd] = stronk(nd);
		}
	}
	for (auto nd : v.back()){
		ans[nd] = 1;
	}
	for (int i = n - 1; i >= 0; i--){
		int cur = p[i].se;
		if (requ[cur] <= powe[cur]) ans[cur] = 1;
		if (!ans[cur]) continue;
		queue <int> q;
		q.push(cur);
		vector <int> x;
		while (!q.empty()){
			int curnd = q.front();
			q.pop();
			for (auto nx : edg[curnd]){
				//if (cur == 1) cerr << powe[nx] << ' ' << 
				if (s[nx] <= s[cur] and requ[nx] > s[cur] ){
					requ[nx] = min(s[cur], requ[nx]);
					q.push(nx);
				}
			}
		}
	}
	for (int i = 0; i < n; i++) cout << ans[i];
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 24 ms 596 KB Output is correct
5 Correct 5 ms 708 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 23 ms 596 KB Output is correct
8 Correct 21 ms 596 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 720 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 6 ms 592 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Execution timed out 1035 ms 34404 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 513 ms 33660 KB Output is correct
3 Correct 639 ms 31556 KB Output is correct
4 Correct 236 ms 28620 KB Output is correct
5 Correct 156 ms 27636 KB Output is correct
6 Correct 644 ms 33712 KB Output is correct
7 Execution timed out 1067 ms 33312 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 330 ms 25500 KB Output is correct
3 Correct 356 ms 25536 KB Output is correct
4 Correct 380 ms 25612 KB Output is correct
5 Correct 321 ms 26812 KB Output is correct
6 Correct 293 ms 25720 KB Output is correct
7 Correct 218 ms 28436 KB Output is correct
8 Correct 138 ms 28188 KB Output is correct
9 Correct 192 ms 15448 KB Output is correct
10 Correct 275 ms 26784 KB Output is correct
11 Correct 238 ms 25068 KB Output is correct

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 24 ms 596 KB Output is correct
5 Correct 5 ms 708 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 23 ms 596 KB Output is correct
8 Correct 21 ms 596 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 720 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 6 ms 592 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Execution timed out 1035 ms 34404 KB Time limit exceeded
18 Halted 0 ms 0 KB -