Submission #927591

#TimeUsernameProblemLanguageResultExecution timeMemory
927591haxormanConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
165 ms22096 KiB
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

int construct(vector<vector<int>> p) {
	int n = p.size();
    vector<vector<int>> ans(n, vector<int>(n));
    
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (abs(i - j) == 1) {
                ans[i][j] = 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...