제출 #287355

#제출 시각아이디문제언어결과실행 시간메모리
287355kshitij_sodaniDetecting Molecules (IOI16_molecules)C++14
100 / 100
68 ms9060 KiB
#include <bits/stdc++.h> using namespace std; typedef long long int llo; #define a first #define b second #define pb push_back #define mp make_pair #include "molecules.h" vector<int> find_subset(int l, int u, vector<int> w) { vector<pair<llo,llo>> it; for(int i=0;i<w.size();i++){ it.pb({w[i],i}); } sort(it.begin(),it.end()); deque<pair<llo,llo>> xx; llo su=0; for(auto j:it){ su+=j.a; xx.pb(j); while(su>u){ su-=xx.front().a; xx.pop_front(); } if(su>=l and su<=u){ vector<int> ans; for(auto j:xx){ ans.pb(j.b); } sort(ans.begin(),ans.end()); return ans; } } return {}; }

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

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