Submission #471144

# Submission time Handle Problem Language Result Execution time Memory
471144 2021-09-07T14:36:06 Z Cross_Ratio Connecting Supertrees (IOI20_supertrees) C++14
0 / 100
1 ms 292 KB
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

//void build(vector<vector<int> >);


int construct(vector<vector<int> > p) {
	vector<vector<int> > ans;
	int N = p.size();
	ans.resize(N);
	int i;
	for(i=0;i<N;i++) ans[i].resize(N);
	for(i=0;i<N-1;i++) ans[i][i+1] = 1;
	build(ans);
	return 1;
}

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 292 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 288 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -