Submission #456176

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
456176	2021-08-06T07:56:59 Z	Khizri	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	261 ms	26016 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
vector<std::vector<int>> ans;
vector<std::vector<int>>arr;
int color[1005],n,k;
bool qq=false;
void dfs(int u){
	color[u]=k;
	for(int i=0;i<n;i++){
		if(u!=i&&arr[u][i]==1&&!color[i]){
			ans[u][i]=1;
			ans[i][u]=1;
			dfs(i);
		}
	}
}
int construct(std::vector<std::vector<int>> p) {
	arr=p;
	n = arr.size();
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		ans.push_back(row);
	}
	for(int i=0;i<n;i++){
		if(!color[i]){
			++k;
			dfs(i);
		}
	}
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			if(arr[i][j]==1&&color[i]!=color[j]){
				return 0;
			}
			if(arr[i][j]==0&&color[i]==color[j]){
				return 0;
			}
		}
	}
	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	10 ms	1356 KB	Output is correct
7	Correct	228 ms	25988 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	10 ms	1356 KB	Output is correct
7	Correct	228 ms	25988 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	10 ms	1276 KB	Output is correct
13	Correct	261 ms	25892 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	844 KB	Output is correct
17	Correct	115 ms	16124 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	58 ms	6732 KB	Output is correct
21	Correct	231 ms	25984 KB	Output is correct
22	Correct	229 ms	25984 KB	Output is correct
23	Correct	255 ms	25984 KB	Output is correct
24	Correct	252 ms	25984 KB	Output is correct
25	Correct	100 ms	16000 KB	Output is correct
26	Correct	116 ms	16004 KB	Output is correct
27	Correct	244 ms	26016 KB	Output is correct
28	Correct	231 ms	25892 KB	Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	10 ms	1356 KB	Output is correct
7	Correct	228 ms	25988 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	10 ms	1276 KB	Output is correct
13	Correct	261 ms	25892 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	844 KB	Output is correct
17	Correct	115 ms	16124 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	58 ms	6732 KB	Output is correct
21	Correct	231 ms	25984 KB	Output is correct
22	Correct	229 ms	25984 KB	Output is correct
23	Correct	255 ms	25984 KB	Output is correct
24	Correct	252 ms	25984 KB	Output is correct
25	Correct	100 ms	16000 KB	Output is correct
26	Correct	116 ms	16004 KB	Output is correct
27	Correct	244 ms	26016 KB	Output is correct
28	Correct	231 ms	25892 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Incorrect	0 ms	204 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	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	10 ms	1356 KB	Output is correct
7	Correct	228 ms	25988 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	10 ms	1276 KB	Output is correct
13	Correct	261 ms	25892 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	5 ms	844 KB	Output is correct
17	Correct	115 ms	16124 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	0 ms	204 KB	Output is correct
20	Correct	58 ms	6732 KB	Output is correct
21	Correct	231 ms	25984 KB	Output is correct
22	Correct	229 ms	25984 KB	Output is correct
23	Correct	255 ms	25984 KB	Output is correct
24	Correct	252 ms	25984 KB	Output is correct
25	Correct	100 ms	16000 KB	Output is correct
26	Correct	116 ms	16004 KB	Output is correct
27	Correct	244 ms	26016 KB	Output is correct
28	Correct	231 ms	25892 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Incorrect	0 ms	204 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Submission #456176

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0