제출 #1254363

#제출 시각아이디문제언어결과실행 시간메모리
1254363shjeongColors (RMI18_colors)C++20
0 / 100
37 ms324 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #pragma optimize("unroll-loops") #define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define all(x) x.begin(), x.end() #define rll(x) x.rbegin(), x.rend() #define COMP(x) x.erase(unique(all(x)), x.end()) #define MOD 1000000007 #define MOD2 998244353 #define sz(x) (ll)x.size() typedef __int128_t lll; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> pll; typedef pair<ll, pll> PP; const ll Lnf = 2e18; void solve(){ ll n, m; cin>>n>>m; vector<ll> deg(n+1); vector<ll> A(n+1), B(n+1); for(int i = 1 ; i <= n ; i++)cin>>A[i]; for(int i = 1 ; i <= n ; i++)cin>>B[i]; for(int i = 0 ; i < m ; i++){ ll a,b; cin>>a>>b; deg[a]++; deg[b]++; } for(int i = 1 ; i <= n ; i++)if(A[i]<B[i]){ cout<<"0\n"; return; } for(int i = 1 ; i <= n ; i++)if(deg[i] == n-1){ if(A[i] > B[i]){ bool flag=0; for(int j = 1 ; j <= n ; j++)if(B[i] == A[j]){flag=1;break;} if(!flag){ cout<<"0\n"; return; } A[i]=B[i]; } for(int j = 1 ; j <= n ; j++)if(A[j]>B[j] and B[j] != A[i]){ cout<<"0\n"; return; } cout<<"1\n"; return; } } int main(){ fast; ll t; cin>>t; while(t--)solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...