Submission #447426

#TimeUsernameProblemLanguageResultExecution timeMemory
447426Nodir_BobievConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
0 ms204 KiB
#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, bool> us;
      for(int i = 0; i < n; i ++){
            if( us[i] ) continue;
            for(int j = 0; j < n; j ++){
                if( p[i][j] ){
                    if( us[j] ) return 0;
                    us[j] = 1;
                    ans[i][j] = ans[j][1] = 1;
                }
            }
      }
      build(ans);
      return 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...