| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 783575 | Malix | 슈퍼트리 잇기 (IOI20_supertrees) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
std::vector<std::vector<int>> answer;
for (int i = 0; i < n; i++) {
std::vector<int> row;
row.resize(n);
answer.push_back(row);
}
if(n==1){
answer[0][0] = 0;
build(answer);
return 1;
}
int count = 0;
int zerocount = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(p[i][j] == 1){
count++;
}
else if(p[i][j] == 0){
zerocount++;
}
}
}
if(zerocount == (n*n)-n){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
answer[i][j] = 0;
}
}
build(answer);
return 1;
}
//subtask 1
if(count == n*n){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
answer[i][j] = 0;
}
}
for(int i = 1; i < n; i++){
answer[i][0] = 1;
answer[0][i] = 1;
}
build(answer);
return 1;
}
//subtask 2
count = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(p[i][j] <= 1){
count++;
}
}
}
if(count == n*n){
vector<int> arr(n, 0);
vector<int> arr2;
int arr2size;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
answer[i][j] = 0;
}
}
int currentIndex = 0;
while(currentIndex != n){
if(!arr[currentIndex]){
arr2.push_back(currentIndex);
for(int i = 0; i < n; i++){
if(p[currentIndex][i]){
if(arr[i]){
return 0;
}
answer[currentIndex][i] = 1;
answer[i][currentIndex] = 1;
if(currentIndex != i){
arr[i]++;
}
arr2.push_back(i);
}
}
arr2size = arr2.size();
for(int k = 0; k < arr2size-1; k++){
for(int m = k+1; m < arr2size; m++){
if(!p[arr2[k]][arr2[m]]){
return 0;
}
}
}
for(int k = 0; k < arr2size; k++){
for(int m = 0; m < n; m++){
if(p[arr2[k]][m]){
if(find(arr2.begin(), arr2.end(), m) == arr2.end()){
return 0;
}
}
}
}
arr[currentIndex]++;
arr2.clear();
}
currentIndex++;
}
for(int i = 0 ; i < n; i++){
if(arr[i] > 1){
return 0;
}
}
for(int i = 0; i < n; i++){
answer[i][i] = 0;
}
build(answer);
return 1;
}
//subtask 3
count = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(p[i][j] == 0 || p[i][j] == 2){
count++;
}
}
}
if(count == (n*n)-n){
if(n==2){
return 0;
}
vector<int> arr(n, 0);
vector<int> arr2;
int arr2size;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
answer[i][j] = 0;
}
}
int currentIndex = 0;
while(currentIndex != n){
if(!arr[currentIndex]){
arr2.push_back(currentIndex);
for(int i = 0; i < n; i++){
if(p[currentIndex][i]){
if(arr[i]){
return 0;
}
if(currentIndex != i){
arr[i]++;
arr2.push_back(i);
}
}
}
arr2size = arr2.size();
if(arr2size > 2){
answer[arr2[0]][arr2[arr2size-1]] = 1;
answer[arr2[arr2size-1]][arr2[0]] = 1;
for(int k = 0; k < arr2size-1; k++){
answer[arr2[k]][arr2[k+1]] = 1;
answer[arr2[k+1]][arr2[k]] = 1;
}
}
else if(arr2size == 2){
return 0;
}
for(int k = 0; k < arr2size-1; k++){
for(int m = k+1; m < arr2size; m++){
if(!p[arr2[k]][arr2[m]]){
return 0;
}
}
}
for(int k = 0; k < arr2size; k++){
for(int m = 0; m < n; m++){
if(p[arr2[k]][m]){
if(find(arr2.begin(), arr2.end(), m) == arr2.end()){
return 0;
}
}
}
}
arr[currentIndex]++;
arr2.clear();
}
currentIndex++;
}
for(int i = 0 ; i < n; i++){
if(arr[i] > 1){
return 0;
}
}
for(int i = 0; i < n; i++){
answer[i][i] = 0;
}
build(answer);
return 1;
}
//subtask 4
count = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(p[i][j] <= 2){
count++;
}
}
}
if(count == n*n){
vector<int> arr(n, 0);
vector<int> arr2;
int arr2size;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
answer[i][j] = 0;
}
}
int currentIndex = 0;
//0 or 1 part
while(currentIndex != n){
if(!arr[currentIndex]){
for(int i = 0; i < n; i++){
if(p[currentIndex][i] == 1){
answer[currentIndex][i] = 1;
answer[i][currentIndex] = 1;
if(currentIndex != i){
arr[i]++;
}
}
}
arr[currentIndex] = 1;
}
currentIndex++;
}
for(int i = 0; i < n; i++){
answer[i][i] = 0;
}
build(answer);
return 1;
}
currentIndex = 0;
arr.resize(n, 0);
while(currentIndex != n){
if(!arr[currentIndex]){
arr2.push_back(currentIndex);
for(int i = 0; i < n; i++){
if(p[currentIndex][i] == 2){
if(currentIndex != i){
arr[i]++;
arr2.push_back(i);
}
}
}
arr2size = arr2.size();
if(arr2size>2){
answer[arr2[0]][arr2[arr2size-1]] = 1;
answer[arr2[arr2size-1]][arr2[0]] = 1;
for(int k = 0; k < arr2size-1; k++){
answer[arr2[k]][arr2[k+1]] = 1;
answer[arr2[k+1]][arr2[k]] = 1;
}
}
arr[currentIndex]++;
arr2.clear();
}
currentIndex++;
}
build(answer);
return 1;
}