제출 #856483

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
856483		borisAngelov	Colors (RMI18_colors)	C++17	7 / 100	51 ms	4784 KiB

colors

#include <bits/stdc++.h>

using namespace std;

const int maxn = 150005;

int n, m;

int a[maxn];
int b[maxn];

vector<int> g[maxn];

void reset()
{
    for (int i = 1; i <= n; ++i)
    {
        g[i].clear();
    }
}

void read()
{
    cin >> n >> m;

    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }

    for (int i = 1; i <= n; ++i)
    {
        cin >> b[i];
    }

    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        cin >> x >> y;

        g[x].push_back(x);
        g[y].push_back(y);
    }
}

void solve()
{
    for (int i = 1; i <= n; ++i)
    {
        if (a[i] < b[i])
        {
            cout << "0\n";
            return;
        }
    }

    vector<bool> seen(n + 5, false);

    for (int i = 1; i <= n; ++i)
    {
        seen[a[i]] = true;
    }

    for (int i = 1; i <= n; ++i)
    {
        if (seen[b[i]] == false)
        {
            cout << "0\n";
            return;
        }
    }

    cout << "1\n";
}

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    int q;
    cin >> q;

    while (q--)
    {
        reset();
        read();
        solve();
    }

    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 7 / 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