Submission #1084182

#TimeUsernameProblemLanguageResultExecution timeMemory
1084182nickolasarapidisConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
117 ms24200 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int>> p){ int N = p.size(); vector<vector<int>> b(N, vector<int>(N, 0)); for(int i = 0; i < N; i++){ if(i == N - 1) continue; if(p[i][i + 1] == 1){ b[i][i + 1] = 1; b[i + 1][i] = 1; } else{ for(int j = 0; j < N; j++){ if(p[i + 1][j] == 1 and p[i][j] == 1) return 0; } } } 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...