제출 #1259186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1259186		SalihSahin	Colors (RMI18_colors)	C++20	0 / 100	118 ms	6692 KiB

colors

#include <bits/stdc++.h>
 
using namespace std;
 
vector<int> a;
vector<int> b;
vector<vector<int>> adj(150005);
 
void solve (){
    int n, m;
    cin >> n >> m;
    a.resize(n+1); b.resize(n+1);
    int b_min = INT_MAX;
    unordered_set<int> aelem, belem;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
        aelem.insert(a[i]);
    }
    for (int i = 1; i <= n; i++){
        cin >> b[i];
        b_min = min(b_min, b[i]);
        belem.insert(b[i]);
    } 
    for(int i = 1; i <= n; i++){
        if (a[i] < b[i]){
            cout << 0 << '\n';
            return;
        }
    }
    for(int i : belem){
        if (!aelem.count(i)){
            cout << 0 << '\n';
            return;
        }
    }
    for (int i = 0; i < m; i++){
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    int thatnode = 0;
    for (int i = 1; i <= n; i++){
        if (adj[i].size() > adj[thatnode].size()){
            thatnode = i;
        }
    }
    if(b[thatnode] == b_min){
        cout << 1 << '\n';
    }
    else cout << 0 << '\n';
}
 
int main(){
    int t;
    cin >> t;
    while (t--) 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