oj.uz

Submission #961659

# Submission time Handle Problem Language Result Execution time Memory
961659 2024-04-12T09:42:09 Z Gr1sen Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 181 ms 28372 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 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);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j]) {
                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);
    }
    for (auto i : L) {
        if (i.size() < 2) continue;
        if (i.size() == 2) return 0;
        for (int j = 0; j < i.size(); j++) {
            int a = i[(j+1)%i.size()];
            int b = i[j];
            Adj[b][a] = 1;
            Adj[a][b] = 1;
        }
    }
    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) {
    for (int i = 0; i < p.size(); i++) {
        for (int j = i+1; j < p.size(); j++) {
            if (p[i][j] == 1) return oinkoink(p);
            if (p[i][j] == 2) return oink(p);
        }
    }
    vvi Adj(p.size(), vi(p.size(), 0));
    build(Adj);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int oink(std::vector<std::vector<int> >)':
supertrees.cpp:45:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int j = 0; j < i.size(); j++) {
      |                         ~~^~~~~~~~~~
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:78:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for (int i = 0; i < p.size(); i++) {
      |                     ~~^~~~~~~~~~
supertrees.cpp:79:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |         for (int j = i+1; j < p.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 344 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 348 KB Output is correct
6 Correct 7 ms 1420 KB Output is correct
7 Correct 159 ms 26120 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 344 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 348 KB Output is correct
6 Correct 7 ms 1420 KB Output is correct
7 Correct 159 ms 26120 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 153 ms 22116 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 70 ms 16136 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 42 ms 6888 KB Output is correct
21 Correct 166 ms 25976 KB Output is correct
22 Correct 170 ms 26136 KB Output is correct
23 Correct 166 ms 26036 KB Output is correct
24 Correct 172 ms 25936 KB Output is correct
25 Correct 68 ms 16136 KB Output is correct
26 Correct 62 ms 16208 KB Output is correct
27 Correct 181 ms 26088 KB Output is correct
28 Correct 157 ms 26132 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 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 7 ms 1116 KB Output is correct
9 Correct 173 ms 22168 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 1368 KB Output is correct
13 Correct 163 ms 26112 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 70 ms 16152 KB Output is correct
18 Correct 0 ms 548 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 40 ms 7248 KB Output is correct
22 Correct 166 ms 28036 KB Output is correct
23 Correct 159 ms 27900 KB Output is correct
24 Correct 161 ms 27984 KB Output is correct
25 Correct 76 ms 18000 KB Output is correct
26 Correct 67 ms 18048 KB Output is correct
27 Correct 166 ms 27988 KB Output is correct
28 Correct 170 ms 28136 KB Output is correct
29 Correct 67 ms 18004 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 43 ms 6736 KB Output is correct
5 Correct 161 ms 25940 KB Output is correct
6 Correct 159 ms 25940 KB Output is correct
7 Correct 170 ms 25936 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 40 ms 7292 KB Output is correct
10 Correct 168 ms 28372 KB Output is correct
11 Correct 162 ms 28020 KB Output is correct
12 Correct 172 ms 27988 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Incorrect 0 ms 348 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 KB Output is correct
6 Correct 7 ms 1420 KB Output is correct
7 Correct 159 ms 26120 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 153 ms 22116 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 70 ms 16136 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 42 ms 6888 KB Output is correct
21 Correct 166 ms 25976 KB Output is correct
22 Correct 170 ms 26136 KB Output is correct
23 Correct 166 ms 26036 KB Output is correct
24 Correct 172 ms 25936 KB Output is correct
25 Correct 68 ms 16136 KB Output is correct
26 Correct 62 ms 16208 KB Output is correct
27 Correct 181 ms 26088 KB Output is correct
28 Correct 157 ms 26132 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 173 ms 22168 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 163 ms 26112 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 70 ms 16152 KB Output is correct
46 Correct 0 ms 548 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 40 ms 7248 KB Output is correct
50 Correct 166 ms 28036 KB Output is correct
51 Correct 159 ms 27900 KB Output is correct
52 Correct 161 ms 27984 KB Output is correct
53 Correct 76 ms 18000 KB Output is correct
54 Correct 67 ms 18048 KB Output is correct
55 Correct 166 ms 27988 KB Output is correct
56 Correct 170 ms 28136 KB Output is correct
57 Correct 67 ms 18004 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 4 ms 932 KB Output is correct
61 Correct 69 ms 18040 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Incorrect 0 ms 348 KB Too few ways to get from 3 to 4, should be 2 found 1
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 KB Output is correct
6 Correct 7 ms 1420 KB Output is correct
7 Correct 159 ms 26120 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 153 ms 22116 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 856 KB Output is correct
17 Correct 70 ms 16136 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 42 ms 6888 KB Output is correct
21 Correct 166 ms 25976 KB Output is correct
22 Correct 170 ms 26136 KB Output is correct
23 Correct 166 ms 26036 KB Output is correct
24 Correct 172 ms 25936 KB Output is correct
25 Correct 68 ms 16136 KB Output is correct
26 Correct 62 ms 16208 KB Output is correct
27 Correct 181 ms 26088 KB Output is correct
28 Correct 157 ms 26132 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 173 ms 22168 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 7 ms 1368 KB Output is correct
41 Correct 163 ms 26112 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 70 ms 16152 KB Output is correct
46 Correct 0 ms 548 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 40 ms 7248 KB Output is correct
50 Correct 166 ms 28036 KB Output is correct
51 Correct 159 ms 27900 KB Output is correct
52 Correct 161 ms 27984 KB Output is correct
53 Correct 76 ms 18000 KB Output is correct
54 Correct 67 ms 18048 KB Output is correct
55 Correct 166 ms 27988 KB Output is correct
56 Correct 170 ms 28136 KB Output is correct
57 Correct 67 ms 18004 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 43 ms 6736 KB Output is correct
62 Correct 161 ms 25940 KB Output is correct
63 Correct 159 ms 25940 KB Output is correct
64 Correct 170 ms 25936 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 40 ms 7292 KB Output is correct
67 Correct 168 ms 28372 KB Output is correct
68 Correct 162 ms 28020 KB Output is correct
69 Correct 172 ms 27988 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Incorrect 0 ms 348 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -