oj.uz

Submission #961790

# Submission time Handle Problem Language Result Execution time Memory
961790 2024-04-12T12:54:49 Z Gr1sen Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 192 ms 28496 KB 
#include"supertrees.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>

using namespace std;

#define vi vector<int>
#define vvi vector<vi>

vvi L;
vi K, K3;
vi F;

int find(int a) {return (F[a] == -1 ? a : F[a] = find(F[a]));}

void uunion(int a, int b) {
    a = find(a); b = find(b);
    if (a == b) return;
    F[a] = b;
}

int oink(vvi p) {
    int n = p.size();
    vvi Adj(n, vi(n, 0));
    L.clear(); F.clear(); F.resize(n, -1);
    K.clear(); K.resize(n, -1); K3.clear(); K3.resize(n, 0);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            if (p[i][j]) {
                if (p[i][j] == 1) K[i] = j;
                if (p[i][j] == 3) K3[i] = 1;
                uunion(i, j);
                continue;
            }
            //cerr << i << " " << j << " " << find(i) << " " << find(j) << endl;
            if (find(i) == find(j)) return 0;
        }
    }
    L.resize(n);
    for (int i = 0; i < n; i++) {
        L[find(i)].push_back(i);
    }
    //cerr << endl;
    for (auto i : L) {
        /*
        for (auto j : i) {
            cerr << j << " ";
        }
        cerr << endl;
        //*/

        if (i.size() < 2) continue;
        if (i.size() == 2) {
            int a = i[0], b = i[1];
            if (p[a][b] >= 2) return 0;
            Adj[a][b] = 1;
            Adj[b][a] = 1;
            continue;
        }
        int l = i[i.size()-1];
        bool q = K3[l];
        //cerr << q << endl;
        int l3 = -1;
        for (int j = 0; j < i.size(); j++) {
            int a = i[j];
            if (q != K3[a]) return 0;
            //cerr << l << " " << a << " " << K[a] << " " << j << endl;
            if (l == a) break;
            if (K[a] <= a) {
                if (q && l == l3 && a == i[i.size()-1]) return 0;
                Adj[l][a] = 1;
                Adj[a][l] = 1;
                if (q && l3 == -1 && l != i[i.size()-1]) {
                    Adj[a][i[i.size()-1]] = 1;
                    Adj[i[i.size()-1]][a] = 1;
                    l3 = a;
                }
                l = a;
                continue;
            }
            Adj[K[a]][a] = 1;
            Adj[a][K[a]] = 1;
            if (q && l3 == -1) return 0;
        }
    }
    build(Adj);
    return 1;
}

int oinkoink(vvi p) {
    int n = p.size();
    vvi Adj(n, vi(n, 0));
    F.clear(); F.resize(n, -1);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j]) {
                if (find(i) == find(j)) continue;
                Adj[i][j] = 1; 
                Adj[j][i] = 1; 
                uunion(i, j);
                continue;
            }
            //cerr << i << " " << j << " " << find(i) << " " << find(j) << endl;
            if (find(i) == find(j)) return 0;
        }
    }
    build(Adj);
    return 1;
}

int construct(std::vector<std::vector<int>> p) {
    return oink(p);
}

Compilation message

