oj.uz

답안 #721132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
721132 2023-04-10T10:49:45 Z Jarif_Rahman 열쇠 (IOI21_keys) C++17
67 / 100
 3000 ms 52956 KB 
#include "keys.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

struct dsu{
    int n;
    vector<int> sz, p;
    vector<bool> bl;
    dsu(int _n): n(_n){
        sz.resize(n, 1);
        bl.assign(n, 0);
        p.resize(n);
        for(int i = 0; i < n; i++) p[i] = i;
    }
    int get(int x){
        if(p[x] != x) p[x] = get(p[x]);
        return p[x];
    }
    void unite(int a, int b){
        a = get(a), b  = get(b);
        if(a == b) return;
        if(sz[b] > sz[a]) swap(a, b);
        sz[a]+=sz[b];
        sz[b] = 0;
        p[b] = a;
        bl[a] = 1;
    }
    void reset_bl(){
        bl.assign(n, 0);
    }
};

dsu ds(0);

int n, m;
vector<int> r;
vector<vector<pair<int, int>>> graph;
vector<bool> candidate;

vector<vector<int>> waiting_list;
vector<bool> has_key;
vector<bool> bl;
void reduce_candidates(int s){
    vector<int> has_key_v, waiting_list_v, reachable;

    has_key[r[s]] = 1;
    has_key_v.pb(r[s]);

    queue<int> Q;
    Q.push(s);

    while(!Q.empty()){
        int nd = Q.front(); Q.pop();
        if(bl[nd]) continue;
        bl[nd] = 1;
        reachable.pb(nd);
        if(candidate[nd] && nd != s){
            candidate[s] = 0;
            ds.unite(nd, s);
            break;
        }
        if(!has_key[r[nd]]){
            for(int x: waiting_list[r[nd]]) if(!bl[x]) Q.push(x);
            waiting_list[r[nd]].clear();
            has_key[r[nd]] = 1;
            has_key_v.pb(r[nd]);
        }
        for(auto [x, c]: graph[nd]) if(!bl[x]){
            if(has_key[c]) Q.push(x);
            else{
                waiting_list[c].pb(x);
                waiting_list_v.pb(c);
            }
        }
    }

    for(int x: has_key_v) has_key[x] = 0;
    for(int x: waiting_list_v) waiting_list[x].clear();
    for(int x: reachable) bl[x] = 0;
}

int P;
vector<int> ans, p;
void bfs(int s){
    vector<int> has_key_v, waiting_list_v, reachable;

    has_key[r[s]] = 1;
    has_key_v.pb(r[s]);

    queue<int> Q;
    Q.push(s);

    while(!Q.empty()){
        int nd = Q.front(); Q.pop();
        if(bl[nd]) continue;
        bl[nd] = 1;
        reachable.pb(nd);
        if(!has_key[r[nd]]){
            for(int x: waiting_list[r[nd]]) if(!bl[x]) Q.push(x);
            waiting_list[r[nd]].clear();
            has_key[r[nd]] = 1;
            has_key_v.pb(r[nd]);
        }
        for(auto [x, c]: graph[nd]) if(!bl[x]){
            if(has_key[c]) Q.push(x);
            else{
                waiting_list[c].pb(x);
                waiting_list_v.pb(c);
            }
        }
    }

    for(int x: has_key_v) has_key[x] = 0;
    for(int x: waiting_list_v) waiting_list[x].clear();
    for(int x: reachable) bl[x] = 0;

    if(reachable.size() < P){
        P = reachable.size();
        for(int x: p) ans[x] = 0;
        p = reachable;
        for(int x: reachable) ans[x] = 1;
    }
    else if(reachable.size() == P){
        p.insert(p.begin(), reachable.begin(), reachable.end());
        for(int x: reachable) ans[x] = 1;
    }
}

vector<int> find_reachable(vector<int> _r, vector<int> U, vector<int> V, vector<int> C){
    swap(r, _r);
    n = r.size(), m = U.size();
    graph.resize(n);
    candidate.assign(n, 1);
    has_key.assign(n, 0);
    bl.assign(n, 0);
    waiting_list.resize(n);
    ans.resize(n);
    P = n;
    ds = dsu(n);

    for(int i = 0; i < m; i++){
        graph[U[i]].pb({V[i], C[i]});
        graph[V[i]].pb({U[i], C[i]});
    }

    vector<bool> called(n, 0);
    vector<int> o(n);
    for(int i = 0; i < n; i++) o[i] = i;

    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    shuffle(o.begin(), o.end(), rng);

    for(int k = 0; k < 100; k++){
        for(int s = 0; s < n; s++) if(candidate[o[s]] && !ds.bl[ds.get(o[s])] && !called[o[s]]){
            called[o[s]] = 1;
            reduce_candidates(o[s]);
        }
        ds.reset_bl();
    }
    for(int s = 0; s < n; s++) if(candidate[s]) bfs(s);

    return ans;
}

Compilation message

keys.cpp: In function 'void bfs(int)':
keys.cpp:122:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  122 |     if(reachable.size() < P){
      |        ~~~~~~~~~~~~~~~~~^~~
keys.cpp:128:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  128 |     else if(reachable.size() == P){
      |             ~~~~~~~~~~~~~~~~~^~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 3 ms 596 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 3 ms 536 KB Output is correct
37 Correct 5 ms 596 KB Output is correct
38 Correct 3 ms 596 KB Output is correct
39 Correct 3 ms 596 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 468 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 519 ms 25960 KB Output is correct
11 Correct 441 ms 46988 KB Output is correct
12 Correct 98 ms 8720 KB Output is correct
13 Correct 2239 ms 42664 KB Output is correct
14 Correct 419 ms 46848 KB Output is correct

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 3 ms 596 KB Output is correct
28 Correct 3 ms 596 KB Output is correct
29 Correct 3 ms 596 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 3 ms 536 KB Output is correct
37 Correct 5 ms 596 KB Output is correct
38 Correct 3 ms 596 KB Output is correct
39 Correct 3 ms 596 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 519 ms 25960 KB Output is correct
43 Correct 441 ms 46988 KB Output is correct
44 Correct 98 ms 8720 KB Output is correct
45 Correct 2239 ms 42664 KB Output is correct
46 Correct 419 ms 46848 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 415 ms 47240 KB Output is correct
51 Correct 442 ms 49636 KB Output is correct
52 Correct 1222 ms 39732 KB Output is correct
53 Correct 1196 ms 39932 KB Output is correct
54 Correct 1327 ms 39704 KB Output is correct
55 Correct 764 ms 32924 KB Output is correct
56 Execution timed out 3040 ms 52956 KB Time limit exceeded
57 Halted 0 ms 0 KB -