oj.uz

답안 #1078696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078696 2024-08-28T04:38:29 Z Faisal_Saqib 슈퍼트리 잇기 (IOI20_supertrees) C++17
0 / 100
 1 ms 604 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> tree_case(n,vector<int>(n,1));
	if(p==tree_case)
	{
		tree_case[0][0]=0;
		for(int i=1;i<n;i++)
			for(int j=0;j<n;j++)
				tree_case[i][j]=0;
		build(tree_case);
		return 1;
	}
	else
	{
		// Forest case
	}
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 604 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB b is not symmetric: b[0][1] (1) != b[1][0] (0)
3 Halted 0 ms 0 KB -