oj.uz

Submission #362805

# Submission time Handle Problem Language Result Execution time Memory
362805 2021-02-04T12:04:31 Z mathking1021 Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 277 ms 24288 KB 
#include "supertrees.h"
#include <vector>

using namespace std;

int cp[1005];
vector<int> ve[1005];

int fnd(int p)
{
    if(cp[p] == p) return p;
    return cp[p] = fnd(cp[p]);
}

void uni(int p, int q)
{
    if(fnd(p) == fnd(q)) return;
    cp[fnd(p)] = fnd(q);
}

int construct(vector<vector<int> > p) {
	int n = p.size();
	vector<vector<int> > answer;
	for(int i = 0; i < n; i++)
    {
        cp[i] = i;
    }
	for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(p[i][j]) uni(i, j);
        }
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(!p[i][j] && fnd(i) == fnd(j)) return 0;
        }
    }
	for(int i = 0; i < n; i++)
    {
		vector<int> row;
		for(int j = 0; j < n; j++)
        {
            row.push_back(0);
        }
		answer.push_back(row);
	}
	for(int i = 0; i < n; i++)
    {
        ve[fnd(i)].push_back(i);
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 1; j < ve[i].size(); j++)
        {
            answer[ve[i][j]][ve[i][j - 1]] = 1;
            answer[ve[i][j - 1]][ve[i][j]] = 1;
        }
    }
	build(answer);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 256 ms 22252 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 256 ms 22252 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 14 ms 1260 KB Output is correct
13 Correct 251 ms 24044 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 380 KB Output is correct
16 Correct 6 ms 748 KB Output is correct
17 Correct 126 ms 10220 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 66 ms 6380 KB Output is correct
21 Correct 257 ms 24044 KB Output is correct
22 Correct 258 ms 24044 KB Output is correct
23 Correct 277 ms 24044 KB Output is correct
24 Correct 249 ms 24172 KB Output is correct
25 Correct 117 ms 10208 KB Output is correct
26 Correct 112 ms 10220 KB Output is correct
27 Correct 271 ms 24044 KB Output is correct
28 Correct 264 ms 24288 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 256 ms 22252 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 14 ms 1260 KB Output is correct
13 Correct 251 ms 24044 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 380 KB Output is correct
16 Correct 6 ms 748 KB Output is correct
17 Correct 126 ms 10220 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 66 ms 6380 KB Output is correct
21 Correct 257 ms 24044 KB Output is correct
22 Correct 258 ms 24044 KB Output is correct
23 Correct 277 ms 24044 KB Output is correct
24 Correct 249 ms 24172 KB Output is correct
25 Correct 117 ms 10208 KB Output is correct
26 Correct 112 ms 10220 KB Output is correct
27 Correct 271 ms 24044 KB Output is correct
28 Correct 264 ms 24288 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 11 ms 1260 KB Output is correct
7 Correct 256 ms 22252 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 14 ms 1260 KB Output is correct
13 Correct 251 ms 24044 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 380 KB Output is correct
16 Correct 6 ms 748 KB Output is correct
17 Correct 126 ms 10220 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 66 ms 6380 KB Output is correct
21 Correct 257 ms 24044 KB Output is correct
22 Correct 258 ms 24044 KB Output is correct
23 Correct 277 ms 24044 KB Output is correct
24 Correct 249 ms 24172 KB Output is correct
25 Correct 117 ms 10208 KB Output is correct
26 Correct 112 ms 10220 KB Output is correct
27 Correct 271 ms 24044 KB Output is correct
28 Correct 264 ms 24288 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 0 ms 364 KB Output is correct
32 Incorrect 1 ms 364 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -