Submission #1184903

#TimeUsernameProblemLanguageResultExecution timeMemory
1184903islam_2010Connecting Supertrees (IOI20_supertrees)C++20
11 / 100
110 ms21964 KiB
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;

int construct(vector<vector<int>> p) {
    int n = p.size();

    for (int i = 0; i < n; i++) {
        if (p[i][i] != 1) return 0; 
        for (int j = 0; j < n; j++) {
            if (p[i][j] != 1) return 0;
        }
    }

    vector<vector<int>> b(n, vector<int>(n, 0));
    for (int i = 0; i < n - 1; i++) {
        b[i][i + 1] = b[i + 1][i] = 1;
    }

    build(b);
    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...