Submission #740501

#TimeUsernameProblemLanguageResultExecution timeMemory
740501JakobZorzDetecting Molecules (IOI16_molecules)C++14
0 / 100
0 ms212 KiB
#include "molecules.h" #include <algorithm> using namespace std; #define ll long long vector<int> find_subset(int l, int u, vector<int> w) { int m1=0,m2=0; int sum=0; vector<pair<int,int>> w2; for(int i=0;i<w.size();i++) w2.push_back({w[i],i+1}); sort(w2.begin(),w2.end()); while(sum<l&&m2<w2.size()) sum+=w2[m2++].first; while(sum>u&&m1<m2) sum-=w2[m1++].first; if(sum>=l&&sum<=u){ vector<int> res; for(int i=m1;i<m2;i++) res.push_back(w2[i].second); return res; } else return {}; }

Compilation message (stderr)

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:18: 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<w.size();i++)
      |                 ~^~~~~~~~~
molecules.cpp:13:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     while(sum<l&&m2<w2.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...