Submission #436507

#	Time	Username	Problem	Language	Result	Execution time	Memory
436507		PiejanVDC	열쇠 (IOI21_keys)	C++17	0 / 100	1 ms	204 KiB

keys

#include "keys.h"
#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<int>adj[n];
    map<pair<int,int>,bool>mp;
    for(int i = 0 ; i < m ; i++) {
        if(mp[{u[i],v[i]}] || mp[{v[i],u[i]}]) continue;
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
        mp[{u[i],v[i]}]=true;
        mp[{v[i],u[i]}]=true;
    }
    vector<int>ans(n,0);
    for(int i = 0 ; i < n ; i++) {
        if(r[i] == 0) {
            stack<int>s;
            s.push(i);
            int cnt=-1;
            vector<bool>vis(n,false);
            while(!s.empty()) {
                cnt++;
                int node = s.top();
                vis[node]=true;
                s.pop();
                for(auto z : adj[node]) {
                    if(!vis[z]) s.push(z);
                }
            }
            ans[i]=cnt;
        }
    }
    return ans;
}

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