제출 #1007930

#제출 시각아이디문제언어결과실행 시간메모리
1007930teeslaDetecting Molecules (IOI16_molecules)C++14
9 / 100
37 ms65536 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; vector<int> find_subset(int l, int u, vector<int> ww) { vector<pair<int,int>> w; for(int i=0; i<ww.size(); i++){ w.push_back({ww[i], i}); } sort(w.begin(), w.end()); vector<int> res; int i = 1, f = w.size(); while(i<=f){ int meio = (i+f)/2; int soma = 0; for(int j=1; j<=meio; j++) soma += w[w.size()-j].first; if(soma < l){i = meio + 1; continue;} soma = 0; for(int j=0; j<meio; j++) {soma += w[j].first; res.push_back(w[j].second);} if(soma > u){f = meio-1;res.clear(); continue;} for(int j = 0; j<= meio; j++){ if(soma >= l and soma <=u) return res; soma -= w[j].first; soma += w[j+meio].first; res[j] = w[j+meio].second; } } return res; }

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

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:9:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i=0; i<ww.size(); i++){
      |                  ~^~~~~~~~~~
#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...