Submission #651813

#TimeUsernameProblemLanguageResultExecution timeMemory
651813coding_snorlax슈퍼트리 잇기 (IOI20_supertrees)C++14
0 / 100
1 ms304 KiB
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>> x){
    int Size=x.size();
    vector<vector<int>> built;
    for(int i=0;i<Size;i++){
        vector<int> New;
        for(int j=0;j<Size;j++){
            New.push_back(0);
        }
        if(i==0){
            New[i+1]=1;
        }
        else if(i==Size-1){
            New[i-1]=1;
        }
        else{
            New[i+1]=1;
            New[i-1]=1;
        }
        built.push_back(New);
        build(built);
    }
    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...