oj.uz

Submission #1000328

# Submission time Handle Problem Language Result Execution time Memory
1000328 2024-06-17T08:54:08 Z codefox Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 156 ms 24148 KB 
#include<bits/stdc++.h>
#include "supertrees.h"

using namespace std;

int construct(std::vector<std::vector<int>> p) 
{
    int n = p.size();
    vector<int> rep(n);
    iota(rep.begin(), rep.end(), 0);
    vector<vector<int>> b(n, vector<int>(n));

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

    for (int i = 0; i < n; i++)
    {
        if (rep[i]!=i) continue;
        for (int j = i+1; j < n; j++)
        {
            if (p[i][j]!=1) continue;
            for (int k = 0; k < n; k++)
            {
                if (p[i][k]!=p[j][k]) return 0;
            }
            b[i][j] = 1;
            b[j][i] = 1;
            rep[j] = i;
        }
    }
    vector<int> vis(n,0);

    for (int i = 0; i < n; i++)
    {
        if (rep[i]!=i) continue;
        if (vis[i]) continue;
        vector<int> cyc;
        cyc.push_back(i);
        for (int j = i+1; j < n; j++)
        {
            if (p[i][j]!=2) continue;
            if (rep[j]!=j) continue;
            for (int k = 0; k < n; k++)
            {
                if (p[i][k]==1 && rep[k]==i && p[j][k]==2) continue;
                if (p[i][k]==2 && p[j][k]==1 && rep[k]==j) continue;
                if (p[i][k]==2 && p[j][k]==2) continue;
                if (p[i][k]==0 && p[j][k]==0) continue;
                return 0;
            }
            vis[j] = 1;
            cyc.push_back(j);
        }
        if (cyc.size()==1) continue;
        if (cyc.size()==2) return 0;
        for (int j = 0; j < cyc.size()-1; j++)
        {
            b[cyc[j]][cyc[j+1]] = 1;
            b[cyc[j+1]][cyc[j]] = 1;
        }
        b[i][cyc.back()] = 1;
        b[cyc.back()][i] = 1;
    }
    build(b);
    return 1;
   
    return 0;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:62:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         for (int j = 0; j < cyc.size()-1; 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 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 115 ms 22100 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 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 115 ms 22100 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 111 ms 22024 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 55 ms 12036 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 5776 KB Output is correct
21 Correct 116 ms 22060 KB Output is correct
22 Correct 115 ms 22100 KB Output is correct
23 Correct 120 ms 22188 KB Output is correct
24 Correct 114 ms 22036 KB Output is correct
25 Correct 49 ms 12036 KB Output is correct
26 Correct 46 ms 12112 KB Output is correct
27 Correct 119 ms 22100 KB Output is correct
28 Correct 115 ms 22100 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 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 1380 KB Output is correct
9 Correct 116 ms 24076 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 115 ms 23892 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 924 KB Output is correct
17 Correct 54 ms 14160 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 29 ms 6224 KB Output is correct
22 Correct 116 ms 24076 KB Output is correct
23 Correct 114 ms 23892 KB Output is correct
24 Correct 137 ms 24148 KB Output is correct
25 Correct 61 ms 13996 KB Output is correct
26 Correct 49 ms 14160 KB Output is correct
27 Correct 117 ms 24144 KB Output is correct
28 Correct 126 ms 23892 KB Output is correct
29 Correct 48 ms 14084 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 29 ms 6228 KB Output is correct
5 Correct 115 ms 23992 KB Output is correct
6 Correct 115 ms 24060 KB Output is correct
7 Correct 121 ms 24144 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 30 ms 6268 KB Output is correct
10 Correct 125 ms 23892 KB Output is correct
11 Correct 117 ms 23904 KB Output is correct
12 Correct 124 ms 23892 KB Output is correct
13 Correct 1 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 30 ms 6144 KB Output is correct
17 Correct 156 ms 24052 KB Output is correct
18 Correct 124 ms 24076 KB Output is correct
19 Correct 156 ms 23892 KB Output is correct
20 Correct 153 ms 23932 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 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 115 ms 22100 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 111 ms 22024 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 55 ms 12036 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 5776 KB Output is correct
21 Correct 116 ms 22060 KB Output is correct
22 Correct 115 ms 22100 KB Output is correct
23 Correct 120 ms 22188 KB Output is correct
24 Correct 114 ms 22036 KB Output is correct
25 Correct 49 ms 12036 KB Output is correct
26 Correct 46 ms 12112 KB Output is correct
27 Correct 119 ms 22100 KB Output is correct
28 Correct 115 ms 22100 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 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 5 ms 1380 KB Output is correct
37 Correct 116 ms 24076 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 115 ms 23892 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 924 KB Output is correct
45 Correct 54 ms 14160 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 600 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 29 ms 6224 KB Output is correct
50 Correct 116 ms 24076 KB Output is correct
51 Correct 114 ms 23892 KB Output is correct
52 Correct 137 ms 24148 KB Output is correct
53 Correct 61 ms 13996 KB Output is correct
54 Correct 49 ms 14160 KB Output is correct
55 Correct 117 ms 24144 KB Output is correct
56 Correct 126 ms 23892 KB Output is correct
57 Correct 48 ms 14084 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 432 KB Output is correct
60 Correct 4 ms 928 KB Output is correct
61 Correct 68 ms 14072 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 29 ms 6296 KB Output is correct
66 Correct 62 ms 14164 KB Output is correct
67 Correct 54 ms 14212 KB Output is correct
68 Correct 61 ms 14088 KB Output is correct
69 Correct 48 ms 14208 KB Output is correct

Subtask #6
4.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 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 115 ms 22100 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 111 ms 22024 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 55 ms 12036 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 5776 KB Output is correct
21 Correct 116 ms 22060 KB Output is correct
22 Correct 115 ms 22100 KB Output is correct
23 Correct 120 ms 22188 KB Output is correct
24 Correct 114 ms 22036 KB Output is correct
25 Correct 49 ms 12036 KB Output is correct
26 Correct 46 ms 12112 KB Output is correct
27 Correct 119 ms 22100 KB Output is correct
28 Correct 115 ms 22100 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 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 5 ms 1380 KB Output is correct
37 Correct 116 ms 24076 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 115 ms 23892 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 924 KB Output is correct
45 Correct 54 ms 14160 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 600 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 29 ms 6224 KB Output is correct
50 Correct 116 ms 24076 KB Output is correct
51 Correct 114 ms 23892 KB Output is correct
52 Correct 137 ms 24148 KB Output is correct
53 Correct 61 ms 13996 KB Output is correct
54 Correct 49 ms 14160 KB Output is correct
55 Correct 117 ms 24144 KB Output is correct
56 Correct 126 ms 23892 KB Output is correct
57 Correct 48 ms 14084 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 29 ms 6228 KB Output is correct
62 Correct 115 ms 23992 KB Output is correct
63 Correct 115 ms 24060 KB Output is correct
64 Correct 121 ms 24144 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 30 ms 6268 KB Output is correct
67 Correct 125 ms 23892 KB Output is correct
68 Correct 117 ms 23904 KB Output is correct
69 Correct 124 ms 23892 KB Output is correct
70 Correct 1 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 30 ms 6144 KB Output is correct
74 Correct 156 ms 24052 KB Output is correct
75 Correct 124 ms 24076 KB Output is correct
76 Correct 156 ms 23892 KB Output is correct
77 Correct 153 ms 23932 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 432 KB Output is correct
80 Correct 4 ms 928 KB Output is correct
81 Correct 68 ms 14072 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 29 ms 6296 KB Output is correct
86 Correct 62 ms 14164 KB Output is correct
87 Correct 54 ms 14212 KB Output is correct
88 Correct 61 ms 14088 KB Output is correct
89 Correct 48 ms 14208 KB Output is correct
90 Correct 1 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 932 KB Output is correct
93 Correct 54 ms 14216 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 14 ms 3796 KB Output is correct
98 Correct 59 ms 14068 KB Output is correct
99 Correct 51 ms 14164 KB Output is correct
100 Correct 63 ms 14076 KB Output is correct
101 Correct 57 ms 14084 KB Output is correct
102 Correct 53 ms 14200 KB Output is correct
103 Correct 55 ms 14132 KB Output is correct
104 Correct 57 ms 14200 KB Output is correct
105 Correct 61 ms 14072 KB Output is correct