답안 #1083928

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1083928	2024-09-04T14:38:02 Z	nickolasarapidis	슈퍼트리 잇기 (IOI20_supertrees)	C++17	0 / 100	126 ms	24072 KB

supertrees

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

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

	for(int i = 0; i < N; i++){
		unordered_map<int, int> freq;

		for(int j = 0; j < N; j++){
			freq[p[i][j]]++;
		}

		for(auto x : freq){
			if(x.first == 0 or x.first == 1) continue;
			if(x.second == 1) return 0;
		}
	}

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

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

	build(b);

	return 1;
}

Subtask #1

0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Incorrect	0 ms	348 KB	Too many ways to get from 0 to 2, should be 1 found no less than 2
4	Halted	0 ms	0 KB	-

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Incorrect	0 ms	348 KB	Too many ways to get from 0 to 2, should be 1 found no less than 2
4	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	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	436 KB	Output is correct
8	Correct	5 ms	1368 KB	Output is correct
9	Correct	126 ms	24072 KB	Output is correct
10	Incorrect	0 ms	600 KB	Too many ways to get from 0 to 3, should be 2 found no less than 3
11	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	0 ms	348 KB	Too many ways to get from 1 to 4, should be 1 found no less than 2
4	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Incorrect	0 ms	348 KB	Too many ways to get from 0 to 2, should be 1 found no less than 2
4	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Incorrect	0 ms	348 KB	Too many ways to get from 0 to 2, should be 1 found no less than 2
4	Halted	0 ms	0 KB	-