oj.uz

Submission #961796

# Submission time Handle Problem Language Result Execution time Memory
961796 2024-04-12T13:00:04 Z Gr1sen Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 175 ms 27728 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;
                if (Adj[l][a]) 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 27380 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 27380 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 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 161 ms 27320 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 500 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 69 ms 17388 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 7256 KB Output is correct
21 Correct 168 ms 27320 KB Output is correct
22 Correct 159 ms 27412 KB Output is correct
23 Correct 166 ms 27224 KB Output is correct
24 Correct 175 ms 27316 KB Output is correct
25 Correct 71 ms 17416 KB Output is correct
26 Correct 68 ms 17412 KB Output is correct
27 Correct 170 ms 27368 KB Output is correct
28 Correct 157 ms 27280 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 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 7 ms 1368 KB Output is correct
9 Correct 161 ms 27252 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 1372 KB Output is correct
13 Correct 170 ms 27404 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 1116 KB Output is correct
17 Correct 75 ms 17256 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 39 ms 7296 KB Output is correct
22 Correct 165 ms 27680 KB Output is correct
23 Correct 162 ms 27388 KB Output is correct
24 Correct 165 ms 27384 KB Output is correct
25 Correct 73 ms 17432 KB Output is correct
26 Correct 66 ms 17300 KB Output is correct
27 Correct 158 ms 27400 KB Output is correct
28 Correct 162 ms 27212 KB Output is correct
29 Correct 70 ms 17416 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 39 ms 7360 KB Output is correct
5 Correct 158 ms 27244 KB Output is correct
6 Correct 158 ms 27288 KB Output is correct
7 Correct 164 ms 27484 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 39 ms 7260 KB Output is correct
10 Correct 166 ms 27728 KB Output is correct
11 Correct 160 ms 27420 KB Output is correct
12 Correct 164 ms 27400 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 47 ms 7260 KB Output is correct
17 Correct 157 ms 27448 KB Output is correct
18 Correct 165 ms 27216 KB Output is correct
19 Correct 162 ms 27460 KB Output is correct
20 Correct 172 ms 27480 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 27380 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 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 161 ms 27320 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 500 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 69 ms 17388 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 7256 KB Output is correct
21 Correct 168 ms 27320 KB Output is correct
22 Correct 159 ms 27412 KB Output is correct
23 Correct 166 ms 27224 KB Output is correct
24 Correct 175 ms 27316 KB Output is correct
25 Correct 71 ms 17416 KB Output is correct
26 Correct 68 ms 17412 KB Output is correct
27 Correct 170 ms 27368 KB Output is correct
28 Correct 157 ms 27280 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 436 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1368 KB Output is correct
37 Correct 161 ms 27252 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 170 ms 27404 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 1116 KB Output is correct
45 Correct 75 ms 17256 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 39 ms 7296 KB Output is correct
50 Correct 165 ms 27680 KB Output is correct
51 Correct 162 ms 27388 KB Output is correct
52 Correct 165 ms 27384 KB Output is correct
53 Correct 73 ms 17432 KB Output is correct
54 Correct 66 ms 17300 KB Output is correct
55 Correct 158 ms 27400 KB Output is correct
56 Correct 162 ms 27212 KB Output is correct
57 Correct 70 ms 17416 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 68 ms 17436 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 39 ms 7224 KB Output is correct
66 Correct 66 ms 17268 KB Output is correct
67 Correct 67 ms 17492 KB Output is correct
68 Correct 66 ms 17492 KB Output is correct
69 Correct 70 ms 17472 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 163 ms 27380 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 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 161 ms 27320 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 500 KB Output is correct
16 Correct 3 ms 1116 KB Output is correct
17 Correct 69 ms 17388 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 41 ms 7256 KB Output is correct
21 Correct 168 ms 27320 KB Output is correct
22 Correct 159 ms 27412 KB Output is correct
23 Correct 166 ms 27224 KB Output is correct
24 Correct 175 ms 27316 KB Output is correct
25 Correct 71 ms 17416 KB Output is correct
26 Correct 68 ms 17412 KB Output is correct
27 Correct 170 ms 27368 KB Output is correct
28 Correct 157 ms 27280 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 436 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1368 KB Output is correct
37 Correct 161 ms 27252 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 170 ms 27404 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 1116 KB Output is correct
45 Correct 75 ms 17256 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 39 ms 7296 KB Output is correct
50 Correct 165 ms 27680 KB Output is correct
51 Correct 162 ms 27388 KB Output is correct
52 Correct 165 ms 27384 KB Output is correct
53 Correct 73 ms 17432 KB Output is correct
54 Correct 66 ms 17300 KB Output is correct
55 Correct 158 ms 27400 KB Output is correct
56 Correct 162 ms 27212 KB Output is correct
57 Correct 70 ms 17416 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 39 ms 7360 KB Output is correct
62 Correct 158 ms 27244 KB Output is correct
63 Correct 158 ms 27288 KB Output is correct
64 Correct 164 ms 27484 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 39 ms 7260 KB Output is correct
67 Correct 166 ms 27728 KB Output is correct
68 Correct 160 ms 27420 KB Output is correct
69 Correct 164 ms 27400 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 47 ms 7260 KB Output is correct
74 Correct 157 ms 27448 KB Output is correct
75 Correct 165 ms 27216 KB Output is correct
76 Correct 162 ms 27460 KB Output is correct
77 Correct 172 ms 27480 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 68 ms 17436 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 39 ms 7224 KB Output is correct
86 Correct 66 ms 17268 KB Output is correct
87 Correct 67 ms 17492 KB Output is correct
88 Correct 66 ms 17492 KB Output is correct
89 Correct 70 ms 17472 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 1 ms 348 KB Output is correct
92 Correct 3 ms 1116 KB Output is correct
93 Correct 70 ms 17280 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 1 ms 432 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 17 ms 4700 KB Output is correct
98 Correct 72 ms 17712 KB Output is correct
99 Correct 69 ms 17492 KB Output is correct
100 Correct 68 ms 17412 KB Output is correct
101 Correct 68 ms 17412 KB Output is correct
102 Incorrect 164 ms 27468 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -