Submission #447408

#	Time	Username	Problem	Language	Result	Execution time	Memory
447408		Nodir_Bobiev	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	204 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( n, vector <int> (n) );
      map <int, bool> us;
      for (int i = 0; i < n ; i++ ) {
            ans[i][i] = 1;
            if( us[i] ) continue;
            ans[i][0] = 1;
            for(int j = 0; j < n; j ++){
                if( i != j && p[i][j] ){
                    ans[i][0] = 0, ans[i][j] = ans[j][i] = us[j] = 1;
                    for(int k = j + 1; k < n; k ++){
                            if( p[i][k] ){
                                ans[j][k] = ans[k][j] = us[k] = 1;
                            }
                    }
                    break;
                }
            }
      }
      for(int i = 0; i < n; i ++){
            ans[i][i] = 1;
      }
      build(ans);
      return 1;
}
/*20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1*/

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