oj.uz

답안 #447597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447597 2021-07-27T05:23:48 Z EliteCallsYou 슈퍼트리 잇기 (IOI20_supertrees) C++17
0 / 100
 579 ms 33984 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std ;

//////////////////////////////////////////////////
map < int, bool > used ; 
vector < int > mp[1001] ;
bool ans = true ;

void DFS( int v, int cur ){
	if ( used[v] ){ return ; }
	used[v] = true ;
	bool found = false ;
	for ( int child : mp[v] ){
		if ( used[child] ){ continue ; }
		found = true ;
		DFS(child,cur+1) ;
	}
	if ( !found ){
		if ( cur < 3 && (int)mp[v].size() > 1 ){ ans = false ; return ; }
	}
}
////////////////////////////////////////////////

int construct(std::vector<std::vector<int>> p) {
	int n = (int)p.size();
	///////////////////////////////////////
	for ( int i = 0 ; i < n ; i ++ ){
		for ( int j = 0 ; j < n ; j ++ ){
			if ( p[i][j] && i != j ){
				mp[i].push_back(j) ;
				mp[j].push_back(i) ;
			}
		}
	}
	for ( int i = 0 ; i < n ; i ++ ){
		if ( (int)mp[i].size() == 2 ){
			return 0 ;
		}
	}
	//////////////////////////////////////
	bool been[1001] = {false} ;
	int bridge[n][n] ;
	for ( int i = 0 ; i < n ; i ++ ){
		for ( int j = 0 ; j < n ; j ++ ){
			bridge[i][j] = 0 ;
		}
	}
	for (int i = 0; i < n ; i++ ) {
		if ( been[i] ){ continue ; }

		int last = -1 ;
		for ( int j = i+1 ; j < n ; j ++ ){

			if ( p[i][j] ){
				been[j] = true ;
				last = j ;
				for ( int l = j-1 ; l >= i ; l -- ){
					if ( p[i][l] ){
						bridge[l][j] = 1 ;
						bridge[j][l] = 1 ;
						break ;
					}
				}
			}
			else{
				for ( int l = 0 ; l < j ; l ++ ){
					if ( p[i][l] && p[l][j] ){
						return 0;
					}
				}
			}
		}
		if ( last != -1 ){
			bridge[i][last] = 1 ;
			bridge[last][i] = 1 ;
		}
	}
	/////////////////////////////////////
	std::vector<std::vector<int>> answer;
	for ( int i = 0 ; i < n ; i ++ ){
		std::vector < int > row ;
		for ( int j = 0 ; j < n ; j ++ ){
			row.push_back(bridge[i][j]) ;
		}answer.push_back(row) ;
	}
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 13 ms 1356 KB Output is correct
9 Correct 579 ms 25960 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1800 KB Output is correct
13 Correct 238 ms 33984 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 972 KB Output is correct
17 Correct 113 ms 17732 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
20 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 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 204 KB Output is correct
2 Incorrect 0 ms 204 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

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