| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1341208 | ezzzay | Colors (RMI18_colors) | C++20 | 3 ms | 440 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=3e5+5;
int x[N],y[N];
int fun(){
int n,m;
cin>>n>>m;
vector<bool>in(n+10);
for(int i=1;i<=n;i++){
cin>>x[i];
in[x[i]]=1;
}
for(int i=1;i<=n;i++)cin>>y[i];
vector<int>deg(n+10);
for(int i=1;i<=m;i++){
int a,b;
cin>>a>>b;
deg[a]++;
deg[b]++;
}
int cent;
int mn=1e9;
for(int i=1;i<=n;i++){
if(deg[i]!=1)cent=i;
if(in[y[i]]==0)return 0;
if(x[i]<y[i])return 0;
if(x[i]>y[i]){
mn=min(mn,y[i]);
}
}
return y[cent]<=mn;
}
int main(){
int t;
cin>>t;
while(t--)cout<<fun()<<endl;
}| # | 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... | ||||
