Submission #318565

#	Time	Username	Problem	Language	Result	Execution time	Memory
318565		NintsiChkhaidze	Connecting Supertrees (IOI20_supertrees)	C++14	75 / 100	284 ms	24292 KiB

supertrees

#include "supertrees.h"
#include <iostream>
#include <vector>
#define pb push_back
using namespace std;
vector<vector<int>> answer;
vector <int> row,cycle,vec[1005];
int par[1005];
bool f[1005];
int construct(vector<vector<int>> p) {
    int n = p.size(),a=0,b=0;
    for(int i=0;i<n;i++){
        row.clear();
        for (int j=0;j<n;j++){
            if (p[i][j] == 2) a=1;
            if (p[i][j] == 1 && i!=j) b=1;
            if (p[i][j] == 3) return 0;
            if (p[i][i] != 1) return 0;
            row.pb(0);
        }
        answer.pb(row);
    }
    for(int i=0;i<n;i++)
        par[i]=i;
    for (int i=0;i<n;i++){
        if (f[i]) continue;
        for (int j=0;j<n;j++){
            if (p[i][j] == 1 && i!=j){
                f[j]=1;
                par[j] = i;
                vec[i].pb(j);
                answer[i][j]=answer[j][i]=1;
            }
        }
    }
    
    for(int i=0;i<n;i++) f[i]=0;
    if (a == 0){
        for (int i=0;i<n;i++){
            for (int j=0;j<n;j++){
                if (par[i] == par[j] && p[i][j] != 1) return 0;
                if (par[i] != par[j] && p[i][j] != 0) return 0;
            }
        }
    }
    for(int i=0;i<n;i++){
        if (f[i]) continue;
        cycle.clear();
        cycle.pb(i);
        par[i] = i;
        int cur = i;
        for (int j=0;j<n;j++)
            if (p[i][j] == 2 && !f[j]) {
                cycle.pb(j);
                for (int z=0;z<vec[j].size();z++)
                    f[vec[j][z]] = 1;
                
                par[j] = i; f[j] = 1;
                answer[j][cur] = answer[cur][j] = 1;
                cur = j;
            }
        if (cycle.size() == 1) continue;
        if (cycle.size() == 2) return 0;
        answer[i][cur] = answer[cur][i] = 1;
    }
    if (a==1 && b==0){
        for (int i=0;i<n;i++)
            for (int j=i+1;j<n;j++){
                if (par[i] == par[j] && p[i][j]!=2) return 0;
                if (par[i]!=par[j] && p[i][j]!=0) return 0;
            }
    }
    
    build(answer);
    return 1;
}
/*
6
1 2 2 0 0 1
2 1 2 0 0 0
2 2 1 0 0 0
0 0 0 1 2 2
0 0 0 2 1 2
1 0 0 2 2 1
 
 
 6
 1 2 2 1 1 2
 2 1 2 2 2 1
 2 2 1 2 2 2
 1 2 2 1 1 2
 1 2 2 1 1 2
 2 1 2 2 2 1
 
 ans
 
 
*/

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:55:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |                 for (int z=0;z<vec[j].size();z++)
      |                              ~^~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 19 / 19
• Subtask 4: 35 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4