Submission #863673

#	Time	Username	Problem	Language	Result	Execution time	Memory
863673		Andrey	Colors (RMI18_colors)	C++14	47 / 100	3051 ms	10436 KiB

colors

#include<bits/stdc++.h>
using namespace std;

vector<int> col(200001);
vector<int> wow(200001);
vector<int> haha[200001];
vector<bool> bruh(200001);

bool dfs(int a, int c) {
    bruh[a] = false;
    if(col[a] == c) {
        return true;
    }
    for(int i = 0; i < haha[a].size(); i++) {
        if(bruh[haha[a][i]] && wow[haha[a][i]] <= c && col[haha[a][i]] >= c) {
            if(dfs(haha[a][i],c)) {
                return true;
            }
        }
    }
    return false;
}

void solve() {
    int n,m,a,b;
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        haha[i].clear();
    }
    vector<pair<int,int>> wut(0);
    for(int i = 1; i <= n; i++) {
        cin >> col[i];
        wut.push_back({col[i],i});
    }
    sort(wut.begin(),wut.end());
    for(int i = 1; i <= n; i++) {
        cin >> wow[i];
    }
    for(int i = 0; i < m; i++) {
        cin >> a >> b;
        haha[a].push_back(b);
        haha[b].push_back(a);
    }
    for(int i = 0; i < n; i++) {
        a = wut[i].second;
        if(col[a] < wow[a]) {
            cout << 0 << "\n";
            return;
        }
        for(int j = 1; j <= n; j++) {
            bruh[j] = true;
        }
        if(!dfs(a,wow[a])) {
            cout << 0 << "\n";
            return;
        }
    }
    cout << 1 << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int t;
    cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}

Compilation message (stderr)

colors.cpp: In function 'bool dfs(int, int)':
colors.cpp:14:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for(int i = 0; i < haha[a].size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 7 / 7
• Subtask 3: 8 / 8
• Subtask 4: 0 / 15
• Subtask 5: 7 / 7
• Subtask 6: 0 / 16
• Subtask 7: 10 / 10
• Subtask 8: 0 / 22