제출 #1213371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1213371		omsincoconut	열쇠 (IOI21_keys)	C++17	37 / 100	3094 ms	24916 KiB

keys

#include <bits/stdc++.h>

using namespace std;

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    int n = r.size(), m = u.size();

    vector<vector<pair<int, int>>> edge(n);
    for (int i = 0; i < m; i++) {
        edge[u[i]].emplace_back(v[i], c[i]);
        edge[v[i]].emplace_back(u[i], c[i]);
    }

    vector<int> p(n);
    for (int i = 0; i < n; i++) {
        queue<int> bfs;
        vector<vector<int>> pending(n);
        vector<int> colored(n), vis(n);

        bfs.push(i);
        while (!bfs.empty()) {
            int u = bfs.front();
            bfs.pop();
            if (vis[u]) continue;
            vis[u] = true;

            if (!colored[r[u]]) {
                colored[r[u]] = true;
                for (int v : pending[r[u]]) bfs.push(v);
                pending[r[u]].clear();
            }

            for (auto [v, c] : edge[u]) {
                if (colored[c]) bfs.push(v);
                else pending[c].push_back(v);
            }
        }

        p[i] = accumulate(vis.begin(), vis.end(), 0);
    }

    int min_p = *min_element(p.begin(), p.end());

    vector<int> ret(n);
    for (int i = 0; i < n; i++) ret[i] = (p[i] == min_p);
    return ret;
}

• Subtask 1: 9 / 9
• Subtask 2: 11 / 11
• Subtask 3: 17 / 17
• Subtask 4: 0 / 30
• Subtask 5: 0 / 33