Submission #770996

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
770996	2023-07-02T10:08:51 Z	OrazB	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	155 ms	28420 KB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

vector<int> vec[N];

// int find(int i, vector<vector<int>> p, int n){
// 	set<int> s;
// 	for (int j = 0; j < n; j++){
// 		if (p[i][j] and i != j) s.insert(p[i][j]);
// 	}
// 	if (s.size() > 1) return -1;
// 	if (!s.size()) return -2;
// 	return *s.begin();
// }

int construct(vector<vector<int>> p){
	int n = p.size();
	vector<vector<int>> b(n, vector<int>(n, 0));
	vector<int> vis(n, 0);
	int cnt = 0;
	for (int i = 0; i < n; i++){
		if (vis[i]){
			for (auto j : vec[vis[i]]){
				if (p[i][j]) return 0;
			}
			continue;
		}
		cnt++;
		for (int j = 0; j < n; j++){
			if (p[i][j] and i != j){
				b[i][j] = b[j][i] = 1;
				vis[j] = cnt;
			}else if (!p[i][j]) vec[cnt].pb(j);
		}
		// if (x == 2){
		// 	int a1 = -1, b1 = -1;
		// 	for (int j = 0; j < n; j++){
		// 		if (p[i][j] and i != j){
		// 			if (a1 == -1) a1 = j;
		// 			else b1 = j;
		// 		}
		// 	}
		// 	if (b1 == -1) return 0;
		// 	b[a1][b1] = b[b1][a1] = 1;
		// }
	}
	// for (int i = 0; i < n; i++){
	// 	for (int j = 0; j < n; j++) cout << b[i][j] << ' ';
	// 	cout << '\n';
	// }
	build(b);
	return 1;
}
// int main ()
// {
// 	int n;
// 	cin >> n;
// 	vector<vector<int>> p(n, vector<int>(n));
// 	for (int i = 0; i < n; i++){
// 		for (int j = 0; j < n; j++) cin >> p[i][j];
// 	}
// 	int x = construct(p);
// }	

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	1 ms	2644 KB	Output is correct
4	Correct	1 ms	2644 KB	Output is correct
5	Correct	1 ms	2644 KB	Output is correct
6	Correct	7 ms	3540 KB	Output is correct
7	Correct	151 ms	24312 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	1 ms	2644 KB	Output is correct
4	Correct	1 ms	2644 KB	Output is correct
5	Correct	1 ms	2644 KB	Output is correct
6	Correct	7 ms	3540 KB	Output is correct
7	Correct	151 ms	24312 KB	Output is correct
8	Correct	1 ms	2644 KB	Output is correct
9	Correct	1 ms	2644 KB	Output is correct
10	Correct	1 ms	2644 KB	Output is correct
11	Correct	1 ms	2644 KB	Output is correct
12	Correct	7 ms	3712 KB	Output is correct
13	Correct	155 ms	28420 KB	Output is correct
14	Correct	2 ms	2652 KB	Output is correct
15	Correct	1 ms	2660 KB	Output is correct
16	Correct	4 ms	3180 KB	Output is correct
17	Correct	65 ms	16416 KB	Output is correct
18	Correct	1 ms	2644 KB	Output is correct
19	Incorrect	1 ms	2644 KB	Answer gives possible 1 while actual possible 0
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	1 ms	2600 KB	Output is correct
4	Incorrect	1 ms	2644 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	2644 KB	Output is correct
2	Incorrect	1 ms	2644 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	2644 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	1 ms	2644 KB	Output is correct
4	Correct	1 ms	2644 KB	Output is correct
5	Correct	1 ms	2644 KB	Output is correct
6	Correct	7 ms	3540 KB	Output is correct
7	Correct	151 ms	24312 KB	Output is correct
8	Correct	1 ms	2644 KB	Output is correct
9	Correct	1 ms	2644 KB	Output is correct
10	Correct	1 ms	2644 KB	Output is correct
11	Correct	1 ms	2644 KB	Output is correct
12	Correct	7 ms	3712 KB	Output is correct
13	Correct	155 ms	28420 KB	Output is correct
14	Correct	2 ms	2652 KB	Output is correct
15	Correct	1 ms	2660 KB	Output is correct
16	Correct	4 ms	3180 KB	Output is correct
17	Correct	65 ms	16416 KB	Output is correct
18	Correct	1 ms	2644 KB	Output is correct
19	Incorrect	1 ms	2644 KB	Answer gives possible 1 while actual possible 0
20	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2644 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	1 ms	2644 KB	Output is correct
4	Correct	1 ms	2644 KB	Output is correct
5	Correct	1 ms	2644 KB	Output is correct
6	Correct	7 ms	3540 KB	Output is correct
7	Correct	151 ms	24312 KB	Output is correct
8	Correct	1 ms	2644 KB	Output is correct
9	Correct	1 ms	2644 KB	Output is correct
10	Correct	1 ms	2644 KB	Output is correct
11	Correct	1 ms	2644 KB	Output is correct
12	Correct	7 ms	3712 KB	Output is correct
13	Correct	155 ms	28420 KB	Output is correct
14	Correct	2 ms	2652 KB	Output is correct
15	Correct	1 ms	2660 KB	Output is correct
16	Correct	4 ms	3180 KB	Output is correct
17	Correct	65 ms	16416 KB	Output is correct
18	Correct	1 ms	2644 KB	Output is correct
19	Incorrect	1 ms	2644 KB	Answer gives possible 1 while actual possible 0
20	Halted	0 ms	0 KB	-