Submission #447434

#	Time	Username	Problem	Language	Result	Execution time	Memory
447434		Nodir_Bobiev	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	368 ms	24120 KiB

supertrees

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

int construct(std::vector<std::vector<int>> p) {
      int n = p.size();
      vector <vector <int>> ans;
      for(int i = 0; i < n; i ++){
            vector <int> row;
            row.resize(n);
            ans.push_back(row);
      }
      map <int, long> us, comp;
      for(int i = 0; i < n; i ++){
            if( us[i] ) continue;
            comp[i] = i;
            for(int j = 0; j < n; j ++){
                if( p[i][j] ){
                    if( i == j ) continue;
                    if( us[j] ) return 0;
                    us[j] = 1, comp[j] = i;
                    ans[i][j] = ans[j][i] = 1;
                }
            }
      }
      for(int i = 0; i < n; i ++){
            for(int j = 0; j < n; j ++){
                if( ( comp[i] == comp[j] ) != p[i][j] ) return 0;
            }
      }
      build(ans);
      return 1;
}

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