답안 #1084187

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1084187	2024-09-05T14:54:52 Z	nickolasarapidis	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	123 ms	23948 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int construct(vector<vector<int>> p){
	int N = p.size();

	vector<vector<int>> b(N, vector<int>(N, 0));

	for(int i = 0; i < N; i++){
		if(i == N - 1) continue;
		if(p[i][i + 1] == 1){
			b[i][i + 1] = 1;
			b[i + 1][i] = 1;
		}
		else{
			for(int j = 0; j < N; j++){
				if(p[i + 1][j] == p[i][j] == 1) return 0;
			}
		}
	}

	build(b);

	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:18:20: warning: suggest parentheses around comparison in operand of '==' [-Wparentheses]
   18 |     if(p[i + 1][j] == p[i][j] == 1) return 0;

Subtask #1

11.0 / 11.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	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1352 KB	Output is correct
7	Correct	123 ms	23948 KB	Output is correct

Subtask #2

0 / 10.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	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1352 KB	Output is correct
7	Correct	123 ms	23948 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Incorrect	0 ms	348 KB	Answer gives possible 0 while actual possible 1
10	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Incorrect	0 ms	348 KB	Answer gives possible 0 while actual possible 1
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	344 KB	Answer gives possible 0 while actual possible 1
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.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	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1352 KB	Output is correct
7	Correct	123 ms	23948 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Incorrect	0 ms	348 KB	Answer gives possible 0 while actual possible 1
10	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.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	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1352 KB	Output is correct
7	Correct	123 ms	23948 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Incorrect	0 ms	348 KB	Answer gives possible 0 while actual possible 1
10	Halted	0 ms	0 KB	-