제출 #799615

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
799615		kirakaminski968	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	39 ms	6032 KiB

molecules

#include "molecules.h" 
#include <bits/stdc++.h>
using namespace std; 
vector<int> find_subset(int l, int u, vector<int> w){
  vector<pair<int,int>> info; int n = w.size(); 
  for(int i = 0;i<n;++i){
    info.push_back({w[i],i}); 
  }
  sort(info.begin(),info.end()); 
  int j = -1; long long cursum = 0; 
  for(int i = 0;i<n;++i){
    while(j+1 < n && cursum < l){
      j++; 
      cursum += info[j].first; 
    }
    if(l <= cursum && cursum <= u){
      vector<int> ans; 
      for(int k = i;k<=j;++k) ans.push_back(info[k].second); 
      return ans; 
    }
    cursum -= info[i].first; 
  }
  return vector<int>(0); 
}

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