답안 #483152

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
483152	2021-10-27T23:25:04 Z	rc_catunta	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	192 ms	22148 KB

supertrees

#include "supertrees.h"
#include <vector>
#include <iostream>
using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer;
	answer.assign(n,vector<int>(n));
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(j-i==1 or i-j==1){
				answer[i][j]=1;
			}
		}
	}
	/*for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cout<<answer[i][j]<<" ";
		}
		cout<<endl;
	}*/
	build(answer);
	return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	7 ms	1228 KB	Output is correct
7	Correct	192 ms	22148 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	7 ms	1228 KB	Output is correct
7	Correct	192 ms	22148 KB	Output is correct
8	Incorrect	0 ms	204 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

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	204 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

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	204 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	7 ms	1228 KB	Output is correct
7	Correct	192 ms	22148 KB	Output is correct
8	Incorrect	0 ms	204 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	7 ms	1228 KB	Output is correct
7	Correct	192 ms	22148 KB	Output is correct
8	Incorrect	0 ms	204 KB	Too many ways to get from 0 to 1, should be 0 found no less than 1
9	Halted	0 ms	0 KB	-