oj.uz

Submission #430684

# Submission time Handle Problem Language Result Execution time Memory
430684 2021-06-16T18:24:54 Z MeGustaElArroz23 Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 269 ms 22212 KB 
//////////////////

#include<bits/stdc++.h>
#include "supertrees.h"

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;

vi comp;

int find(int x){
    if (comp[x]==x) return x;
    int sol=find(comp[x]);
    comp[x]=sol;
    return sol;
}
void unite(int a, int b){
    a=find(a);
    b=find(b);
    comp[a]=b;
}

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();

    for (int i=0;i<n;i++){
        for (int j=0;j<n;j++){
            if (p[i][j]==3) return 0;
        }
    }

    vvi res(n,vi(n,0));

    comp=vi(n);
    for (int i=0;i<n;i++) comp[i]=i;

	for (int i=0;i<n;i++){
        for (int j=0;j<n;j++){
            if (p[i][j]==1){
                if (find(i)!=find(j)){
                    unite(i,j);
                    res[i][j]=1;
                    res[j][i]=1;
                }
            }
        }
    }

    vi nodes;
    for (int i=0;i<n;i++){
        if (comp[i]==i) nodes.push_back(i);
    }

    for (int i=0;i<n;i++){
        for (int j=0;j<n;j++){
            if (find(i)==find(j) and p[i][j]!=1) return 0;
        }
    }
    //hemos acabado con los de 1

    for (int i:nodes){
        for (int j:nodes){
            if (p[i][j]==2){
                if (find(i)!=find(j)){
                    unite(i,j);
                }
            }
        }
    }

    vvi ciclos(n);
    for (int i:nodes){
        ciclos[find(i)].push_back(i);
    }

    for (int i:nodes){
        if (ciclos[i].size()<=1) continue;
        else if (ciclos[i].size()==2) return 0;
        else{
            for (int j=0;j<ciclos[i].size();j++){
                res[ciclos[i][j]][ciclos[i][(j+1)%ciclos[i].size()]]=1;
                res[ciclos[i][(j+1)%ciclos[i].size()]][ciclos[i][j]]=1;
            }
        }
        for (int j:ciclos[i]){
            for (int k:ciclos[i]){
                //cerr<< j << ' ' << k << '\n';
                if (j!=k and p[j][k]!=2) return 0;
            }
        }
    }

    build(res);

	return 1;

    //comprobar si funciona
    //mejorar complejidad dsu
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 245 ms 22140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 245 ms 22140 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 228 ms 22012 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 135 ms 12028 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 61 ms 5756 KB Output is correct
21 Correct 238 ms 22072 KB Output is correct
22 Correct 255 ms 21960 KB Output is correct
23 Correct 258 ms 22212 KB Output is correct
24 Correct 237 ms 22084 KB Output is correct
25 Correct 100 ms 12144 KB Output is correct
26 Correct 104 ms 12028 KB Output is correct
27 Correct 257 ms 22008 KB Output is correct
28 Correct 262 ms 22040 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 10 ms 1100 KB Output is correct
9 Correct 232 ms 21988 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 242 ms 22140 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 716 KB Output is correct
17 Correct 125 ms 12172 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 61 ms 5700 KB Output is correct
22 Correct 237 ms 22068 KB Output is correct
23 Correct 269 ms 22000 KB Output is correct
24 Correct 260 ms 22024 KB Output is correct
25 Correct 99 ms 12160 KB Output is correct
26 Correct 104 ms 12168 KB Output is correct
27 Correct 244 ms 22012 KB Output is correct
28 Correct 250 ms 22152 KB Output is correct
29 Correct 111 ms 12100 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 60 ms 5728 KB Output is correct
5 Correct 242 ms 22032 KB Output is correct
6 Correct 234 ms 22020 KB Output is correct
7 Correct 265 ms 21964 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 60 ms 5744 KB Output is correct
10 Correct 241 ms 22020 KB Output is correct
11 Correct 229 ms 22024 KB Output is correct
12 Correct 255 ms 22012 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 59 ms 5764 KB Output is correct
17 Correct 233 ms 22008 KB Output is correct
18 Correct 242 ms 21956 KB Output is correct
19 Correct 243 ms 21964 KB Output is correct
20 Correct 235 ms 22096 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 245 ms 22140 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 228 ms 22012 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 135 ms 12028 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 61 ms 5756 KB Output is correct
21 Correct 238 ms 22072 KB Output is correct
22 Correct 255 ms 21960 KB Output is correct
23 Correct 258 ms 22212 KB Output is correct
24 Correct 237 ms 22084 KB Output is correct
25 Correct 100 ms 12144 KB Output is correct
26 Correct 104 ms 12028 KB Output is correct
27 Correct 257 ms 22008 KB Output is correct
28 Correct 262 ms 22040 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1100 KB Output is correct
37 Correct 232 ms 21988 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 242 ms 22140 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 7 ms 716 KB Output is correct
45 Correct 125 ms 12172 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 61 ms 5700 KB Output is correct
50 Correct 237 ms 22068 KB Output is correct
51 Correct 269 ms 22000 KB Output is correct
52 Correct 260 ms 22024 KB Output is correct
53 Correct 99 ms 12160 KB Output is correct
54 Correct 104 ms 12168 KB Output is correct
55 Correct 244 ms 22012 KB Output is correct
56 Correct 250 ms 22152 KB Output is correct
57 Correct 111 ms 12100 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 5 ms 708 KB Output is correct
61 Correct 120 ms 12040 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 60 ms 5752 KB Output is correct
66 Correct 103 ms 12172 KB Output is correct
67 Correct 100 ms 12028 KB Output is correct
68 Correct 108 ms 12152 KB Output is correct
69 Correct 99 ms 12100 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1100 KB Output is correct
7 Correct 245 ms 22140 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1100 KB Output is correct
13 Correct 228 ms 22012 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 135 ms 12028 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 61 ms 5756 KB Output is correct
21 Correct 238 ms 22072 KB Output is correct
22 Correct 255 ms 21960 KB Output is correct
23 Correct 258 ms 22212 KB Output is correct
24 Correct 237 ms 22084 KB Output is correct
25 Correct 100 ms 12144 KB Output is correct
26 Correct 104 ms 12028 KB Output is correct
27 Correct 257 ms 22008 KB Output is correct
28 Correct 262 ms 22040 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1100 KB Output is correct
37 Correct 232 ms 21988 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 242 ms 22140 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 7 ms 716 KB Output is correct
45 Correct 125 ms 12172 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 61 ms 5700 KB Output is correct
50 Correct 237 ms 22068 KB Output is correct
51 Correct 269 ms 22000 KB Output is correct
52 Correct 260 ms 22024 KB Output is correct
53 Correct 99 ms 12160 KB Output is correct
54 Correct 104 ms 12168 KB Output is correct
55 Correct 244 ms 22012 KB Output is correct
56 Correct 250 ms 22152 KB Output is correct
57 Correct 111 ms 12100 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 60 ms 5728 KB Output is correct
62 Correct 242 ms 22032 KB Output is correct
63 Correct 234 ms 22020 KB Output is correct
64 Correct 265 ms 21964 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 60 ms 5744 KB Output is correct
67 Correct 241 ms 22020 KB Output is correct
68 Correct 229 ms 22024 KB Output is correct
69 Correct 255 ms 22012 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 59 ms 5764 KB Output is correct
74 Correct 233 ms 22008 KB Output is correct
75 Correct 242 ms 21956 KB Output is correct
76 Correct 243 ms 21964 KB Output is correct
77 Correct 235 ms 22096 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
79 Correct 1 ms 204 KB Output is correct
80 Correct 5 ms 708 KB Output is correct
81 Correct 120 ms 12040 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 60 ms 5752 KB Output is correct
86 Correct 103 ms 12172 KB Output is correct
87 Correct 100 ms 12028 KB Output is correct
88 Correct 108 ms 12152 KB Output is correct
89 Correct 99 ms 12100 KB Output is correct
90 Correct 1 ms 204 KB Output is correct
91 Correct 1 ms 204 KB Output is correct
92 Correct 5 ms 588 KB Output is correct
93 Correct 98 ms 8072 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 24 ms 2184 KB Output is correct
98 Correct 95 ms 8056 KB Output is correct
99 Correct 97 ms 8072 KB Output is correct
100 Correct 94 ms 8060 KB Output is correct
101 Correct 94 ms 8060 KB Output is correct
102 Correct 98 ms 8060 KB Output is correct
103 Correct 95 ms 8132 KB Output is correct
104 Correct 122 ms 8072 KB Output is correct
105 Correct 104 ms 8064 KB Output is correct