oj.uz

답안 #680503

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680503 2023-01-11T02:08:37 Z Ninja_Kunai 열쇠 (IOI21_keys) C++17
37 / 100
 3000 ms 171244 KB 
/**
*    Author :  Nguyen Tuan Vu
*    Created : 11.01.2023
**/

#pragma GCC optimize("O2")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define MASK(x) ((1ll)<<(x))
#define BIT(x, i) (((x)>>(i))&(1))
#define ALL(v)  (v).begin(), (v).end()
#define REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define FOR(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i)
#define db(val) "["#val" = "<<(val)<<"] "

template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int l, int r) {return l + rng() % (r - l + 1);}

const int N = 3e5 + 5;
int n, m;
vector <int> R;
struct EDGES {
    int u, v, c;

    int get(int x) {
        return (x ^ u ^ v);
    }
} edges[N];

namespace sub3 {
    vector <int> color[N];
    int par[N], Spe[N], dd[N], ans, res[N];
    vector <int> lab[N];

    int get_root(int u) {
        return (par[u] < 0 ? u : par[u] = get_root(par[u]));
    }

    void Union(int u, int v) {
        u = get_root(u);
        v = get_root(v);
        if (u == v) return;
        if (Spe[v]) swap(u, v);
        if (Spe[u]) {
            //cout << "* " << u << ' ' << v << '\n';
            par[v] = u;
            ans += lab[v].size();
            for (auto x : lab[v]) if (dd[x] == 0) {
                //cout << u << ' ' << v << '\n';
                dd[x] = 1;
                for (auto id : color[x]) Union(edges[id].u, edges[id].v);
            }

            //par[v] = u;
        }
        else {
            //cout << u << ' ' << v << '\n';
            if (lab[u].size() < lab[v].size()) swap(u, v);
            for (auto x : lab[v]) {
                lab[u].push_back(x);
            }

            par[v] = u;
        }
    }

    vector <int> solve() {
        REP(j, m) color[edges[j].c].push_back(j);

        REP(i, n) {
            REP(j, n) {
                par[j] = -1;
                Spe[j] = 0;
                dd[j] = 0;
                lab[j].clear();
                lab[j].push_back(R[j]);
            }

            ans = 1;
            Spe[i] = 1;
            for (auto id : color[R[i]]) Union(edges[id].u, edges[id].v);
            res[i] = ans;
            //cout << ans << " \n"[i == n - 1];
        }

        vector <int> a(n, 0);
        int MIN = *min_element(res, res + n);
        REP(i, n) if (MIN == res[i]) a[i] = 1;
        return a;
    }
}

vector <int> find_reachable(vector <int> r, vector <int> u, vector <int> v, vector <int> c) {
    n = r.size(); m = u.size();
    R = r;
    REP(i, m) edges[i] = {u[i], v[i], c[i]};
    return sub3::solve();
    return vector <int> (n, 0);
}

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|
4 5
0 1 0
0 2 0
1 2 1
1 3 0
3 1 2

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/
/*
⣿⣿⣿⣿⣿⣿⡷⣯⢿⣿⣷⣻⢯⣿⡽⣻⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣇⠸⣿⣿⣆⠹⣿⣿⢾⣟⣯⣿⣿⣿⣿⣿⣿⣽⣻⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣻⣽⡿⣿⣎⠙⣿⣞⣷⡌⢻⣟⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣿⣿⡄⠹⣿⣿⡆⠻⣿⣟⣯⡿⣽⡿⣿⣿⣿⣿⣽⡷⣯⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣷⣿⣿⣿⡀⠹⣟⣾⣟⣆⠹⣯⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢠⡘⣿⣿⡄⠉⢿⣿⣽⡷⣿⣻⣿⣿⣿⣿⡝⣷⣯⢿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣯⢿⣾⢿⣿⡄⢄⠘⢿⣞⡿⣧⡈⢷⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⢸⣧⠘⣿⣷⠈⣦⠙⢿⣽⣷⣻⣽⣿⣿⣿⣿⣌⢿⣯⢿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣟⣯⣿⢿⣿⡆⢸⡷⡈⢻⡽⣷⡷⡄⠻⣽⣿⣿⡿⣿⣿⣿⣿⣿⣿⣷⣿⣿⣿⣿⣏⢰⣯⢷⠈⣿⡆⢹⢷⡌⠻⡾⢋⣱⣯⣿⣿⣿⣿⡆⢻⡿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡎⣿⢾⡿⣿⡆⢸⣽⢻⣄⠹⣷⣟⣿⣄⠹⣟⣿⣿⣟⣿⣿⣿⣿⣿⣿⣽⣿⣿⣿⡇⢸⣯⣟⣧⠘⣷⠈⡯⠛⢀⡐⢾⣟⣷⣻⣿⣿⣿⡿⡌⢿⣻⣿⣿
⣿⣿⣿⣿⣿⣿⣧⢸⡿⣟⣿⡇⢸⣯⣟⣮⢧⡈⢿⣞⡿⣦⠘⠏⣹⣿⣽⢿⣿⣿⣿⣿⣯⣿⣿⣿⡇⢸⣿⣿⣾⡆⠹⢀⣠⣾⣟⣷⡈⢿⣞⣯⢿⣿⣿⣿⢷⠘⣯⣿⣿
⣿⣿⣿⣿⣿⣿⣿⡈⣿⢿⣽⡇⠘⠛⠛⠛⠓⠓⠈⠛⠛⠟⠇⢀⢿⣻⣿⣯⢿⣿⣿⣿⣷⢿⣿⣿⠁⣾⣿⣿⣿⣧⡄⠇⣹⣿⣾⣯⣿⡄⠻⣽⣯⢿⣻⣿⣿⡇⢹⣾⣿
⣿⣿⣿⣿⣿⣿⣿⡇⢹⣿⡽⡇⢸⣿⣿⣿⣿⣿⣞⣆⠰⣶⣶⡄⢀⢻⡿⣯⣿⡽⣿⣿⣿⢯⣟⡿⢀⣿⣿⣿⣿⣿⣧⠐⣸⣿⣿⣷⣿⣿⣆⠹⣯⣿⣻⣿⣿⣿⢀⣿⢿
⣿⣿⣿⣿⣿⣿⣿⣿⠘⣯⡿⡇⢸⣿⣿⣿⣿⣿⣿⣿⣧⡈⢿⣳⠘⡄⠻⣿⢾⣽⣟⡿⣿⢯⣿⡇⢸⣿⣿⣿⣿⣿⣿⡀⢾⣿⣿⣿⣿⣿⣿⣆⠹⣾⣷⣻⣿⡿⡇⢸⣿
⣿⣿⣿⣿⣿⣿⣿⣿⡇⢹⣿⠇⢸⣿⣿⣿⣿⣿⣿⣿⣿⣷⣄⠻⡇⢹⣆⠹⣟⣾⣽⣻⣟⣿⣽⠁⣾⣿⣿⣿⣿⣿⣿⣇⣿⣿⠿⠛⠛⠉⠙⠋⢀⠁⢘⣯⣿⣿⣧⠘⣿
⣿⣿⣿⣿⣿⣿⣿⣿⣿⡈⣿⡃⢼⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⡙⠌⣿⣆⠘⣿⣞⡿⣞⡿⡞⢠⣿⣿⣿⣿⣿⡿⠛⠉⠁⢀⣀⣠⣤⣤⣶⣶⣶⡆⢻⣽⣞⡿⣷⠈⣿
⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⠘⠁⠉⠉⠉⠉⠉⠉⠉⠉⠉⠙⠛⠛⢿⣄⢻⣿⣧⠘⢯⣟⡿⣽⠁⣾⣿⣿⣿⣿⣿⡃⢀⢀⠘⠛⠿⢿⣻⣟⣯⣽⣻⣵⡀⢿⣯⣟⣿⢀⣿
⣿⣿⣿⣟⣿⣿⣿⣿⣶⣶⡆⢀⣿⣾⣿⣾⣷⣿⣶⠿⠚⠉⢀⢀⣤⣿⣷⣿⣿⣷⡈⢿⣻⢃⣼⣿⣿⣿⣿⣻⣿⣿⣿⡶⣦⣤⣄⣀⡀⠉⠛⠛⠷⣯⣳⠈⣾⡽⣾⢀⣿
⣿⢿⣿⣿⣻⣿⣿⣿⣿⣿⡿⠐⣿⣿⣿⣿⠿⠋⠁⢀⢀⣤⣾⣿⣿⣿⣿⣿⣿⣿⣿⣌⣥⣾⡿⣿⣿⣷⣿⣿⢿⣷⣿⣿⣟⣾⣽⣳⢯⣟⣶⣦⣤⡾⣟⣦⠘⣿⢾⡁⢺
⣿⣻⣿⣿⡷⣿⣿⣿⣿⣿⡗⣦⠸⡿⠋⠁⢀⢀⣠⣴⢿⣿⣽⣻⢽⣾⣟⣷⣿⣟⣿⣿⣿⣳⠿⣵⣧⣼⣿⣿⣿⣿⣿⣾⣿⣿⣿⣿⣿⣽⣳⣯⣿⣿⣿⣽⢀⢷⣻⠄⠘
⣿⢷⣻⣿⣿⣷⣻⣿⣿⣿⡷⠛⣁⢀⣀⣤⣶⣿⣛⡿⣿⣮⣽⡻⣿⣮⣽⣻⢯⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣯⢀⢸⣿⢀⡆
⠸⣟⣯⣿⣿⣷⢿⣽⣿⣿⣷⣿⣷⣆⠹⣿⣶⣯⠿⣿⣶⣟⣻⢿⣷⣽⣻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢀⣯⣟⢀⡇
⣇⠹⣟⣾⣻⣿⣿⢾⡽⣿⣿⣿⣿⣿⣆⢹⣶⣿⣻⣷⣯⣟⣿⣿⣽⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⢀⡿⡇⢸⡇
⣿⣆⠹⣷⡻⣽⣿⣯⢿⣽⣻⣿⣿⣿⣿⣆⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠇⢸⣿⠇⣼⡇
⡙⠾⣆⠹⣿⣦⠛⣿⢯⣷⢿⡽⣿⣿⣿⣿⣆⠻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠃⠎⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠏⢀⣿⣾⣣⡿⡇
⣿⣷⡌⢦⠙⣿⣿⣌⠻⣽⢯⣿⣽⣻⣿⣿⣿⣧⠩⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⢰⢣⠘⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⢀⢀⢿⣞⣷⢿⡇
⣿⣽⣆⠹⣧⠘⣿⣿⡷⣌⠙⢷⣯⡷⣟⣿⣿⣿⣷⡀⡹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣈⠃⣸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠟⢀⣴⡧⢀⠸⣿⡽⣿⢀
⢻⣽⣿⡄⢻⣷⡈⢿⣿⣿⢧⢀⠙⢿⣻⡾⣽⣻⣿⣿⣄⠌⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⢁⣰⣾⣟⡿⢀⡄⢿⣟⣿⢀
⡄⢿⣿⣷⢀⠹⣟⣆⠻⣿⣿⣆⢀⣀⠉⠻⣿⡽⣯⣿⣿⣷⣈⢻⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠋⢀⣠⠘⣯⣷⣿⡟⢀⢆⠸⣿⡟⢸
⣷⡈⢿⣿⣇⢱⡘⢿⣷⣬⣙⠿⣧⠘⣆⢀⠈⠻⣷⣟⣾⢿⣿⣆⠹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠋⣠⡞⢡⣿⢀⣿⣿⣿⠇⡄⢸⡄⢻⡇⣼
⣿⣷⡈⢿⣿⡆⢣⡀⠙⢾⣟⣿⣿⣷⡈⠂⠘⣦⡈⠿⣯⣿⢾⣿⣆⠙⠻⠿⠿⠿⠿⡿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠛⢋⣠⣾⡟⢠⣿⣿⢀⣿⣿⡟⢠⣿⢈⣧⠘⢠⣿
⣿⣿⣿⣄⠻⣿⡄⢳⡄⢆⡙⠾⣽⣿⣿⣆⡀⢹⡷⣄⠙⢿⣿⡾⣿⣆⢀⡀⢀⢀⢀⢀⢀⢀⢀⢀⢀⢀⢀⢀⣀⣠⣴⡿⣯⠏⣠⣿⣿⡏⢸⣿⡿⢁⣿⣿⢀⣿⠆⢸⣿
⣿⣿⣿⣿⣦⡙⣿⣆⢻⡌⢿⣶⢤⣉⣙⣿⣷⡀⠙⠽⠷⠄⠹⣿⣟⣿⣆⢙⣋⣤⣤⣤⣄⣀⢀⢀⢀⢀⣾⣿⣟⡷⣯⡿⢃⣼⣿⣿⣿⠇⣼⡟⣡⣿⣿⣿⢀⡿⢠⠈⣿
⣿⣿⣿⣿⣿⣷⣮⣿⣿⣿⡌⠁⢤⣤⣤⣤⣬⣭⣴⣶⣶⣶⣆⠈⢻⣿⣿⣆⢻⣿⣿⣿⣿⣿⣿⣷⣶⣤⣌⣉⡘⠛⠻⠶⣿⣿⣿⣿⡟⣰⣫⣴⣿⣿⣿⣿⠄⣷⣿⣿⣿
*/

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 10 ms 14388 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 10 ms 14420 KB Output is correct
5 Correct 8 ms 14308 KB Output is correct
6 Correct 9 ms 14416 KB Output is correct
7 Correct 11 ms 14428 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 10 ms 14388 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 10 ms 14420 KB Output is correct
5 Correct 8 ms 14308 KB Output is correct
6 Correct 9 ms 14416 KB Output is correct
7 Correct 11 ms 14428 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Correct 10 ms 14368 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14416 KB Output is correct
14 Correct 9 ms 14372 KB Output is correct
15 Correct 9 ms 14416 KB Output is correct
16 Correct 8 ms 14412 KB Output is correct
17 Correct 8 ms 14408 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14416 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 11 ms 14420 KB Output is correct
23 Correct 11 ms 14420 KB Output is correct
24 Correct 9 ms 14420 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 9 ms 14428 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 10 ms 14388 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 10 ms 14420 KB Output is correct
5 Correct 8 ms 14308 KB Output is correct
6 Correct 9 ms 14416 KB Output is correct
7 Correct 11 ms 14428 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Correct 10 ms 14368 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14416 KB Output is correct
14 Correct 9 ms 14372 KB Output is correct
15 Correct 9 ms 14416 KB Output is correct
16 Correct 8 ms 14412 KB Output is correct
17 Correct 8 ms 14408 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14416 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 11 ms 14420 KB Output is correct
23 Correct 11 ms 14420 KB Output is correct
24 Correct 9 ms 14420 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 9 ms 14428 KB Output is correct
27 Correct 79 ms 14884 KB Output is correct
28 Correct 69 ms 14880 KB Output is correct
29 Correct 62 ms 14872 KB Output is correct
30 Correct 26 ms 14576 KB Output is correct
31 Correct 12 ms 14420 KB Output is correct
32 Correct 9 ms 14420 KB Output is correct
33 Correct 12 ms 14420 KB Output is correct
34 Correct 26 ms 14572 KB Output is correct
35 Correct 35 ms 14600 KB Output is correct
36 Correct 104 ms 14776 KB Output is correct
37 Correct 113 ms 14796 KB Output is correct
38 Correct 175 ms 14976 KB Output is correct
39 Correct 174 ms 14856 KB Output is correct
40 Correct 23 ms 14676 KB Output is correct
41 Correct 56 ms 15080 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 10 ms 14388 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 10 ms 14420 KB Output is correct
5 Correct 8 ms 14308 KB Output is correct
6 Correct 9 ms 14416 KB Output is correct
7 Correct 11 ms 14428 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Execution timed out 3071 ms 171244 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 10 ms 14388 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 10 ms 14420 KB Output is correct
5 Correct 8 ms 14308 KB Output is correct
6 Correct 9 ms 14416 KB Output is correct
7 Correct 11 ms 14428 KB Output is correct
8 Correct 9 ms 14420 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Correct 10 ms 14368 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14416 KB Output is correct
14 Correct 9 ms 14372 KB Output is correct
15 Correct 9 ms 14416 KB Output is correct
16 Correct 8 ms 14412 KB Output is correct
17 Correct 8 ms 14408 KB Output is correct
18 Correct 9 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14416 KB Output is correct
21 Correct 9 ms 14420 KB Output is correct
22 Correct 11 ms 14420 KB Output is correct
23 Correct 11 ms 14420 KB Output is correct
24 Correct 9 ms 14420 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 9 ms 14428 KB Output is correct
27 Correct 79 ms 14884 KB Output is correct
28 Correct 69 ms 14880 KB Output is correct
29 Correct 62 ms 14872 KB Output is correct
30 Correct 26 ms 14576 KB Output is correct
31 Correct 12 ms 14420 KB Output is correct
32 Correct 9 ms 14420 KB Output is correct
33 Correct 12 ms 14420 KB Output is correct
34 Correct 26 ms 14572 KB Output is correct
35 Correct 35 ms 14600 KB Output is correct
36 Correct 104 ms 14776 KB Output is correct
37 Correct 113 ms 14796 KB Output is correct
38 Correct 175 ms 14976 KB Output is correct
39 Correct 174 ms 14856 KB Output is correct
40 Correct 23 ms 14676 KB Output is correct
41 Correct 56 ms 15080 KB Output is correct
42 Execution timed out 3071 ms 171244 KB Time limit exceeded
43 Halted 0 ms 0 KB -