Submission #436546

#	Time	Username	Problem	Language	Result	Execution time	Memory
436546		PiejanVDC	Keys (IOI21_keys)	C++17	9 / 100	1084 ms	45128 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);
    bool all=true;
    for(int i = 0 ; i < n ; i++) {
        if(r[i] != 0 || (int)adj[i].size()==0) {
            all=false;
            ans[i]=1;
        }
    }
    if(all) {
        vector<int>v; int mn=INT_MAX;
        for(int i = 0 ; i < n ; i++) {
            stack<int>s;
            s.push(i);
            vector<bool>vis(n,false);
            int cnt=0;
            while(!s.empty()) {
                int node = s.top();
                s.pop();
                cnt++;
                vis[node]=true;
                for(auto z : adj[node]) {
                    if(!vis[z]) s.push(z);
                }
            }
            if(cnt < mn) {
                v.clear();
                v.push_back(i);
                mn=cnt;
            } else if(mn == cnt) {
                v.push_back(i);
            }
        }
        for(auto z : v) {
            ans[z] = 1;
        }
    }
    return ans;
}

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