oj.uz

Submission #696369

# Submission time Handle Problem Language Result Execution time Memory
696369 2023-02-06T10:46:43 Z T0p_ Connecting Supertrees (IOI20_supertrees) C++14
21 / 100
 276 ms 27068 KB 
// Subtask 2

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 1000;

bool visited[N];

int construct(vector<vector<int>> p)
{
	int n = p.size();
	vector<vector<int>> ans(n, vector<int> (n, 0));
	
	vector<int> connectedList[n];
	for (int i=0 ; i<n ; i++) for (int j=0 ; j<n ; j++) if (p[i][j] == 1) connectedList[i].push_back(j);

	for (int i=0 ; i<n ; i++) for (int j=0 ; j<n ; j++) if (p[i][j] == 1 && connectedList[i] != connectedList[j]) return 0;

	for (int i=0 ; i<n ; i++) if (!visited[i])
	{
		visited[i] = true;

		for (int j=i+1 ; j<n ; j++) if (p[i][j] == 1)
		{
			visited[j] = true;
			ans[i][j] = ans[j][i] = 1;
		}
	}
	

	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1368 KB Output is correct
7 Correct 276 ms 25992 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1368 KB Output is correct
7 Correct 276 ms 25992 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 162 ms 22056 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 83 ms 14608 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 44 ms 6316 KB Output is correct
21 Correct 170 ms 24440 KB Output is correct
22 Correct 162 ms 24060 KB Output is correct
23 Correct 203 ms 25932 KB Output is correct
24 Correct 168 ms 24164 KB Output is correct
25 Correct 72 ms 14512 KB Output is correct
26 Correct 68 ms 14064 KB Output is correct
27 Correct 205 ms 27068 KB Output is correct
28 Correct 174 ms 23944 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 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 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Too few ways to get from 0 to 1, should be 2 found 0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1368 KB Output is correct
7 Correct 276 ms 25992 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 162 ms 22056 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 83 ms 14608 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 44 ms 6316 KB Output is correct
21 Correct 170 ms 24440 KB Output is correct
22 Correct 162 ms 24060 KB Output is correct
23 Correct 203 ms 25932 KB Output is correct
24 Correct 168 ms 24164 KB Output is correct
25 Correct 72 ms 14512 KB Output is correct
26 Correct 68 ms 14064 KB Output is correct
27 Correct 205 ms 27068 KB Output is correct
28 Correct 174 ms 23944 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 0 ms 212 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 9 ms 1368 KB Output is correct
7 Correct 276 ms 25992 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 162 ms 22056 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 83 ms 14608 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 44 ms 6316 KB Output is correct
21 Correct 170 ms 24440 KB Output is correct
22 Correct 162 ms 24060 KB Output is correct
23 Correct 203 ms 25932 KB Output is correct
24 Correct 168 ms 24164 KB Output is correct
25 Correct 72 ms 14512 KB Output is correct
26 Correct 68 ms 14064 KB Output is correct
27 Correct 205 ms 27068 KB Output is correct
28 Correct 174 ms 23944 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Incorrect 0 ms 212 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -