Submission #447364

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
447364	2021-07-26T07:25:23 Z	EliteCallsYou	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	421 ms	22052 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std ;
 
int construct(std::vector<std::vector<int>> p) {
	int n = (int)p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n ; i++ ) {
		std::vector<int> row;
		row.resize(n);
		for ( int j = 0 ; j < n ; j ++ ){
			if ( p[i][j] ){
				if ( i == j ){ row[j] = 0 ; continue ; }
				bool found = false ;
				for ( int l = 0 ; l < min(i,j) ; l ++ ){
					if ( p[i][l] && p[j][l] && l != i && l != j ){
						found = true ;
						break ;
					}
				}
				if ( !found ){ row[j] = 1 ; }
			}
			else{
				for ( int l = 0 ; l < min(i,j) ; l ++ ){
					if ( p[i][l] && p[l][j] ){
						return 0;
					}
				}
			}
		}
		answer.push_back(row);
	}
	build(answer);
	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	216 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1100 KB	Output is correct
7	Correct	227 ms	22052 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1100 KB	Output is correct
7	Correct	227 ms	22052 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	11 ms	1100 KB	Output is correct
13	Correct	421 ms	22012 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	4 ms	588 KB	Output is correct
17	Correct	101 ms	8052 KB	Output is correct
18	Incorrect	0 ms	204 KB	Answer gives possible 1 while actual possible 0
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 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	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Incorrect	0 ms	204 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	0 ms	204 KB	Output is correct
2	Correct	0 ms	216 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1100 KB	Output is correct
7	Correct	227 ms	22052 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	11 ms	1100 KB	Output is correct
13	Correct	421 ms	22012 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	4 ms	588 KB	Output is correct
17	Correct	101 ms	8052 KB	Output is correct
18	Incorrect	0 ms	204 KB	Answer gives possible 1 while actual possible 0
19	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	216 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1100 KB	Output is correct
7	Correct	227 ms	22052 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	11 ms	1100 KB	Output is correct
13	Correct	421 ms	22012 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	4 ms	588 KB	Output is correct
17	Correct	101 ms	8052 KB	Output is correct
18	Incorrect	0 ms	204 KB	Answer gives possible 1 while actual possible 0
19	Halted	0 ms	0 KB	-