oj.uz

Submission #961792

# Submission time Handle Problem Language Result Execution time Memory
961792 2024-04-12T12:56:31 Z Gr1sen Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 222 ms 27476 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];
        if (q && i.size() == 3) return 0;
        //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:68:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         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 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1600 KB Output is correct
7 Correct 165 ms 27220 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 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1600 KB Output is correct
7 Correct 165 ms 27220 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1544 KB Output is correct
13 Correct 167 ms 27476 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 956 KB Output is correct
17 Correct 68 ms 17416 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 43 ms 7496 KB Output is correct
21 Correct 160 ms 27308 KB Output is correct
22 Correct 162 ms 27304 KB Output is correct
23 Correct 161 ms 27472 KB Output is correct
24 Correct 176 ms 27272 KB Output is correct
25 Correct 75 ms 17488 KB Output is correct
26 Correct 65 ms 17492 KB Output is correct
27 Correct 161 ms 27256 KB Output is correct
28 Correct 171 ms 27388 KB Output is correct

Subtask #3
19.0 / 19.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 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 6 ms 1444 KB Output is correct
9 Correct 159 ms 27424 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 166 ms 27324 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 932 KB Output is correct
17 Correct 68 ms 17492 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 43 ms 7252 KB Output is correct
22 Correct 166 ms 27324 KB Output is correct
23 Correct 159 ms 27396 KB Output is correct
24 Correct 222 ms 27448 KB Output is correct
25 Correct 77 ms 17416 KB Output is correct
26 Correct 71 ms 17408 KB Output is correct
27 Correct 180 ms 27276 KB Output is correct
28 Correct 171 ms 27396 KB Output is correct
29 Correct 71 ms 17400 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 39 ms 7252 KB Output is correct
5 Correct 157 ms 27428 KB Output is correct
6 Correct 162 ms 27360 KB Output is correct
7 Correct 160 ms 27220 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 39 ms 7320 KB Output is correct
10 Correct 160 ms 27428 KB Output is correct
11 Correct 158 ms 27352 KB Output is correct
12 Correct 169 ms 27412 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 440 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 46 ms 7252 KB Output is correct
17 Correct 164 ms 27268 KB Output is correct
18 Correct 162 ms 27216 KB Output is correct
19 Correct 160 ms 27316 KB Output is correct
20 Correct 161 ms 27264 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 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1600 KB Output is correct
7 Correct 165 ms 27220 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1544 KB Output is correct
13 Correct 167 ms 27476 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 956 KB Output is correct
17 Correct 68 ms 17416 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 43 ms 7496 KB Output is correct
21 Correct 160 ms 27308 KB Output is correct
22 Correct 162 ms 27304 KB Output is correct
23 Correct 161 ms 27472 KB Output is correct
24 Correct 176 ms 27272 KB Output is correct
25 Correct 75 ms 17488 KB Output is correct
26 Correct 65 ms 17492 KB Output is correct
27 Correct 161 ms 27256 KB Output is correct
28 Correct 171 ms 27388 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1444 KB Output is correct
37 Correct 159 ms 27424 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 166 ms 27324 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 932 KB Output is correct
45 Correct 68 ms 17492 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 43 ms 7252 KB Output is correct
50 Correct 166 ms 27324 KB Output is correct
51 Correct 159 ms 27396 KB Output is correct
52 Correct 222 ms 27448 KB Output is correct
53 Correct 77 ms 17416 KB Output is correct
54 Correct 71 ms 17408 KB Output is correct
55 Correct 180 ms 27276 KB Output is correct
56 Correct 171 ms 27396 KB Output is correct
57 Correct 71 ms 17400 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 3 ms 1116 KB Output is correct
61 Correct 69 ms 17416 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 42 ms 7252 KB Output is correct
66 Correct 67 ms 17400 KB Output is correct
67 Correct 67 ms 17420 KB Output is correct
68 Correct 65 ms 17280 KB Output is correct
69 Correct 68 ms 17636 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 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1600 KB Output is correct
7 Correct 165 ms 27220 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1544 KB Output is correct
13 Correct 167 ms 27476 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 956 KB Output is correct
17 Correct 68 ms 17416 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 43 ms 7496 KB Output is correct
21 Correct 160 ms 27308 KB Output is correct
22 Correct 162 ms 27304 KB Output is correct
23 Correct 161 ms 27472 KB Output is correct
24 Correct 176 ms 27272 KB Output is correct
25 Correct 75 ms 17488 KB Output is correct
26 Correct 65 ms 17492 KB Output is correct
27 Correct 161 ms 27256 KB Output is correct
28 Correct 171 ms 27388 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 1444 KB Output is correct
37 Correct 159 ms 27424 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 166 ms 27324 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 932 KB Output is correct
45 Correct 68 ms 17492 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 43 ms 7252 KB Output is correct
50 Correct 166 ms 27324 KB Output is correct
51 Correct 159 ms 27396 KB Output is correct
52 Correct 222 ms 27448 KB Output is correct
53 Correct 77 ms 17416 KB Output is correct
54 Correct 71 ms 17408 KB Output is correct
55 Correct 180 ms 27276 KB Output is correct
56 Correct 171 ms 27396 KB Output is correct
57 Correct 71 ms 17400 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 39 ms 7252 KB Output is correct
62 Correct 157 ms 27428 KB Output is correct
63 Correct 162 ms 27360 KB Output is correct
64 Correct 160 ms 27220 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 39 ms 7320 KB Output is correct
67 Correct 160 ms 27428 KB Output is correct
68 Correct 158 ms 27352 KB Output is correct
69 Correct 169 ms 27412 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 440 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 46 ms 7252 KB Output is correct
74 Correct 164 ms 27268 KB Output is correct
75 Correct 162 ms 27216 KB Output is correct
76 Correct 160 ms 27316 KB Output is correct
77 Correct 161 ms 27264 KB Output is correct
78 Correct 1 ms 348 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 3 ms 1116 KB Output is correct
81 Correct 69 ms 17416 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 42 ms 7252 KB Output is correct
86 Correct 67 ms 17400 KB Output is correct
87 Correct 67 ms 17420 KB Output is correct
88 Correct 65 ms 17280 KB Output is correct
89 Correct 68 ms 17636 KB Output is correct
90 Correct 1 ms 604 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 1116 KB Output is correct
93 Correct 70 ms 17412 KB Output is correct
94 Correct 0 ms 344 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 17 ms 4804 KB Output is correct
98 Correct 73 ms 17548 KB Output is correct
99 Correct 66 ms 17420 KB Output is correct
100 Correct 69 ms 17400 KB Output is correct
101 Correct 66 ms 17412 KB Output is correct
102 Incorrect 166 ms 27228 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -