Submission #781342

#TimeUsernameProblemLanguageResultExecution timeMemory
781342christinelynnDetecting Molecules (IOI16_molecules)C++17
100 / 100
42 ms6180 KiB
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
  int sz=0;
  vector<pair<int, int>> a;
  for(int p : w) a.push_back({p, sz++});
  sort(a.begin(), a.end());
  long long sum=0;
  int L=0, R=0;
  while(L<sz) {
    while(R<sz && sum<l) sum+=a[R++].first;
    if(l<=sum && sum<=u) {
      vector<int> ans;
      for(int i=L; i<R; i++) ans.push_back(a[i].second);
      return ans;
    }
    sum-=a[L++].first;
    if(l<=sum && sum<=u) {
      vector<int> ans;
      for(int i=L; i<R; i++) ans.push_back(a[i].second);
      return ans;
    }
  }
  return vector<int>(0);
}
#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...