supertrees.cpp: In function 'int oink(std::vector<std::vector<int> >)':
supertrees.cpp:67:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for (int j = 0; j < i.size(); j++) {
      |                         ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 162 ms 28036 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 162 ms 28036 KB Output is correct
8 Correct 0 ms 432 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 159 ms 27976 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 940 KB Output is correct
17 Correct 71 ms 18000 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 436 KB Output is correct
20 Correct 40 ms 7164 KB Output is correct
21 Correct 161 ms 27988 KB Output is correct
22 Correct 161 ms 28144 KB Output is correct
23 Correct 164 ms 27912 KB Output is correct
24 Correct 159 ms 27984 KB Output is correct
25 Correct 70 ms 18184 KB Output is correct
26 Correct 66 ms 18092 KB Output is correct
27 Correct 172 ms 27896 KB Output is correct
28 Correct 157 ms 28344 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1444 KB Output is correct
9 Correct 159 ms 28080 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 436 KB Output is correct
12 Correct 8 ms 1628 KB Output is correct
13 Correct 174 ms 28128 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 1116 KB Output is correct
17 Correct 70 ms 18000 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 42 ms 7300 KB Output is correct
22 Correct 163 ms 28496 KB Output is correct
23 Correct 158 ms 28020 KB Output is correct
24 Correct 162 ms 27988 KB Output is correct
25 Correct 68 ms 18000 KB Output is correct
26 Correct 69 ms 18004 KB Output is correct
27 Correct 192 ms 28020 KB Output is correct
28 Correct 161 ms 27984 KB Output is correct
29 Correct 72 ms 18092 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 40 ms 7256 KB Output is correct
5 Correct 158 ms 27988 KB Output is correct
6 Correct 159 ms 27984 KB Output is correct
7 Correct 163 ms 27912 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 40 ms 7252 KB Output is correct
10 Correct 166 ms 28116 KB Output is correct
11 Correct 161 ms 28216 KB Output is correct
12 Correct 169 ms 27936 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 548 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 40 ms 7264 KB Output is correct
17 Correct 177 ms 27996 KB Output is correct
18 Correct 179 ms 27896 KB Output is correct
19 Correct 160 ms 28076 KB Output is correct
20 Correct 159 ms 27988 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 162 ms 28036 KB Output is correct
8 Correct 0 ms 432 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 159 ms 27976 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 940 KB Output is correct
17 Correct 71 ms 18000 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 436 KB Output is correct
20 Correct 40 ms 7164 KB Output is correct
21 Correct 161 ms 27988 KB Output is correct
22 Correct 161 ms 28144 KB Output is correct
23 Correct 164 ms 27912 KB Output is correct
24 Correct 159 ms 27984 KB Output is correct
25 Correct 70 ms 18184 KB Output is correct
26 Correct 66 ms 18092 KB Output is correct
27 Correct 172 ms 27896 KB Output is correct
28 Correct 157 ms 28344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1444 KB Output is correct
37 Correct 159 ms 28080 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 436 KB Output is correct
40 Correct 8 ms 1628 KB Output is correct
41 Correct 174 ms 28128 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 1116 KB Output is correct
45 Correct 70 ms 18000 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 42 ms 7300 KB Output is correct
50 Correct 163 ms 28496 KB Output is correct
51 Correct 158 ms 28020 KB Output is correct
52 Correct 162 ms 27988 KB Output is correct
53 Correct 68 ms 18000 KB Output is correct
54 Correct 69 ms 18004 KB Output is correct
55 Correct 192 ms 28020 KB Output is correct
56 Correct 161 ms 27984 KB Output is correct
57 Correct 72 ms 18092 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 3 ms 932 KB Output is correct
61 Correct 78 ms 18168 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 42 ms 7412 KB Output is correct
66 Correct 75 ms 18044 KB Output is correct
67 Correct 71 ms 18292 KB Output is correct
68 Correct 77 ms 18164 KB Output is correct
69 Correct 68 ms 18088 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 7 ms 1368 KB Output is correct
7 Correct 162 ms 28036 KB Output is correct
8 Correct 0 ms 432 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 159 ms 27976 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 940 KB Output is correct
17 Correct 71 ms 18000 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 436 KB Output is correct
20 Correct 40 ms 7164 KB Output is correct
21 Correct 161 ms 27988 KB Output is correct
22 Correct 161 ms 28144 KB Output is correct
23 Correct 164 ms 27912 KB Output is correct
24 Correct 159 ms 27984 KB Output is correct
25 Correct 70 ms 18184 KB Output is correct
26 Correct 66 ms 18092 KB Output is correct
27 Correct 172 ms 27896 KB Output is correct
28 Correct 157 ms 28344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1444 KB Output is correct
37 Correct 159 ms 28080 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 436 KB Output is correct
40 Correct 8 ms 1628 KB Output is correct
41 Correct 174 ms 28128 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 1116 KB Output is correct
45 Correct 70 ms 18000 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 42 ms 7300 KB Output is correct
50 Correct 163 ms 28496 KB Output is correct
51 Correct 158 ms 28020 KB Output is correct
52 Correct 162 ms 27988 KB Output is correct
53 Correct 68 ms 18000 KB Output is correct
54 Correct 69 ms 18004 KB Output is correct
55 Correct 192 ms 28020 KB Output is correct
56 Correct 161 ms 27984 KB Output is correct
57 Correct 72 ms 18092 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 40 ms 7256 KB Output is correct
62 Correct 158 ms 27988 KB Output is correct
63 Correct 159 ms 27984 KB Output is correct
64 Correct 163 ms 27912 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 40 ms 7252 KB Output is correct
67 Correct 166 ms 28116 KB Output is correct
68 Correct 161 ms 28216 KB Output is correct
69 Correct 169 ms 27936 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 1 ms 548 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 40 ms 7264 KB Output is correct
74 Correct 177 ms 27996 KB Output is correct
75 Correct 179 ms 27896 KB Output is correct
76 Correct 160 ms 28076 KB Output is correct
77 Correct 159 ms 27988 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 3 ms 932 KB Output is correct
81 Correct 78 ms 18168 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 42 ms 7412 KB Output is correct
86 Correct 75 ms 18044 KB Output is correct
87 Correct 71 ms 18292 KB Output is correct
88 Correct 77 ms 18164 KB Output is correct
89 Correct 68 ms 18088 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 1 ms 600 KB Output is correct
92 Correct 3 ms 936 KB Output is correct
93 Correct 69 ms 18004 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 17 ms 4700 KB Output is correct
98 Correct 70 ms 18044 KB Output is correct
99 Correct 76 ms 18168 KB Output is correct
100 Correct 71 ms 18172 KB Output is correct
101 Correct 70 ms 18044 KB Output is correct
102 Incorrect 161 ms 28024 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -