제출 #1341203

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1341203		ezzzay	Colors (RMI18_colors)	C++20	0 / 100	3095 ms	33984 KiB

colors

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=3e5+5;
int x[N],y[N];
vector<int>v[N];
vector<int>vc;
int H;
bool FLAG=0;
void dfs(int a, int p){
    if(x[a]==y[H]){
        // vc dotorh 
        bool u=1;
        for(auto b:vc){
            if(x[b]<y[H])u=0;
        }
        if(u)FLAG=1;
        return;
    }
    for(auto b:v[a]){
        if(b==p)continue;
        vc.pb(b);
        dfs(b,a);
        vc.pop_back();
    }
}
int fun(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>x[i];
    for(int i=1;i<=n;i++)cin>>y[i];
    for(int i=1;i<=n;i++)v[i].clear();
    for(int i=1;i<=m;i++){
        int a,b;
        cin>>a>>b;
        v[a].pb(b);
        v[b].pb(a);
    }
    for(int i=1;i<=n;i++){
        if(x[i]<y[i])return 0;
        if(x[i]!=y[i]){
            H=i;
            FLAG=0;
            dfs(i,0);
            if(FLAG==0)return 0;
        }
    }
    return 1;
}
int main(){
    int t;
    cin>>t;
    while(t--)cout<<fun()<<endl;
    
    // assume its a tree
    // a->b 
    // b ees ireh zamd ene 2 oos baga utgtai ym bj bolku zamiihn neg utgn bur baga bj bolku
}

• 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