Submission #1084192

#TimeUsernameProblemLanguageResultExecution timeMemory
1084192nickolasarapidisConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
0 ms348 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++){ for(int j = 0; j < N; j++){ for(int k = 0; k < N; k++){ if(p[i][j] > 0 and p[j][k] > 0){ if(p[i][k] > 0){ b[i][k] = 1; b[k][i] = 1; b[i][j] = 1; b[j][i] = 1; } else{ 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...