oj.uz

Submission #609748

# Submission time Handle Problem Language Result Execution time Memory
609748 2022-07-27T20:38:02 Z duality Keys (IOI21_keys) C++17
100 / 100
 1186 ms 62144 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "keys.h"

int key[300000];
vpii adjList[300000];
int parent[300000];
int find(int n) {
    if (parent[n] != n) parent[n] = find(parent[n]);
    return parent[n];
}
queue<int> Q;
int visited[300000],ans[300000],seen[300000];
vi poss[300000];
int doBFS(int s,int n) {
    int i;
    vi vv,ee;
    Q.push(s);
    while (!Q.empty()) {
        int u = Q.front();
        Q.pop();

        if (find(u) != find(s)) {
            for (int v: vv) seen[key[v]] = 0;
            for (int c: ee) poss[c].clear();
            while (!Q.empty()) Q.pop();
            return u;
        }
        if (visited[u]) continue;
        visited[u] = 1,vv.pb(u),seen[key[u]] = 1;
        while (!poss[key[u]].empty()) Q.push(poss[key[u]].back()),poss[key[u]].pop_back();
        for (auto [v,c]: adjList[u]) {
            if (seen[c]) Q.push(v);
            else ee.pb(c),poss[c].pb(v);
        }
    }
    for (int v: vv) ans[v] = vv.size(),seen[key[v]] = 0;
    for (int c: ee) poss[c].clear();
    while (!Q.empty()) Q.pop();
    return -1;
}
vector<int> find_reachable(vector<int> r,vector<int> u,vector<int> v,vector<int> c) {
    int i,n = r.size(),m = c.size();
    copy(r.begin(),r.end(),key);
    for (i = 0; i < m; i++) {
        adjList[u[i]].pb(mp(v[i],c[i]));
        adjList[v[i]].pb(mp(u[i],c[i]));
    }
    for (i = 0; i < n; i++) parent[i] = i,ans[i] = 1e9;
    int f = 1;
    while (f) {
        f = 0;
        vpii vv;
        fill(visited,visited+n,0);
        for (i = 0; i < n; i++) {
            if (find(i) == i) {
                int v = doBFS(i,n);
                if (v != -1) vv.pb(mp(i,v)),f = 1;
            }
        }
        for (auto [u,v]: vv) {
            if (find(u) != find(v)) parent[find(u)] = find(v);
        }
    }
    int x = *min_element(ans,ans+n);
    for (i = 0; i < n; i++) ans[i] = (ans[i] == x);
    return vi(ans,ans+n);
}

Compilation message

keys.cpp: In function 'int doBFS(int, int)':
keys.cpp:70:9: warning: unused variable 'i' [-Wunused-variable]
   70 |     int i;
      |         ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 7 ms 14412 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14408 KB Output is correct
