oj.uz

Submission #309351

# Submission time Handle Problem Language Result Execution time Memory
309351 2020-10-03T09:41:36 Z mihai145 Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 275 ms 34196 KB 
#include "supertrees.h"
#include <vector>
#include <iostream>

const int NMAX = 1000;

std::vector <std::pair <int, int> > edges;

std::vector <std::vector <int>> input;

int N;
std::vector <std::pair <int, int>> g[NMAX + 1];

bool seen[NMAX + 1];

int nrComp;
std::vector <int> comp[NMAX + 1];

void dfsComp(int node)
{
    seen[node] = true;
    comp[nrComp].push_back(node);

    for(auto it : g[node])
        if(!seen[it.first])
            dfsComp(it.first);
}

int kId, chainId[NMAX + 1];
std::vector < int > currentChain;

void dfs(int node, int par)
{
    chainId[node] = kId;
    currentChain.push_back(node);

    if(par != -1)
        edges.push_back({par, node});

    for(auto it : g[node])
        if(chainId[it.first] == 0 && it.second == 1)
            dfs(it.first, node);
}

bool SolveComp(int c)
{
    std::vector <int> representatives;

    for(auto node : comp[c])
        if(chainId[node] == 0)
            {
                ++kId;
                currentChain.clear();
                dfs(node, -1);
                representatives.push_back(currentChain[0]);
            }

    if((int)representatives.size() == 2)
        return 0;

    if((int)representatives.size() > 2)
    {
        for(int i = 1; i < (int)representatives.size(); i++)
            edges.push_back({representatives[i], representatives[i - 1]});
        edges.push_back({representatives[0], representatives.back()});
    }

    for(int i = 0; i < (int)comp[c].size(); i++)
        for(int j = 0; j < (int)comp[c].size(); j++)
            if(i != j)
                {
                    if(chainId[comp[c][i]] != chainId[comp[c][j]])
                        {
                            if(input[comp[c][i]][comp[c][j]] != 2)
                                return false;
                        }
                    else
                        {
                            if(input[comp[c][i]][comp[c][j]] != 1)
                                return false;
                        }
                }

    return true;
}

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

	for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
            if(i != j && p[i][j] > 0)
                {
                    if(p[i][j] == 3)
                        return 0;

                    g[i].push_back({j, p[i][j]});
                }

    for(int i = 0; i < N; i++)
        if(!seen[i])
            {
                nrComp++;
                dfsComp(i);
            }

    bool haveSol = true;
    for(int i = 1; i <= nrComp; i++)
        {
            haveSol &= SolveComp(i);
            if(!haveSol)
                return 0;
        }

	std::vector<std::vector<int>> answer;
	for (int i = 0; i < N; i++) {
		std::vector<int> row;
		row.resize(N);
		answer.push_back(row);
	}

	for(auto it : edges)
        answer[it.first][it.second] = answer[it.second][it.first] = 1;

	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1792 KB Output is correct
