제출 #42947

#제출 시각아이디문제언어결과실행 시간메모리
42947MatheusLealVSimurgh (IOI17_simurgh)C++14
0 / 100
5 ms464 KiB
#include <bits/stdc++.h> #include "simurgh.h" using namespace std; int n, m; vector<int> find_roads(int n_, vector<int> u, vector<int> v) { n = n_; m = u.size(); for(int mask = 0; mask < (1<<m); mask ++) { vector<int> aux; for(int i = 0; i < m; i++) { if(mask & (1<<i)) { aux.push_back(i); } } if(aux.size() == n - 1 && count_common_roads(aux)) return aux; } }

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

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:25:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(aux.size() == n - 1 && count_common_roads(aux)) return aux; 
                       ^
simurgh.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#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...