oj.uz

답안 #969401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969401 2024-04-25T06:06:15 Z aeg Stranded Far From Home (BOI22_island) C++14
100 / 100
 480 ms 58036 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = (int)2e5 + 7;
 
int n, m, a[N], p[N];
vector<int> pos[N];
vector<int> need[N];
bool ans[N];
 
set<pair<long long, int> > have;
long long s[N];
 
void comb(int u, int v) {
	int l = p[u];
	int r = p[v];
	if(l == r) {
		return;
	}
	have.erase({s[l], l});
	have.erase({s[r], r});
	if((int)pos[l].size() > (int)pos[r].size()) {
		for(auto x : pos[r]) {
			p[x] = l;
			pos[l].push_back(x);
		}	
	    for(auto x : need[r]) {
	    	need[l].push_back(x);
	    }
		pos[r].clear();
		need[r].clear();        		
		s[l] += s[r];
		if(!need[l].empty()) {
			have.insert({s[l], l});
		}
	} else {
		for(auto x : pos[l]) {
			p[x] = r;
			pos[r].push_back(x);
		}	
		for(auto x : need[l]) {
			need[r].push_back(x);
		}
		pos[l].clear();
		need[l].clear();
		s[r] += s[l];
		if(!need[r].empty()) {
			have.insert({s[r], r});
		}
	}
}
 
long long val[N];
 
int b[N]; 
 
bool cmp2(int i, int j) {
	return a[i] < a[j];
}
 
vector<int> g[N];
 
int main() {	
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		p[i] = i;
		b[i] = i;
		s[i] = a[i];
		pos[i].push_back(i);
		need[i].push_back(i);
	}
	for(int i = 1; i <= n; ++i) {
		ans[i] = 1;
	}    
	for(int i = 1; i <= m; ++i) {
		int u, v;
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}    
	sort(b+1, b+1+n, cmp2);
	for(int i = 1; i <= n; ++i) {
		if(a[b[i]] == a[b[n]]) {
			break;
		}
		int r = i;
		while(r<n && a[b[r]] == a[b[r+1]]) {
			r++;
		}
		for(int k = i; k <= r; ++k) {
			have.insert({a[b[r]], b[k]});
		}
		for(int k = i; k <= r; ++k) {
			for(auto u : g[b[k]]) {
				if(a[u] <= a[b[k]]) {
					comb(u, b[k]);
				}
			}
		}
		for(int k = i; k <= r; ++k) {
			for(auto u : g[b[k]]) {
				long long cur = s[p[b[k]]];
				if(cur >= a[u]) {
					comb(u, b[k]);
				}
			}
		}
		vector<pair<long long, int> > del;
		for(auto [cur, k] : have) {
			if(cur < a[b[r+1]]) {
				for(auto x : need[k]) {
					ans[x] = 0;
				}
				del.push_back({cur, k});
				need[k].clear();
			} else {
				break;
			}
		}
		for(auto e : del) {
			have.erase(e);
		}
		i = r;
	}
	for(int i = 1; i <= n; ++i) {
		cout << ans[i];
	}
	return 0;
}

Compilation message

