제출 #961634

#제출 시각아이디문제언어결과실행 시간메모리
961634Gr1sen슈퍼트리 잇기 (IOI20_supertrees)C++17
0 / 100
0 ms348 KiB
#include"supertrees.h" #include<iostream> #include<vector> #include<algorithm> #include<iomanip> using namespace std; #define vi vector<int> #define vvi vector<vi> vi L; vi F; int find(int a) {return (a == -1 ? a : F[a] = find(F[a]));} void uunion(int a, int b) { a = find(a); b = find(b); if (a == b) return; F[a] = b; } int construct(std::vector<std::vector<int>> p) { int n = p.size(); vvi Adj(n, vi(n, 0)); L.clear(); F.clear(); F.resize(n, -1); for (int i = 0; i < n; i++) { bool q = 0; for (int j = 0; j < n; j++) { if (p[i][j]) { Adj[i][j] = 1; Adj[j][i] = 1; uunion(i, j); continue; } if (find(i) == find(j)) return 0; } if (find(i) == find(i)) L.push_back(i); } build(Adj); return 1; }

컴파일 시 표준 에러 (stderr) 메시지

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:30:14: warning: unused variable 'q' [-Wunused-variable]
   30 |         bool q = 0;
      |              ^
#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...