제출 #310350

#제출 시각아이디문제언어결과실행 시간메모리
310350APROHACKConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
234 ms22136 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; long long padres[1200]; long long fnd(long long nodo){ if(padres[nodo]=nodo)return nodo; else padres[nodo]=fnd(padres[nodo]); } int construct(vector<vector<int> >p) { int n = p.size(); vector<vector<int> > answer; for (int i = 0; i < n; i++) { std::vector<int> row; row.resize(n); for(int j = 0 ; j < n ; j ++)row[j]=0; answer.push_back(row); padres[i]= i; } for(int i = 0 ; i < n ; i ++){ for(int j = 0 ; j < n ; j ++){ if(i+1==j){ answer[i][j]=1; answer[j][i]=1; } } } build(answer); return 1; }

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

supertrees.cpp: In function 'long long int fnd(long long int)':
supertrees.cpp:6:20: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    6 |     if(padres[nodo]=nodo)return nodo;
      |        ~~~~~~~~~~~~^~~~~
supertrees.cpp:7:22: warning: control reaches end of non-void function [-Wreturn-type]
    7 |     else padres[nodo]=fnd(padres[nodo]);
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
#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...