Submission #440270

#TimeUsernameProblemLanguageResultExecution timeMemory
440270MohamedAliSaidaneConnecting Supertrees (IOI20_supertrees)C++14
0 / 100
1 ms372 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; #define pb push_back #define popb pop_back #define ff first #define ss second int construct(vector<vi> p) { int n = p.size(); vector<vi> b; for (int i = 0; i < n; i++) { vi row; for(int j = 0; j <n; j ++) row.pb(0); b.pb(row); } for(int i = 0; i < n; i ++) { b[i][i+1] = 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...