oj.uz

Submission #605665

# Submission time Handle Problem Language Result Execution time Memory
605665 2022-07-25T21:27:55 Z keta_tsimakuridze Keys (IOI21_keys) C++17
100 / 100
 1103 ms 59768 KB 
#include <vector>
#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N = 3e5 + 5;
int bad[N], p[N], f[N], vis[N], x[N];
vector<int> need[N];
pair<int, vector<int> > ans;
vector<pair<int,int > > V[N];
void upd(pair<int, vector<int> > &ans, vector<int> x) {
    if(ans.f > x.size()) {
        ans = {x.size(), x};
        return;
    } else if(ans.f == x.size()) {
        while(x.size()) ans.s.push_back(x.back()), x.pop_back();
    }
}
int dfs(int u) {

    if(f[u]) return p[u];
    f[u] = 1;
    return p[u] = dfs(x[u]);
}
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
    int n = r.size(), m = u.size();
    for(int i = 0; i < m; i++) V[u[i]].push_back({v[i], c[i]}), V[v[i]].push_back({u[i], c[i]});
    for(int i = 0; i < n; i++) p[i] = i, bad[i] = 0, f[i] = 0;
    ans.f = n;
    for(int X = 1; X <= n; X++) {
        int FF = 0;
        for(int i = 0; i < n; i++) {
            x[i] = p[i];
            if(bad[i]) continue;
            if(p[i] == i) {
                queue<int> q;
                vector<int> remk, remv;
                q.push(i); remv.push_back(i);
                int F = 0;
                while(q.size()) {
                    int u = q.front();
                    vis[u] = 1;
                    int k = r[u]; //cout << "++" << u << " " << k << " " << f[1] << endl;
                    if(!f[k]) {
                        for(int i = 0; i < need[k].size(); i++) {
                            int v = need[k][i];
                            if(vis[v]) continue;
                            if(p[u] != p[v]) {
                                // p[u] --> p[v]
                                F = 1; FF |= 1;
                                x[p[u]] = p[v];
                                break;
                            }
                            else q.push(v), vis[v] = 1, remv.push_back(v);
                        }
                        if(F) break;
                        f[k] = 1;
                        remk.push_back(k);

                    }
                    q.pop();
                    for(int i = 0; i < V[u].size(); i++) {
                        int v = V[u][i].f, k = V[u][i].s;
                        if(vis[v]) continue;
                        if(!f[k]) need[k].push_back(v), remk.push_back(k);
                        else if(p[u] != p[v]) {
                            // p[u] --> p[v]
                            F = 1; FF |= 1;
                            x[p[u]] = p[v];
                            break;
                        }
                        else q.push(v), vis[v] = 1, remv.push_back(v);
                    }
                    if(F) break;
                }
                if(!F) upd(ans, remv), bad[i] = 1;
                for(int i = 0; i < remk.size(); i++) need[remk[i]].clear(), f[remk[i]] = 0;
                for(int i = 0; i < remv.size(); i++) vis[remv[i]] = 0;
            }
        }
            if(!FF) break;
            for(int i = 0; i < n; i++) {
                f[i] = 0;
            }
            for(int i = 0; i < n; i++) {
                if(bad[i]) continue;
                p[i] = dfs(i);
            }
            for(int i = 0; i < n; i++) f[i] = 0;

    }
    vector<int> Ans(n);
    for(int i = 0; i < ans.s.size(); i++) Ans[ans.s[i]] = 1;
    return Ans;
}

Compilation message

keys.cpp: In function 'void upd(std::pair<int, std::vector<int> >&, std::vector<int>)':
keys.cpp:12:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     if(ans.f > x.size()) {
      |        ~~~~~~^~~~~~~~~~
keys.cpp:15:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     } else if(ans.f == x.size()) {
      |               ~~~~~~^~~~~~~~~~~
keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:45:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |                         for(int i = 0; i < need[k].size(); i++) {
      |                                        ~~^~~~~~~~~~~~~~~~
keys.cpp:62:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |                     for(int i = 0; i < V[u].size(); i++) {
      |                                    ~~^~~~~~~~~~~~~
keys.cpp:77:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |                 for(int i = 0; i < remk.size(); i++) need[remk[i]].clear(), f[remk[i]] = 0;
      |                                ~~^~~~~~~~~~~~~
keys.cpp:78:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |                 for(int i = 0; i < remv.size(); i++) vis[remv[i]] = 0;
      |                                ~~^~~~~~~~~~~~~
keys.cpp:93:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for(int i = 0; i < ans.s.size(); i++) Ans[ans.s[i]] = 1;
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 10 ms 14376 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14336 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 10 ms 14376 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14336 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14408 KB Output is correct
13 Correct 8 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14400 KB Output is correct
16 Correct 8 ms 14356 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14512 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 9 ms 14400 KB Output is correct
21 Correct 10 ms 14424 KB Output is correct
22 Correct 9 ms 14400 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 8 ms 14396 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 10 ms 14376 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14336 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14408 KB Output is correct
13 Correct 8 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14400 KB Output is correct
16 Correct 8 ms 14356 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14512 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 9 ms 14400 KB Output is correct
21 Correct 10 ms 14424 KB Output is correct
22 Correct 9 ms 14400 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 8 ms 14396 KB Output is correct
27 Correct 9 ms 14580 KB Output is correct
28 Correct 11 ms 14676 KB Output is correct
29 Correct 10 ms 14676 KB Output is correct
30 Correct 9 ms 14548 KB Output is correct
31 Correct 8 ms 14468 KB Output is correct
32 Correct 8 ms 14420 KB Output is correct
33 Correct 11 ms 14420 KB Output is correct
34 Correct 11 ms 14540 KB Output is correct
35 Correct 11 ms 14500 KB Output is correct
36 Correct 9 ms 14540 KB Output is correct
37 Correct 8 ms 14548 KB Output is correct
38 Correct 9 ms 14548 KB Output is correct
39 Correct 9 ms 14676 KB Output is correct
40 Correct 9 ms 14420 KB Output is correct
41 Correct 9 ms 14504 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 10 ms 14376 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14336 KB Output is correct
10 Correct 207 ms 35076 KB Output is correct
11 Correct 289 ms 51244 KB Output is correct
12 Correct 54 ms 20700 KB Output is correct
13 Correct 299 ms 44976 KB Output is correct
14 Correct 186 ms 49920 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 10 ms 14376 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14336 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14408 KB Output is correct
13 Correct 8 ms 14420 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 8 ms 14400 KB Output is correct
16 Correct 8 ms 14356 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14512 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 9 ms 14400 KB Output is correct
21 Correct 10 ms 14424 KB Output is correct
22 Correct 9 ms 14400 KB Output is correct
23 Correct 8 ms 14420 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 9 ms 14420 KB Output is correct
26 Correct 8 ms 14396 KB Output is correct
27 Correct 9 ms 14580 KB Output is correct
28 Correct 11 ms 14676 KB Output is correct
29 Correct 10 ms 14676 KB Output is correct
30 Correct 9 ms 14548 KB Output is correct
31 Correct 8 ms 14468 KB Output is correct
32 Correct 8 ms 14420 KB Output is correct
33 Correct 11 ms 14420 KB Output is correct
34 Correct 11 ms 14540 KB Output is correct
35 Correct 11 ms 14500 KB Output is correct
36 Correct 9 ms 14540 KB Output is correct
37 Correct 8 ms 14548 KB Output is correct
38 Correct 9 ms 14548 KB Output is correct
39 Correct 9 ms 14676 KB Output is correct
40 Correct 9 ms 14420 KB Output is correct
41 Correct 9 ms 14504 KB Output is correct
42 Correct 207 ms 35076 KB Output is correct
43 Correct 289 ms 51244 KB Output is correct
44 Correct 54 ms 20700 KB Output is correct
45 Correct 299 ms 44976 KB Output is correct
46 Correct 186 ms 49920 KB Output is correct
47 Correct 9 ms 14404 KB Output is correct
48 Correct 8 ms 14476 KB Output is correct
49 Correct 7 ms 14400 KB Output is correct
50 Correct 168 ms 50296 KB Output is correct
51 Correct 190 ms 50624 KB Output is correct
52 Correct 240 ms 43844 KB Output is correct
53 Correct 228 ms 44020 KB Output is correct
54 Correct 254 ms 43880 KB Output is correct
55 Correct 237 ms 41964 KB Output is correct
56 Correct 334 ms 53340 KB Output is correct
57 Correct 261 ms 52596 KB Output is correct
58 Correct 319 ms 59768 KB Output is correct
59 Correct 345 ms 52684 KB Output is correct
60 Correct 335 ms 49464 KB Output is correct
61 Correct 390 ms 52092 KB Output is correct
62 Correct 999 ms 45540 KB Output is correct
63 Correct 189 ms 45372 KB Output is correct
64 Correct 10 ms 15016 KB Output is correct
65 Correct 10 ms 14984 KB Output is correct
66 Correct 1103 ms 45468 KB Output is correct
67 Correct 35 ms 17868 KB Output is correct
68 Correct 39 ms 20152 KB Output is correct
69 Correct 341 ms 52308 KB Output is correct
70 Correct 64 ms 26056 KB Output is correct
71 Correct 179 ms 50488 KB Output is correct
72 Correct 371 ms 52660 KB Output is correct
73 Correct 1038 ms 45536 KB Output is correct