island.cpp: In function 'int main()':
island.cpp:112:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  112 |   for(auto [cur, k] : have) {
      |            ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19036 KB Output is correct
2 Correct 4 ms 19036 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 6 ms 19172 KB Output is correct
5 Correct 6 ms 19128 KB Output is correct
6 Correct 5 ms 19036 KB Output is correct
7 Correct 6 ms 19292 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 6 ms 19292 KB Output is correct
10 Correct 7 ms 19292 KB Output is correct
11 Correct 5 ms 19292 KB Output is correct
12 Correct 6 ms 19388 KB Output is correct
13 Correct 5 ms 19292 KB Output is correct
14 Correct 6 ms 19292 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19036 KB Output is correct
2 Correct 4 ms 19036 KB Output is correct
3 Correct 184 ms 41340 KB Output is correct
4 Correct 220 ms 56340 KB Output is correct
5 Correct 305 ms 51520 KB Output is correct
6 Correct 387 ms 52912 KB Output is correct
7 Correct 306 ms 53144 KB Output is correct
8 Correct 440 ms 57968 KB Output is correct
9 Correct 199 ms 56636 KB Output is correct
10 Correct 112 ms 43644 KB Output is correct
11 Correct 84 ms 43208 KB Output is correct
12 Correct 396 ms 53708 KB Output is correct
13 Correct 219 ms 54408 KB Output is correct
14 Correct 212 ms 53436 KB Output is correct
15 Correct 137 ms 45332 KB Output is correct
16 Correct 117 ms 44644 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19036 KB Output is correct
2 Correct 372 ms 51240 KB Output is correct
3 Correct 376 ms 55176 KB Output is correct
4 Correct 94 ms 43604 KB Output is correct
5 Correct 208 ms 55124 KB Output is correct
6 Correct 392 ms 55008 KB Output is correct
7 Correct 178 ms 45244 KB Output is correct
8 Correct 169 ms 45408 KB Output is correct
9 Correct 116 ms 44360 KB Output is correct
10 Correct 193 ms 52244 KB Output is correct
11 Correct 348 ms 54552 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19032 KB Output is correct
2 Correct 377 ms 44676 KB Output is correct
3 Correct 397 ms 43892 KB Output is correct
4 Correct 395 ms 44456 KB Output is correct
5 Correct 95 ms 38996 KB Output is correct
6 Correct 102 ms 38216 KB Output is correct
7 Correct 190 ms 52424 KB Output is correct
8 Correct 174 ms 51204 KB Output is correct
9 Correct 154 ms 32496 KB Output is correct
10 Correct 478 ms 55348 KB Output is correct
11 Correct 381 ms 51812 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19036 KB Output is correct
2 Correct 4 ms 19036 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 6 ms 19172 KB Output is correct
5 Correct 6 ms 19128 KB Output is correct
6 Correct 5 ms 19036 KB Output is correct
7 Correct 6 ms 19292 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 6 ms 19292 KB Output is correct
10 Correct 7 ms 19292 KB Output is correct
11 Correct 5 ms 19292 KB Output is correct
12 Correct 6 ms 19388 KB Output is correct
13 Correct 5 ms 19292 KB Output is correct
14 Correct 6 ms 19292 KB Output is correct
15 Correct 4 ms 19036 KB Output is correct
16 Correct 4 ms 19036 KB Output is correct
17 Correct 184 ms 41340 KB Output is correct
18 Correct 220 ms 56340 KB Output is correct
19 Correct 305 ms 51520 KB Output is correct
20 Correct 387 ms 52912 KB Output is correct
21 Correct 306 ms 53144 KB Output is correct
22 Correct 440 ms 57968 KB Output is correct
23 Correct 199 ms 56636 KB Output is correct
24 Correct 112 ms 43644 KB Output is correct
25 Correct 84 ms 43208 KB Output is correct
26 Correct 396 ms 53708 KB Output is correct
27 Correct 219 ms 54408 KB Output is correct
28 Correct 212 ms 53436 KB Output is correct
29 Correct 137 ms 45332 KB Output is correct
30 Correct 117 ms 44644 KB Output is correct
31 Correct 4 ms 19036 KB Output is correct
32 Correct 372 ms 51240 KB Output is correct
33 Correct 376 ms 55176 KB Output is correct
34 Correct 94 ms 43604 KB Output is correct
35 Correct 208 ms 55124 KB Output is correct
36 Correct 392 ms 55008 KB Output is correct
37 Correct 178 ms 45244 KB Output is correct
38 Correct 169 ms 45408 KB Output is correct
39 Correct 116 ms 44360 KB Output is correct
40 Correct 193 ms 52244 KB Output is correct
41 Correct 348 ms 54552 KB Output is correct
42 Correct 4 ms 19032 KB Output is correct
43 Correct 377 ms 44676 KB Output is correct
44 Correct 397 ms 43892 KB Output is correct
45 Correct 395 ms 44456 KB Output is correct
46 Correct 95 ms 38996 KB Output is correct
47 Correct 102 ms 38216 KB Output is correct
48 Correct 190 ms 52424 KB Output is correct
49 Correct 174 ms 51204 KB Output is correct
50 Correct 154 ms 32496 KB Output is correct
51 Correct 478 ms 55348 KB Output is correct
52 Correct 381 ms 51812 KB Output is correct
53 Correct 4 ms 19036 KB Output is correct
54 Correct 4 ms 19032 KB Output is correct
55 Correct 4 ms 19036 KB Output is correct
56 Correct 7 ms 19292 KB Output is correct
57 Correct 7 ms 19292 KB Output is correct
58 Correct 5 ms 19292 KB Output is correct
59 Correct 6 ms 19292 KB Output is correct
60 Correct 5 ms 19268 KB Output is correct
61 Correct 5 ms 19292 KB Output is correct
62 Correct 5 ms 19360 KB Output is correct
63 Correct 6 ms 19288 KB Output is correct
64 Correct 6 ms 19360 KB Output is correct
65 Correct 7 ms 19288 KB Output is correct
66 Correct 6 ms 19608 KB Output is correct
67 Correct 173 ms 45696 KB Output is correct
68 Correct 226 ms 56332 KB Output is correct
69 Correct 319 ms 51572 KB Output is correct
70 Correct 337 ms 53148 KB Output is correct
71 Correct 299 ms 53120 KB Output is correct
72 Correct 480 ms 58036 KB Output is correct
73 Correct 242 ms 56744 KB Output is correct
74 Correct 106 ms 43384 KB Output is correct
75 Correct 91 ms 43260 KB Output is correct
76 Correct 396 ms 53716 KB Output is correct
77 Correct 197 ms 54860 KB Output is correct
78 Correct 199 ms 53512 KB Output is correct
79 Correct 156 ms 45400 KB Output is correct
80 Correct 113 ms 44392 KB Output is correct
81 Correct 354 ms 55604 KB Output is correct
82 Correct 364 ms 55264 KB Output is correct
83 Correct 100 ms 43600 KB Output is correct
84 Correct 208 ms 55084 KB Output is correct
85 Correct 369 ms 55096 KB Output is correct
86 Correct 162 ms 45244 KB Output is correct
87 Correct 166 ms 45248 KB Output is correct
88 Correct 225 ms 52208 KB Output is correct
89 Correct 340 ms 54692 KB Output is correct
90 Correct 371 ms 49188 KB Output is correct
91 Correct 360 ms 48768 KB Output is correct
92 Correct 384 ms 49000 KB Output is correct
93 Correct 97 ms 43616 KB Output is correct
94 Correct 100 ms 42556 KB Output is correct
95 Correct 217 ms 56768 KB Output is correct
96 Correct 174 ms 54352 KB Output is correct
97 Correct 176 ms 35036 KB Output is correct
98 Correct 425 ms 57984 KB Output is correct
99 Correct 348 ms 54952 KB Output is correct
100 Correct 34 ms 23376 KB Output is correct
101 Correct 429 ms 50772 KB Output is correct
102 Correct 84 ms 38680 KB Output is correct
103 Correct 263 ms 42652 KB Output is correct
104 Correct 363 ms 47852 KB Output is correct