oj.uz

Submission #961658

# Submission time Handle Problem Language Result Execution time Memory
961658 2024-04-12T09:40:55 Z Gr1sen Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 184 ms 28040 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() == 0) 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 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 9 ms 1464 KB Output is correct
7 Correct 167 ms 26212 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 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 9 ms 1464 KB Output is correct
7 Correct 167 ms 26212 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 420 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 157 ms 21956 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 78 ms 16136 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 41 ms 6864 KB Output is correct
21 Correct 169 ms 26004 KB Output is correct
22 Correct 162 ms 26132 KB Output is correct
23 Correct 167 ms 26136 KB Output is correct
24 Correct 161 ms 26124 KB Output is correct
25 Correct 76 ms 16212 KB Output is correct
26 Correct 69 ms 16212 KB Output is correct
27 Correct 168 ms 25936 KB Output is correct
28 Correct 162 ms 26068 KB Output is correct

Subtask #3
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 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 8 ms 1216 KB Output is correct
9 Correct 173 ms 24060 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 1368 KB Output is correct
13 Correct 170 ms 27988 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 5 ms 1120 KB Output is correct
17 Correct 86 ms 18176 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 432 KB Output is correct
20 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
21 Halted 0 ms 0 KB -

Subtask #4
0 / 35.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 41 ms 7172 KB Output is correct
5 Correct 184 ms 27936 KB Output is correct
6 Correct 161 ms 27896 KB Output is correct
7 Correct 174 ms 28040 KB Output is correct
8 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
9 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 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 9 ms 1464 KB Output is correct
7 Correct 167 ms 26212 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 420 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 157 ms 21956 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 78 ms 16136 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 41 ms 6864 KB Output is correct
21 Correct 169 ms 26004 KB Output is correct
22 Correct 162 ms 26132 KB Output is correct
23 Correct 167 ms 26136 KB Output is correct
24 Correct 161 ms 26124 KB Output is correct
25 Correct 76 ms 16212 KB Output is correct
26 Correct 69 ms 16212 KB Output is correct
27 Correct 168 ms 25936 KB Output is correct
28 Correct 162 ms 26068 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 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 8 ms 1216 KB Output is correct
37 Correct 173 ms 24060 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 1368 KB Output is correct
41 Correct 170 ms 27988 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 5 ms 1120 KB Output is correct
45 Correct 86 ms 18176 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 432 KB Output is correct
48 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
49 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 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 9 ms 1464 KB Output is correct
7 Correct 167 ms 26212 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 420 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 157 ms 21956 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 78 ms 16136 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 41 ms 6864 KB Output is correct
21 Correct 169 ms 26004 KB Output is correct
22 Correct 162 ms 26132 KB Output is correct
23 Correct 167 ms 26136 KB Output is correct
24 Correct 161 ms 26124 KB Output is correct
25 Correct 76 ms 16212 KB Output is correct
26 Correct 69 ms 16212 KB Output is correct
27 Correct 168 ms 25936 KB Output is correct
28 Correct 162 ms 26068 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 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 8 ms 1216 KB Output is correct
37 Correct 173 ms 24060 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 1368 KB Output is correct
41 Correct 170 ms 27988 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 5 ms 1120 KB Output is correct
45 Correct 86 ms 18176 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 432 KB Output is correct
48 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
49 Halted 0 ms 0 KB -