oj.uz

Submission #596809

# Submission time Handle Problem Language Result Execution time Memory
596809 2022-07-15T06:04:06 Z wiwiho Keys (IOI21_keys) C++17
100 / 100
 1203 ms 245480 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>
 
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
 
const ll MOD = 1000000007;
const ll MAX = 2147483647;
 
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}
 
ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}
 
ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}
 
int n, m;
vector<int> R, U, V, C;
vector<vector<pii>> g;
vector<int> dsu, lst;
vector<bool> ok;
vector<int> ans;
vector<int> vst;
vector<queue<pii>> todo;
int cnt = 0, rnd = 0;
 
void init(){
    g.resize(n);
    dsu.resize(n);
    vst.resize(n);
    iota(iter(dsu), 0);
    lst.resize(n);
    todo.resize(n);
    ok.resize(n);
    ans.resize(n, MAX);
}
 
int findDSU(int a){
    if(dsu[a] != a) dsu[a] = findDSU(dsu[a]);
    return dsu[a];
}
 
void unionDSU(int a, int b){
    a = findDSU(a);
    b = findDSU(b);
    dsu[b] = a;
}
 
bool bfs(int s){
    set<int> key;
    queue<int> q;
    q.push(s);
    cnt++;
    vst[s] = cnt;
    int out = -1;
    vector<int> all;
    while(!q.empty()){
        int now = q.front();
        q.pop();
        key.insert(R[now]);
        all.eb(now);
        while(!todo[R[now]].empty()){
            pii nxt = todo[R[now]].front();
            todo[R[now]].pop();
            if(nxt.S != cnt) continue;
            if(vst[nxt.F] == cnt) continue;
            if(findDSU(nxt.F) != s){
                out = nxt.F;
                break;
            }
            vst[nxt.F] = cnt;
            q.push(nxt.F);
        }
        if(out != -1) break;
        for(pii i : g[now]){
            if(vst[i.F] == cnt) continue;
            if(key.find(i.S) != key.end()){
                if(findDSU(i.F) != s){
                    out = i.F;
                    break;
                }
                vst[i.F] = cnt;
                q.push(i.F);
            }
            else{
                todo[i.S].push(mp(i.F, cnt));
            }
        }
        if(out != -1) break;
    }
 
    if(out == -1){
        ok[s] = true;
        for(int i : all){
            ans[i] = all.size();
        }
        return false;
    }
        
    unionDSU(out, s);
    lst[out] = rnd;
    return true;
}
 
bool solve(){
    rnd++;
    
    bool tmp = false;
    for(int i = 0; i < n; i++){
        if(findDSU(i) != i) continue;
        if(lst[i] == rnd) continue;
        if(ok[i]) continue;
        if(bfs(i)) tmp = true;
    }
    return tmp;
}
 
vector<int> find_reachable(vector<int> _r, vector<int> _U, vector<int> _V, vector<int> _C){
    R = _r; U = _U; V = _V; C = _C;
 
    n = R.size();
    m = U.size();
    init();
 
    for(int i = 0; i < m; i++){
        int u = U[i], v = V[i], c = C[i];
        g[u].eb(mp(v, c));
        g[v].eb(mp(u, c));
    }
 
    while(solve());
    
    int mn = *min_element(iter(ans));
    vector<int> owo(n);
    for(int i = 0; i < n; i++){
        if(ans[i] == mn) owo[i] = 1;
    }
 
	return owo;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 420 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 300 KB Output is correct
9 Correct 1 ms 424 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 420 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 300 KB Output is correct
9 Correct 1 ms 424 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 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 340 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 0 ms 304 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 428 KB Output is correct
26 Correct 1 ms 340 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 420 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 300 KB Output is correct
9 Correct 1 ms 424 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 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 340 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 0 ms 304 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 428 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 3 ms 1848 KB Output is correct
28 Correct 3 ms 1876 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 1108 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 2 ms 852 KB Output is correct
36 Correct 2 ms 1492 KB Output is correct
37 Correct 3 ms 1588 KB Output is correct
38 Correct 3 ms 1840 KB Output is correct
39 Correct 4 ms 1876 KB Output is correct
40 Correct 2 ms 1108 KB Output is correct
41 Correct 2 ms 1108 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 420 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 300 KB Output is correct
9 Correct 1 ms 424 KB Output is correct
10 Correct 262 ms 95516 KB Output is correct
11 Correct 351 ms 245480 KB Output is correct
12 Correct 88 ms 41896 KB Output is correct
13 Correct 439 ms 218608 KB Output is correct
14 Correct 298 ms 242240 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 420 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 300 KB Output is correct
9 Correct 1 ms 424 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 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 340 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 0 ms 304 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 296 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 428 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 3 ms 1848 KB Output is correct
28 Correct 3 ms 1876 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 1108 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 852 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 2 ms 852 KB Output is correct
36 Correct 2 ms 1492 KB Output is correct
37 Correct 3 ms 1588 KB Output is correct
38 Correct 3 ms 1840 KB Output is correct
39 Correct 4 ms 1876 KB Output is correct
40 Correct 2 ms 1108 KB Output is correct
41 Correct 2 ms 1108 KB Output is correct
42 Correct 262 ms 95516 KB Output is correct
43 Correct 351 ms 245480 KB Output is correct
44 Correct 88 ms 41896 KB Output is correct
45 Correct 439 ms 218608 KB Output is correct
46 Correct 298 ms 242240 KB Output is correct
47 Correct 1 ms 300 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 259 ms 243580 KB Output is correct
51 Correct 319 ms 241872 KB Output is correct
52 Correct 307 ms 162916 KB Output is correct
53 Correct 357 ms 162884 KB Output is correct
54 Correct 319 ms 162944 KB Output is correct
55 Correct 429 ms 94832 KB Output is correct
56 Correct 450 ms 243136 KB Output is correct
57 Correct 345 ms 243304 KB Output is correct
58 Correct 443 ms 242352 KB Output is correct
59 Correct 596 ms 171960 KB Output is correct
60 Correct 479 ms 174056 KB Output is correct
61 Correct 611 ms 178528 KB Output is correct
62 Correct 1165 ms 127460 KB Output is correct
63 Correct 230 ms 143180 KB Output is correct
64 Correct 6 ms 4280 KB Output is correct
65 Correct 6 ms 4280 KB Output is correct
66 Correct 1203 ms 127288 KB Output is correct
67 Correct 31 ms 24788 KB Output is correct
68 Correct 65 ms 41036 KB Output is correct
69 Correct 529 ms 171956 KB Output is correct
70 Correct 107 ms 81328 KB Output is correct
71 Correct 390 ms 241000 KB Output is correct
72 Correct 645 ms 172044 KB Output is correct
73 Correct 1178 ms 127420 KB Output is correct