Submission #82849

#TimeUsernameProblemLanguageResultExecution timeMemory
82849SecretAgent007Detecting Molecules (IOI16_molecules)C++17
9 / 100
3 ms644 KiB
#include "molecules.h" #include <bits/stdc++.h> //#define int long long using namespace std; vector<int> find_subset(int l, int r, vector<int> w){ int n = w.size(); vector< pair<int, int> > toS(0); for(int i = 0; i < w.size(); i++){ toS.push_back(make_pair(w[i],i)); } sort(toS.begin(), toS.end()); int le = 0; int ri = 0; int sum = toS[0].first; while(1){ if(sum <= r && sum >= l){ vector<int> ans(0); for(int i = le; i <= ri ; i++){ ans.push_back(toS[i].second); } return ans; }else if(sum > r){ if(le >0) sum-=toS[le-1].first; else break; le++; }else if(sum < l){ if(ri+1 < n) sum+= toS[ri+1].first; else break; ri++; } } vector<int> ans(0); return ans; }

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     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...