6 Correct 8 ms 14356 KB Output is correct
7 Correct 9 ms 14532 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 7 ms 14412 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14408 KB Output is correct
6 Correct 8 ms 14356 KB Output is correct
7 Correct 9 ms 14532 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 8 ms 14360 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 7 ms 14360 KB Output is correct
13 Correct 8 ms 14416 KB Output is correct
14 Correct 7 ms 14412 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 10 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14412 KB Output is correct
22 Correct 10 ms 14420 KB Output is correct
23 Correct 9 ms 14336 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 7 ms 14420 KB Output is correct
26 Correct 7 ms 14420 KB Output is correct
27 Correct 9 ms 14616 KB Output is correct
28 Correct 9 ms 14676 KB Output is correct
29 Correct 8 ms 14676 KB Output is correct
30 Correct 8 ms 14548 KB Output is correct
31 Correct 8 ms 14420 KB Output is correct
32 Correct 8 ms 14420 KB Output is correct
33 Correct 9 ms 14420 KB Output is correct
34 Correct 9 ms 14420 KB Output is correct
35 Correct 11 ms 14420 KB Output is correct
36 Correct 11 ms 14576 KB Output is correct
37 Correct 10 ms 14676 KB Output is correct
38 Correct 10 ms 14680 KB Output is correct
39 Correct 8 ms 14676 KB Output is correct
40 Correct 8 ms 14504 KB Output is correct
41 Correct 8 ms 14548 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 7 ms 14412 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14408 KB Output is correct
6 Correct 8 ms 14356 KB Output is correct
7 Correct 9 ms 14532 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 217 ms 38332 KB Output is correct
11 Correct 254 ms 52704 KB Output is correct
12 Correct 56 ms 20752 KB Output is correct
13 Correct 384 ms 45884 KB Output is correct
14 Correct 168 ms 47500 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 7 ms 14412 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14408 KB Output is correct
6 Correct 8 ms 14356 KB Output is correct
7 Correct 9 ms 14532 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 8 ms 14360 KB Output is correct
11 Correct 7 ms 14420 KB Output is correct
12 Correct 7 ms 14360 KB Output is correct
13 Correct 8 ms 14416 KB Output is correct
14 Correct 7 ms 14412 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 10 ms 14420 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 7 ms 14420 KB Output is correct
21 Correct 7 ms 14412 KB Output is correct
22 Correct 10 ms 14420 KB Output is correct
23 Correct 9 ms 14336 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 7 ms 14420 KB Output is correct
26 Correct 7 ms 14420 KB Output is correct
27 Correct 9 ms 14616 KB Output is correct
28 Correct 9 ms 14676 KB Output is correct
29 Correct 8 ms 14676 KB Output is correct
30 Correct 8 ms 14548 KB Output is correct
31 Correct 8 ms 14420 KB Output is correct
32 Correct 8 ms 14420 KB Output is correct
33 Correct 9 ms 14420 KB Output is correct
34 Correct 9 ms 14420 KB Output is correct
35 Correct 11 ms 14420 KB Output is correct
36 Correct 11 ms 14576 KB Output is correct
37 Correct 10 ms 14676 KB Output is correct
38 Correct 10 ms 14680 KB Output is correct
39 Correct 8 ms 14676 KB Output is correct
40 Correct 8 ms 14504 KB Output is correct
41 Correct 8 ms 14548 KB Output is correct
42 Correct 217 ms 38332 KB Output is correct
43 Correct 254 ms 52704 KB Output is correct
44 Correct 56 ms 20752 KB Output is correct
45 Correct 384 ms 45884 KB Output is correct
46 Correct 168 ms 47500 KB Output is correct
47 Correct 8 ms 14412 KB Output is correct
48 Correct 7 ms 14420 KB Output is correct
49 Correct 7 ms 14416 KB Output is correct
50 Correct 152 ms 49652 KB Output is correct
51 Correct 176 ms 51288 KB Output is correct
52 Correct 266 ms 44576 KB Output is correct
53 Correct 265 ms 44648 KB Output is correct
54 Correct 269 ms 44564 KB Output is correct
55 Correct 254 ms 41628 KB Output is correct
56 Correct 319 ms 53616 KB Output is correct
57 Correct 271 ms 51776 KB Output is correct
58 Correct 281 ms 62144 KB Output is correct
59 Correct 361 ms 53104 KB Output is correct
60 Correct 366 ms 52376 KB Output is correct
61 Correct 336 ms 53584 KB Output is correct
62 Correct 1103 ms 49008 KB Output is correct
63 Correct 210 ms 46984 KB Output is correct
64 Correct 10 ms 14972 KB Output is correct
65 Correct 10 ms 14932 KB Output is correct
66 Correct 1134 ms 49020 KB Output is correct
67 Correct 23 ms 17636 KB Output is correct
68 Correct 32 ms 19808 KB Output is correct
69 Correct 389 ms 53096 KB Output is correct
70 Correct 59 ms 25176 KB Output is correct
71 Correct 166 ms 48072 KB Output is correct
72 Correct 363 ms 53092 KB Output is correct
73 Correct 1186 ms 48976 KB Output is correct