Submission #1058686

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058686		qwusha	Keys (IOI21_keys)	C++17	0 / 100	0 ms	348 KiB

keys

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
typedef long double ld;
const ld eps = 1e-8;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const ll inf = 1e18;
const ll mod = 1e9 + 7;

#include "keys.h"


vector<set<int>> g;
vector<int> num;
int cnt = 0;

void dfs(int v, int number) {
    num[v] = number;
    cnt++;
    for (auto u : g[v]) {
        if (num[u] == -1) {
            dfs(u, number);
        }
    }
}

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    ll n = r.size();
    int m = u.size();
    vector<int> res(n);
    bool ok = 0;
    for (int i = 0; i < n; i++) {
        res[i] = (r[i] != 0);
        if (res[i])
            ok = 1;
    }
    if (ok)
        return res;
    else {
        g.resize(n);
        for (int i = 0; i < m; i++) {
            g[u[i]].insert(v[i]);
            g[v[i]].insert(u[i]);
        }
        num.resize(n, -1);
        vector<int> sz;
        int mini = n + 1;
        for (int i = 0; i < n; i++) {
            if (num[i] == -1) {
                cnt = 0;
                dfs(i, sz.size());
                sz.push_back(cnt);
                mini = min(mini, cnt);
            }
        }
        for (int i = 0; i < n; i++) {
            if (sz[num[i]] == mini) {
                res[i] = 1;
            }
        }
        return res;
    }
}

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