Submission #625046

#TimeUsernameProblemLanguageResultExecution timeMemory
625046cfalasConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
1 ms340 KiB
#include<bits/stdc++.h> #include "supertrees.h" #include <vector> using namespace std; typedef vector<int> vi; int construct(vector<vector<int>> p) { int n = p.size(); vector<std::vector<int>> adj(n, vi(n, 0)); for(int i=0;i<n;i++) adj[i][i] = 0; for(int i=0;i<n-1;i++){ adj[i][i+1] = 1; adj[i+1][i] = 1; } if(n!=1){ adj[0][n-1] = 1; adj[n-1][0] = 1; } build(adj); 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...