Submission #332242

#	Time	Username	Problem	Language	Result	Execution time	Memory
332242		a_player	Colors (RMI18_colors)	C++14	0 / 100	980 ms	2924 KiB

colors

#include <bits/stdc++.h>

using namespace std;

const int nax=1e5+5;
vector<int> grafo[nax];
int a[nax],b[nax];
void solve(){
  for(int i=0;i<nax;i++){
    grafo[i].clear();
  }
  int n,m;
  cin>>n>>m;
  int root=-1;
  for(int i=0;i<n;i++)cin>>a[i];
  for(int i=0;i<n;i++)cin>>b[i];
  for(int i=0;i<m;i++){
    int u,v;
    cin>>u>>v;
    u--,v--;
    grafo[u].push_back(v);
    grafo[v].push_back(u);
    if(grafo[u].size()>1)root=u;
    if(grafo[v].size()>1)root=v;
  }
  if(a[root]!=b[root]){
    for(int i=0;i<n;i++)if(min(a[i],a[root])==b[root])a[root]=min(a[i],a[root]),i=n;
  }
    for(int i=0;i<n;i++){
      if(a[i]!=b[i]&&min(a[i],a[root])!=b[i]){
        cout<<0<<endl;
        return;
      }
    }
    cout<<1<<endl;
}

int main(){
  int tt;
  cin>>tt;
  while(tt--)solve();
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 7
• Subtask 3: 0 / 8
• Subtask 4: 0 / 15
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 10
• Subtask 8: 0 / 22