#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int find(int p, vector<int> &dsu) {
if(p==dsu[p]) return p;
int u = find(dsu[p],dsu);
dsu[p]=u;
return u;
}
void un(int a,int b,vector<int> &dsu,vector<int> &ev) {
a=find(a,dsu);
b=find(b,dsu);
dsu[b]=a;
ev[a]+=ev[b];
ev[a] = min(1000000000,ev[a]);
}
int main()
{
int n,m;
cin>>n>>m;
vector<int> v(n),ev(n),dsu(n);
vector<pair<int,int>> s;
for (int i = 0; i < n; ++i) {
int x; cin>>x;
ev[i]=x;
v[i]=x;
s.push_back({x,i});
dsu[i]=i;
}
sort(s.begin(), s.end());
vector<vector<int>> g(n);
for (int i = 0; i < m; ++i) {
int x,y; cin>>x>>y; x--; y--;
if(v[x]>v[y]) swap(x,y);
g[x].push_back(y);
}
for (int i = 0; i < n; ++i) {
sort(g[i].begin(),g[i].end(),[v](int a,int b){return v[b]>v[a];});
}
for (auto [val,i]:s) {
for(auto j : g[i]) {
if(ev[find(i,dsu)]>=v[j]) un(i,j,dsu,ev);
}
for (int j = 0; j < g[i].size()-1; ++j) {
g[g[i][j]].push_back(g[i][j+1]);
}
}
int ma = find(s[n-1].second,dsu);
for (int i = 0; i < n; ++i) {
if(ma==find(i,dsu))cout<<"1";
else cout<<"0";
}
}
Compilation message
island.cpp: In function 'int main()':
island.cpp:41:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
41 | for (auto [val,i]:s) {
| ^
island.cpp:45:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
45 | for (int j = 0; j < g[i].size()-1; ++j) {
| ~~^~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Runtime error |
0 ms |
348 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
1 ms |
348 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Runtime error |
0 ms |
348 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |