제출 #362700

#제출 시각아이디문제언어결과실행 시간메모리
362700sean617슈퍼트리 잇기 (IOI20_supertrees)C++17
11 / 100
265 ms25068 KiB
#include "supertrees.h" #include <vector> #define N 1005 using namespace std; int n, bu[N]; bool v[N], co[N][N]; vector<int> gu[N], cy, cy2, ans; vector<std::vector<int> > answer; int f(int p) { if (bu[p] == p) return p; else return bu[p] = f(bu[p]); } void f_co(int p, int q) { co[p][q] = co[q][p] = 1; } int construct(std::vector<std::vector<int> > p) { int i, j, t, t1, t2, la; n = p.size(); for (i = 0; i < n; i++) bu[i] = i; for (i = 0; i < n; i++) { for (j = i + 1; j < n; j++) { if (p[i][j]== 0) continue; if (p[i][j] == 3) return 0; t1 = f(i); t2 = f(j); if (t1 != t2) bu[t1] = t2; } } for (i =0; i < n; i++) { t = f(i); gu[t].push_back(i); } for (i = 0; i < n; i++) { t = f(i); for (j = 0; j < gu[t].size(); j++) { if (gu[t][j] == i) continue; if (p[i][gu[t][j]] != 2) break; } if (j == gu[t].size()) { v[i] = 1; cy.push_back(i); } } for (i = 0; i < n; i++) { if (v[i]) continue; t = f(i); for (j = 0; j < gu[t].size(); j++) { if (gu[t][j] == i) continue; if (p[i][gu[t][j]] == 1 && v[gu[t][j]]) break; } if (j == gu[t].size()) { v[i] = 1; cy.push_back(i); cy2.push_back(i); } } int sz = cy.size(); if (sz >= 2) { for (i = 0; i < sz; i++) { f_co(cy[i], cy[(i + 1) % sz]); } } for (i = 0; i < cy2.size(); i++) { la = t = cy2[i]; t2 = f(t); for (j = 0; j < gu[t2].size(); j++) { if (gu[t2][j] != t && p[t][gu[t2][j]] == 1) { f_co(la, gu[t2][j]); la = gu[t2][j]; } } } for (i = 0; i < n; i++) { ans.clear(); for (j =0; j < n; j++) { ans.push_back(co[i][j]); } answer.push_back(ans); } build(answer); return 1; }

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

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:37:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for (j = 0; j < gu[t].size(); j++) {
      |                     ~~^~~~~~~~~~~~~~
supertrees.cpp:41:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         if (j == gu[t].size()) {
      |             ~~^~~~~~~~~~~~~~~
supertrees.cpp:49:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (j = 0; j < gu[t].size(); j++) {
      |                     ~~^~~~~~~~~~~~~~
supertrees.cpp:53:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         if (j == gu[t].size()) {
      |             ~~^~~~~~~~~~~~~~~
supertrees.cpp:65:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |  for (i = 0; i < cy2.size(); i++) {
      |              ~~^~~~~~~~~~~~
supertrees.cpp:68:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for (j = 0; j < gu[t2].size(); j++) {
      |                     ~~^~~~~~~~~~~~~~~
#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...