제출 #1083961

#제출 시각아이디문제언어결과실행 시간메모리
1083961nickolasarapidisConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
1 ms348 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector<vector<int>> p){ int N = p.size(), cnt = 0; vector<vector<int>> b(N, vector<int>(N, 0)); vector<vector<int>> curPaths(N, vector<int>(N, 0)); vector<vector<bool>> satisfied(N, vector<bool>(N, false)); vector<int> adj[N]; for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++){ if(i == j){ curPaths[i][j] = 1; satisfied[i][j] = true; cnt++; } if(p[i][j] == 0){ satisfied[i][j] = true; cnt++; } } } if(cnt == N*N){ build(b); return 1; } for(int i = 0; i < N; i++){ for(int j = 0; j < N; j++){ if(satisfied[i][j]) continue; for(int k = 0; k < N; k++){ if(j == k) continue; if(b[j][k] == 1) continue; if(p[j][k] == p[i][k]){ b[i][k] = 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...