제출 #472767

#제출 시각아이디문제언어결과실행 시간메모리
472767aris12345678Connecting Supertrees (IOI20_supertrees)C++14
11 / 100
242 ms23908 KiB
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN = 1005;
/*
void build(vector<vector<int> > b) {
    int n = int(b.size());
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++)
            cout << b[i][j] << " ";
        cout << "\n";
    }
}
*/
int construct(vector<vector<int> > p) {
    int n = int(p.size());
    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;
}
/*
int main() {
    int n;
    scanf("%d", &n);
    vector<vector<int> > p(n, vector<int>(n));
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++)
            scanf("%d", &p[i][j]);
    }
    cout << "\n";
    printf("%d\n", construct(p));
    return 0;
}
*/
#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...