#include<bits/stdc++.h>
#define ll int
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname "temp"
#define frep freopen(taskname".inp","r",stdin); //freopen(taskname".out","w",stdout);
using namespace std;
ll n,m;
struct save{
ll u,szu,v,szv;
};
vector<save> st;
vector<pair<ll,ll>> segtree[600001];
vector<ll> colors[150001],need[150001];
ll par[150001];
ll sz[150001];
ll a[150001];
ll b[150001];
ll check[150001];
ll ans;
ll find_par(ll u){
return (par[u]==u ? u : find_par(par[u]));
}
inline bool uni(ll u,ll v){
u=find_par(u);
v=find_par(v);
if(u==v) return 0;
if(sz[u]>sz[v]) swap(u,v);
st.push_back({u,sz[u],v,sz[v]});
par[u]=v;
sz[v]+=sz[u];
return 1;
}
inline void rollback(){
if(st.size()==0) return ;
save c=st.back();
st.pop_back();
par[c.u]=c.u;
par[c.v]=c.v;
sz[c.u]=c.szu;
sz[c.v]=c.szv;
}
void upd(ll pos,ll l,ll r,ll u,ll v,ll x,ll y){
if(u<=l&&r<=v) segtree[pos].push_back({x,y});
else if(l>v||r<u) return ;
else{
ll mid=(l+r)/2;
upd(2*pos,l,mid,u,v,x,y);
upd(2*pos+1,mid+1,r,u,v,x,y);
}
}
void dfs(ll pos,ll l,ll r){
ll cnt=0;
for(auto [u,v]:segtree[pos]){
cnt+=uni(u,v);
// cout<<"+ "<<u<<' '<<v<<ntr;
}
if(l==r){
ll col=l;
for(auto i:colors[col]){
ll p=find_par(i);
check[p]=1;
}
for(auto i:need[col]){
ll p=find_par(i);
if(!check[p]) ans=0;
}
for(auto i:colors[col]){
ll p=find_par(i);
check[p]=0;
}
//cout<<l<<' '<<ans<<ntr;
}
else{
ll mid=(l+r)>>1;
dfs(pos<<1,l,mid);
dfs(pos<<1|1,mid+1,r);
segtree[pos]={};
}
for(int i=1;i<=cnt;i++){
rollback();
// cout<<"- "<<u<<' '<<v<<ntr;
}
//segtree[pos]={};
}
void solve(){
ans=1;
st={};
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
par[i]=i;
sz[i]=1;
colors[a[i]].push_back(i);
}
for(int i=1;i<=n;i++){
cin>>b[i];
need[b[i]].push_back(i);
}
vector<pair<ll,ll>> edges;
for(int i=1;i<=m;i++){
ll u,v;
cin>>u>>v;
edges.push_back({u,v});
}
for(int i=1;i<=n;i++){
if(a[i]<b[i]){
ans=0;
}
}
if(ans==0){
for(int i=1;i<=n;i++) colors[i]={},need[i]={};
cout<<0<<ntr;
return ;
}
for(auto [u,v]:edges){
if(max(b[u],b[v])<=min(a[u],a[v])) upd(1,1,n,max(b[u],b[v]),min(a[u],a[v]),u,v);
}
dfs(1,1,n);
for(int i=1;i<=n;i++) colors[i]={},need[i]={};
cout<<ans<<ntr;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//frep;
ll t;
cin>>t;
while(t--) solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
250 ms |
25416 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
125 ms |
27020 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
655 ms |
25596 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
655 ms |
25596 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
250 ms |
25416 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1282 ms |
28488 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
65 ms |
25672 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
250 ms |
25416 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
