#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("popcnt")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MAX=2e5+10,P=1e9+7;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;
const ldb eps=1e-6;
const ldb PI=acos(-1.0);
const int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
template<typename T>
using vvector = vector<vector<T>>;
struct DSU {
int n;
vector<int> fa,sz;
vector<ll> cnt;
vector<bool> del;
DSU(int _n,vector<pll> &w):n(_n) {
fa.resize(n+1);
cnt.resize(n+1);
del.resize(n+1);
for (int i=0;i<n;i++) {
cnt[w[i].S]=w[i].F;
}
iota(all(fa),0);
sz.resize(n+1,1);
}
int get(int x) {
return fa[x]=(fa[x]==x?x:get(fa[x]));
}
void unionn(int a,int b) {
a=get(a);b=get(b);
if (a==b) return;
if (sz[a]>sz[b]) swap(a,b);
fa[a]=b;
sz[b]+=sz[a];
cnt[b]+=cnt[a];
}
};
int main() {
speed;
int n,m;
cin>>n>>m;
vvector<int> G(n+1);
vector<pll> w;
vector<ll> cnt(n+1);
for (int i=1;i<=n;i++) {
cin>>cnt[i];
w.emplace_back(cnt[i],i);
}
sort(all(w));
for (int i=0;i<m;i++) {
int a,b;
cin>>a>>b;
G[a].push_back(b);
G[b].push_back(a);
}
DSU d(n,w);
for (int i=1;i<n;i++) {
int v=w[i].S;
for (int u:G[v]) {
if (cnt[u]>cnt[v]) continue;
int ru=d.get(u);
int rv=d.get(v);
if (d.del[ru]) continue;
if (d.cnt[ru]<cnt[v]) {
d.del[ru]=true;
continue;
}
d.unionn(u,v);
}
}
for (int i=1;i<=n;i++) {
cout<<!(d.del[d.get(i)]);
}
return 0;
}
Compilation message
island.cpp: In function 'int main()':
island.cpp:78:17: warning: unused variable 'rv' [-Wunused-variable]
78 | int rv=d.get(v);
| ^~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Incorrect |
2 ms |
456 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Incorrect |
101 ms |
24696 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
504 KB |
Output is correct |
2 |
Incorrect |
95 ms |
24604 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Incorrect |
115 ms |
24760 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Incorrect |
2 ms |
456 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |