Submission #472841

#TimeUsernameProblemLanguageResultExecution timeMemory
472841Erik_GepardDetecting Molecules (IOI16_molecules)C++14
19 / 100
4 ms208 KiB
#include "molecules.h" #include <bits/stdc++.h> using namespace std; std::vector<int> find_subset(int l, int u, std::vector<int> w) { int n=w.size(); vector<pair<int, int> > a(w.size()); for(int i=0; i<w.size(); i++){ a[i].first=w[i]; a[i].second=i; } sort(a.begin(), a.end()); int sum=0; int j=0; int helyesi=-1, helyesj=-1; for(int i=0; i<n; i++){ while(sum<l && j<n){ sum+=w[j]; j++; } if(sum<=u && sum>=l){ helyesi=i; helyesj=j; } sum-=a[i].first; } vector<int> ans; for(int i=helyesi; i<helyesj; i++){ ans.push_back(a[i].second); } if(helyesi!=-1) return ans; else return vector<int>(0); }

Compilation message (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<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...