# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332245 | a_player | Colors (RMI18_colors) | C++14 | 1028 ms | 2896 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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);
}
int mas=0;
for(int i=0;i<n;i++){
if(mas<grafo[i].size()){
mas=grafo[i].size();
root=i;
}
}
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;
if(a[root]!=b[root]){
cout<<0<<endl;
return;
}
}
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();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |