oj.uz

Submission #868863

# Submission time Handle Problem Language Result Execution time Memory
868863 2023-11-02T09:35:09 Z abcvuitunggio Keys (IOI21_keys) C++17
100 / 100
 926 ms 65108 KB 
#include <bits/stdc++.h>
using namespace std;
vector <int> ans,col[300001],ve;
vector <pair <int, int>> ke[300001];
int n,m,p[300001],d[300001],r[300001],isleaf[300001],exist[300001];
queue <int> q;
int f(int i){
    return (p[i]==i?i:p[i]=f(p[i]));
}
void unite(int i, int j){
    p[f(j)]=f(i);
}
int bfs(int s){
    q.push(s);
    d[s]=1;
    int res=-1;
    ve.clear();
    while (!q.empty()){
        int u=q.front();
        q.pop();
        if (f(u)!=f(s)){
            res=u;
            break;
        }
        ve.push_back(u);
        for (auto [v,c]:ke[u]){
            if (d[v])
                continue;
            if (exist[c]){
                d[v]=1;
                q.push(v);
                continue;
            }
            col[c].push_back(v);
        }
        for (int v:col[r[u]])
            if (!d[v]){
                d[v]=1;
                q.push(v);
            }
        col[r[u]].clear();
        exist[r[u]]=1;
    }
    for (int i:ve){
        d[i]=0;
        for (auto [v,c]:ke[i])
            col[c].clear();
        exist[r[i]]=0;
    }
    while (!q.empty()){
        d[q.front()]=0;
        ve.push_back(q.front());
        q.pop();
    }
    if (res!=-1)
        d[res]=0;
    return res;
}
vector <int> find_reachable(vector <int> R, vector <int> u, vector <int> v, vector <int> c){
    n=R.size();
    m=u.size();
    for (int i=0;i<n;i++){
        r[i]=R[i];
        p[i]=i;
        ans.push_back(0);
    }
    for (int i=0;i<m;i++){
        ke[u[i]].push_back({v[i],c[i]});
        ke[v[i]].push_back({u[i],c[i]});
    }
    bool ch=true;
    vector <pair <int, int>> tmp;
    while (ch){
        ch=false;
        tmp.clear();
        for (int i=0;i<n;i++)
            if (f(i)==i&&!isleaf[i]){
                int j=bfs(i);
                if (j==-1)
                    isleaf[i]=1;
                else{
                    tmp.push_back({j,i});
                    ch=true;
                }
            }
        for (auto [u,v]:tmp)
            unite(u,v);
    }
    int mn=1e9;
    for (int i=0;i<n;i++){
        if (i==f(i)){
            assert(bfs(i)==-1);
            mn=min(mn,(int)ve.size());
        }
    }
    for (int i=0;i<n;i++)
        if (i==f(i)){
            bfs(i);
            if (ve.size()==mn)
                for (int j:ve)
                    ans[j]=1;
        }
	return ans;
}

Compilation message

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:99:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   99 |             if (ve.size()==mn)
      |                 ~~~~~~~~~^~~~
keys.cpp:96:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   96 |     for (int i=0;i<n;i++)
      |     ^~~
keys.cpp:103:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  103 |  return ans;
      |  ^~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18008 KB Output is correct
2 Correct 4 ms 18008 KB Output is correct
3 Correct 4 ms 18164 KB Output is correct
4 Correct 4 ms 18012 KB Output is correct
5 Correct 4 ms 17988 KB Output is correct
6 Correct 4 ms 18192 KB Output is correct
7 Correct 4 ms 18176 KB Output is correct
8 Correct 4 ms 18012 KB Output is correct
9 Correct 4 ms 18012 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18008 KB Output is correct
2 Correct 4 ms 18008 KB Output is correct
3 Correct 4 ms 18164 KB Output is correct
4 Correct 4 ms 18012 KB Output is correct
5 Correct 4 ms 17988 KB Output is correct
6 Correct 4 ms 18192 KB Output is correct
7 Correct 4 ms 18176 KB Output is correct
8 Correct 4 ms 18012 KB Output is correct
9 Correct 4 ms 18012 KB Output is correct
10 Correct 4 ms 18012 KB Output is correct
11 Correct 4 ms 18012 KB Output is correct
12 Correct 4 ms 18012 KB Output is correct
13 Correct 4 ms 18264 KB Output is correct
14 Correct 4 ms 18012 KB Output is correct
15 Correct 4 ms 18208 KB Output is correct
16 Correct 4 ms 18012 KB Output is correct
17 Correct 4 ms 18012 KB Output is correct
18 Correct 5 ms 18012 KB Output is correct
19 Correct 4 ms 18012 KB Output is correct
20 Correct 4 ms 18012 KB Output is correct
21 Correct 5 ms 18012 KB Output is correct
22 Correct 4 ms 18012 KB Output is correct
23 Correct 4 ms 18012 KB Output is correct
24 Correct 4 ms 18012 KB Output is correct
25 Correct 4 ms 18168 KB Output is correct
26 Correct 4 ms 18012 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18008 KB Output is correct
2 Correct 4 ms 18008 KB Output is correct
3 Correct 4 ms 18164 KB Output is correct
4 Correct 4 ms 18012 KB Output is correct
5 Correct 4 ms 17988 KB Output is correct
6 Correct 4 ms 18192 KB Output is correct
7 Correct 4 ms 18176 KB Output is correct
8 Correct 4 ms 18012 KB Output is correct
9 Correct 4 ms 18012 KB Output is correct
10 Correct 4 ms 18012 KB Output is correct
11 Correct 4 ms 18012 KB Output is correct
12 Correct 4 ms 18012 KB Output is correct
13 Correct 4 ms 18264 KB Output is correct
14 Correct 4 ms 18012 KB Output is correct
15 Correct 4 ms 18208 KB Output is correct
16 Correct 4 ms 18012 KB Output is correct
17 Correct 4 ms 18012 KB Output is correct
18 Correct 5 ms 18012 KB Output is correct
19 Correct 4 ms 18012 KB Output is correct
20 Correct 4 ms 18012 KB Output is correct
21 Correct 5 ms 18012 KB Output is correct
22 Correct 4 ms 18012 KB Output is correct
23 Correct 4 ms 18012 KB Output is correct
24 Correct 4 ms 18012 KB Output is correct
25 Correct 4 ms 18168 KB Output is correct
26 Correct 4 ms 18012 KB Output is correct
27 Correct 5 ms 18268 KB Output is correct
28 Correct 5 ms 18268 KB Output is correct
29 Correct 5 ms 18264 KB Output is correct
30 Correct 4 ms 18268 KB Output is correct
31 Correct 6 ms 18268 KB Output is correct
32 Correct 5 ms 18184 KB Output is correct
33 Correct 5 ms 18268 KB Output is correct
34 Correct 5 ms 18268 KB Output is correct
35 Correct 4 ms 18268 KB Output is correct
36 Correct 5 ms 18268 KB Output is correct
37 Correct 5 ms 18264 KB Output is correct
38 Correct 5 ms 18264 KB Output is correct
39 Correct 5 ms 18268 KB Output is correct
40 Correct 5 ms 18268 KB Output is correct
41 Correct 5 ms 18268 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18008 KB Output is correct
2 Correct 4 ms 18008 KB Output is correct
3 Correct 4 ms 18164 KB Output is correct
4 Correct 4 ms 18012 KB Output is correct
5 Correct 4 ms 17988 KB Output is correct
6 Correct 4 ms 18192 KB Output is correct
7 Correct 4 ms 18176 KB Output is correct
8 Correct 4 ms 18012 KB Output is correct
9 Correct 4 ms 18012 KB Output is correct
10 Correct 188 ms 37696 KB Output is correct
11 Correct 221 ms 49084 KB Output is correct
12 Correct 41 ms 24024 KB Output is correct
13 Correct 310 ms 47712 KB Output is correct
14 Correct 144 ms 50236 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18008 KB Output is correct
2 Correct 4 ms 18008 KB Output is correct
3 Correct 4 ms 18164 KB Output is correct
4 Correct 4 ms 18012 KB Output is correct
5 Correct 4 ms 17988 KB Output is correct
6 Correct 4 ms 18192 KB Output is correct
7 Correct 4 ms 18176 KB Output is correct
8 Correct 4 ms 18012 KB Output is correct
9 Correct 4 ms 18012 KB Output is correct
10 Correct 4 ms 18012 KB Output is correct
11 Correct 4 ms 18012 KB Output is correct
12 Correct 4 ms 18012 KB Output is correct
13 Correct 4 ms 18264 KB Output is correct
14 Correct 4 ms 18012 KB Output is correct
15 Correct 4 ms 18208 KB Output is correct
16 Correct 4 ms 18012 KB Output is correct
17 Correct 4 ms 18012 KB Output is correct
18 Correct 5 ms 18012 KB Output is correct
19 Correct 4 ms 18012 KB Output is correct
20 Correct 4 ms 18012 KB Output is correct
21 Correct 5 ms 18012 KB Output is correct
22 Correct 4 ms 18012 KB Output is correct
23 Correct 4 ms 18012 KB Output is correct
24 Correct 4 ms 18012 KB Output is correct
25 Correct 4 ms 18168 KB Output is correct
26 Correct 4 ms 18012 KB Output is correct
27 Correct 5 ms 18268 KB Output is correct
28 Correct 5 ms 18268 KB Output is correct
29 Correct 5 ms 18264 KB Output is correct
30 Correct 4 ms 18268 KB Output is correct
31 Correct 6 ms 18268 KB Output is correct
32 Correct 5 ms 18184 KB Output is correct
33 Correct 5 ms 18268 KB Output is correct
34 Correct 5 ms 18268 KB Output is correct
35 Correct 4 ms 18268 KB Output is correct
36 Correct 5 ms 18268 KB Output is correct
37 Correct 5 ms 18264 KB Output is correct
38 Correct 5 ms 18264 KB Output is correct
39 Correct 5 ms 18268 KB Output is correct
40 Correct 5 ms 18268 KB Output is correct
41 Correct 5 ms 18268 KB Output is correct
42 Correct 188 ms 37696 KB Output is correct
43 Correct 221 ms 49084 KB Output is correct
44 Correct 41 ms 24024 KB Output is correct
45 Correct 310 ms 47712 KB Output is correct
46 Correct 144 ms 50236 KB Output is correct
47 Correct 4 ms 18012 KB Output is correct
48 Correct 4 ms 18012 KB Output is correct
49 Correct 4 ms 18012 KB Output is correct
50 Correct 139 ms 53608 KB Output is correct
51 Correct 162 ms 53696 KB Output is correct
52 Correct 186 ms 47560 KB Output is correct
53 Correct 186 ms 47556 KB Output is correct
54 Correct 256 ms 47388 KB Output is correct
55 Correct 221 ms 44460 KB Output is correct
56 Correct 298 ms 57200 KB Output is correct
57 Correct 270 ms 56496 KB Output is correct
58 Correct 262 ms 65108 KB Output is correct
59 Correct 330 ms 54572 KB Output is correct
60 Correct 307 ms 53952 KB Output is correct
61 Correct 516 ms 54296 KB Output is correct
62 Correct 809 ms 48680 KB Output is correct
63 Correct 151 ms 49720 KB Output is correct
64 Correct 7 ms 18520 KB Output is correct
65 Correct 8 ms 18524 KB Output is correct
66 Correct 926 ms 49404 KB Output is correct
67 Correct 18 ms 21208 KB Output is correct
68 Correct 28 ms 23052 KB Output is correct
69 Correct 443 ms 54680 KB Output is correct
70 Correct 54 ms 28408 KB Output is correct
71 Correct 174 ms 49592 KB Output is correct
72 Correct 345 ms 54724 KB Output is correct
73 Correct 896 ms 48740 KB Output is correct