oj.uz

Submission #846876

# Submission time Handle Problem Language Result Execution time Memory
846876 2023-09-08T15:06:05 Z detaomega Connecting Supertrees (IOI20_supertrees) C++14
11 / 100
 165 ms 23940 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;


int construct(std::vector<std::vector<int>> p) {
	int n = 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 (abs(i - j) == 1) {
				row[j] = 1;
			} 
			else {
				row[j] = 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 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 165 ms 23940 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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 165 ms 23940 KB Output is correct
8 Incorrect 0 ms 344 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
2 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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 165 ms 23940 KB Output is correct
8 Incorrect 0 ms 344 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 6 ms 1368 KB Output is correct
7 Correct 165 ms 23940 KB Output is correct
8 Incorrect 0 ms 344 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -