Submission #456135

#TimeUsernameProblemLanguageResultExecution timeMemory
456135osmanallazovConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
257 ms22012 KiB
#include "supertrees.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer;
	for (int i=0;i<n;i++ ) {
            vector<int>row;
            row.resize(n);
            for(int j=0;j<n;j++){
                if(i==1){
                    if(j!=1)row[j]=1;
                }
                else{
                    if(j==1)row[j]=1;
                }
            }
            answer.push_back(row);
      }
      build(answer);
      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...