Submission #330293

#	Time	Username	Problem	Language	Result	Execution time	Memory
330293		gouravkhunger	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	58 ms	5612 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
  int size = w.size();
  vector<pair<int,int>> p(size);
  for(int i=0;i<size;i++)p[i]={w[i], i};
  sort(p.begin(), p.end());
  int left=0,right=0;
  long long sum=p[0].first;
  while(left<size||right<size){
    if(sum<l){
      right++;
      if(right>=size) break;
      sum+=p[right].first;
    } else if(sum>u){
      if(left>=size) break;
      sum-=p[left].first;
      left++;
    }
    else break;
  }
  if(l<=sum&&sum<=u){
    vector<int> ans;
    for(int i=left;i<=right;i++) ans.push_back(p[i].second);
    return ans;
  }
  else return {};
}

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31