7 Correct 258 ms 34196 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1792 KB Output is correct
7 Correct 258 ms 34196 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 237 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 114 ms 17272 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 59 ms 6908 KB Output is correct
21 Correct 242 ms 27128 KB Output is correct
22 Correct 246 ms 26232 KB Output is correct
23 Correct 251 ms 30200 KB Output is correct
24 Correct 245 ms 26108 KB Output is correct
25 Correct 104 ms 13304 KB Output is correct
26 Correct 102 ms 12272 KB Output is correct
27 Correct 275 ms 32376 KB Output is correct
28 Correct 234 ms 26104 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1408 KB Output is correct
9 Correct 235 ms 26104 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1792 KB Output is correct
13 Correct 261 ms 34168 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 115 ms 17164 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 61 ms 6904 KB Output is correct
22 Correct 241 ms 27256 KB Output is correct
23 Correct 236 ms 26232 KB Output is correct
24 Correct 256 ms 32264 KB Output is correct
25 Correct 95 ms 12408 KB Output is correct
26 Correct 100 ms 13304 KB Output is correct
27 Correct 236 ms 26232 KB Output is correct
28 Correct 263 ms 30200 KB Output is correct
29 Correct 95 ms 12300 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 60 ms 6904 KB Output is correct
5 Correct 240 ms 27256 KB Output is correct
6 Correct 239 ms 26104 KB Output is correct
7 Correct 252 ms 30124 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 60 ms 6896 KB Output is correct
10 Correct 246 ms 27256 KB Output is correct
11 Correct 239 ms 26232 KB Output is correct
12 Correct 262 ms 32264 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 60 ms 6904 KB Output is correct
17 Correct 247 ms 27256 KB Output is correct
18 Correct 242 ms 27128 KB Output is correct
19 Correct 241 ms 26488 KB Output is correct
20 Correct 237 ms 26232 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1792 KB Output is correct
7 Correct 258 ms 34196 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 237 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 114 ms 17272 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 59 ms 6908 KB Output is correct
21 Correct 242 ms 27128 KB Output is correct
22 Correct 246 ms 26232 KB Output is correct
23 Correct 251 ms 30200 KB Output is correct
24 Correct 245 ms 26108 KB Output is correct
25 Correct 104 ms 13304 KB Output is correct
26 Correct 102 ms 12272 KB Output is correct
27 Correct 275 ms 32376 KB Output is correct
28 Correct 234 ms 26104 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1408 KB Output is correct
37 Correct 235 ms 26104 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1792 KB Output is correct
41 Correct 261 ms 34168 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 115 ms 17164 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 61 ms 6904 KB Output is correct
50 Correct 241 ms 27256 KB Output is correct
51 Correct 236 ms 26232 KB Output is correct
52 Correct 256 ms 32264 KB Output is correct
53 Correct 95 ms 12408 KB Output is correct
54 Correct 100 ms 13304 KB Output is correct
55 Correct 236 ms 26232 KB Output is correct
56 Correct 263 ms 30200 KB Output is correct
57 Correct 95 ms 12300 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 6 ms 1280 KB Output is correct
61 Correct 125 ms 20348 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 62 ms 7032 KB Output is correct
66 Correct 103 ms 13432 KB Output is correct
67 Correct 101 ms 13304 KB Output is correct
68 Correct 102 ms 12664 KB Output is correct
69 Correct 99 ms 12280 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1792 KB Output is correct
7 Correct 258 ms 34196 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 237 ms 26232 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 114 ms 17272 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 59 ms 6908 KB Output is correct
21 Correct 242 ms 27128 KB Output is correct
22 Correct 246 ms 26232 KB Output is correct
23 Correct 251 ms 30200 KB Output is correct
24 Correct 245 ms 26108 KB Output is correct
25 Correct 104 ms 13304 KB Output is correct
26 Correct 102 ms 12272 KB Output is correct
27 Correct 275 ms 32376 KB Output is correct
28 Correct 234 ms 26104 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1408 KB Output is correct
37 Correct 235 ms 26104 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1792 KB Output is correct
41 Correct 261 ms 34168 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 115 ms 17164 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 61 ms 6904 KB Output is correct
50 Correct 241 ms 27256 KB Output is correct
51 Correct 236 ms 26232 KB Output is correct
52 Correct 256 ms 32264 KB Output is correct
53 Correct 95 ms 12408 KB Output is correct
54 Correct 100 ms 13304 KB Output is correct
55 Correct 236 ms 26232 KB Output is correct
56 Correct 263 ms 30200 KB Output is correct
57 Correct 95 ms 12300 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 60 ms 6904 KB Output is correct
62 Correct 240 ms 27256 KB Output is correct
63 Correct 239 ms 26104 KB Output is correct
64 Correct 252 ms 30124 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 60 ms 6896 KB Output is correct
67 Correct 246 ms 27256 KB Output is correct
68 Correct 239 ms 26232 KB Output is correct
69 Correct 262 ms 32264 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 60 ms 6904 KB Output is correct
74 Correct 247 ms 27256 KB Output is correct
75 Correct 242 ms 27128 KB Output is correct
76 Correct 241 ms 26488 KB Output is correct
77 Correct 237 ms 26232 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 0 ms 384 KB Output is correct
80 Correct 6 ms 1280 KB Output is correct
81 Correct 125 ms 20348 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 0 ms 384 KB Output is correct
84 Correct 0 ms 384 KB Output is correct
85 Correct 62 ms 7032 KB Output is correct
86 Correct 103 ms 13432 KB Output is correct
87 Correct 101 ms 13304 KB Output is correct
88 Correct 102 ms 12664 KB Output is correct
89 Correct 99 ms 12280 KB Output is correct
90 Correct 0 ms 384 KB Output is correct
91 Correct 0 ms 384 KB Output is correct
92 Correct 4 ms 896 KB Output is correct
93 Correct 98 ms 12152 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 0 ms 384 KB Output is correct
97 Correct 24 ms 3320 KB Output is correct
98 Correct 97 ms 12280 KB Output is correct
99 Correct 96 ms 12408 KB Output is correct
100 Correct 94 ms 12280 KB Output is correct
101 Correct 102 ms 12152 KB Output is correct
102 Correct 98 ms 12152 KB Output is correct
103 Correct 100 ms 12152 KB Output is correct
104 Correct 96 ms 12156 KB Output is correct
105 Correct 103 ms 12304 KB Output is correct