Submission #1084182

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1084182	2024-09-05T14:39:28 Z	nickolasarapidis	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	117 ms	24200 KB

supertrees

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

int construct(vector<vector<int>> p){
	int N = p.size();

	vector<vector<int>> b(N, vector<int>(N, 0));

	for(int i = 0; i < N; i++){
		if(i == N - 1) continue;
		if(p[i][i + 1] == 1){
			b[i][i + 1] = 1;
			b[i + 1][i] = 1;
		}
		else{
			for(int j = 0; j < N; j++){
				if(p[i + 1][j] == 1 and p[i][j] == 1) return 0;
			}
		}
	}

	build(b);

	return 1;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	117 ms	24072 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	117 ms	24072 KB	Output is correct
8	Correct	1 ms	600 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	5 ms	1192 KB	Output is correct
13	Correct	115 ms	24200 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	3 ms	960 KB	Output is correct
17	Correct	57 ms	14084 KB	Output is correct
18	Incorrect	1 ms	344 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Incorrect	0 ms	348 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	348 KB	Output is correct
2	Incorrect	1 ms	440 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	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	117 ms	24072 KB	Output is correct
8	Correct	1 ms	600 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	5 ms	1192 KB	Output is correct
13	Correct	115 ms	24200 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	3 ms	960 KB	Output is correct
17	Correct	57 ms	14084 KB	Output is correct
18	Incorrect	1 ms	344 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	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	117 ms	24072 KB	Output is correct
8	Correct	1 ms	600 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	5 ms	1192 KB	Output is correct
13	Correct	115 ms	24200 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	3 ms	960 KB	Output is correct
17	Correct	57 ms	14084 KB	Output is correct
18	Incorrect	1 ms	344 KB	Answer gives possible 1 while actual possible 0
19	Halted	0 ms	0 KB	-