oj.uz

Submission #364978

# Submission time Handle Problem Language Result Execution time Memory
364978 2021-02-10T16:54:50 Z Farrius Connecting Supertrees (IOI20_supertrees) C++14
0 / 100
 1 ms 364 KB 
#include "supertrees.h"
#include <vector>

using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> sol(n, vector<int>(n));
	for (int i = 0; i < n; i++) {
		sol[i][i] = 1;
		if (i < n - 1) sol[i][i + 1] = 1;
	}
	build(sol);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -