제출 #382395

#제출 시각아이디문제언어결과실행 시간메모리
382395TrunktyDetecting Molecules (IOI16_molecules)C++14
0 / 100
1 ms492 KiB
#include <iostream> #include <algorithm> #include <vector> using namespace std; long long sum=0; vector<int> find_subset(int li, int ui, vector<int> wi){ long long l=li,u=ui; vector<vector<long long>> w={}; for(int i=0;i<wi.size();i++){ w.push_back({wi[i],i}); } sort(w.begin(),w.end()); long long lef=0,rit=-1; while(rit!=w.size()){ rit++; sum += w[rit][0]; while(sum>u){ sum -= w[lef][0]; lef++; } if(sum<=u and sum>=l){ vector<int> a = {}; for(int i=lef;i<=rit;i++){ a.push_back(w[i][1]); } return a; } } return {}; }

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

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