제출 #145078

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
145078		Nightlight	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1079 ms	376 KiB

molecules

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

vector<int> ans;

vector<int> find_subset(int l, int u, vector<int> w) {
  sort(w.begin(), w.end());
  int N = w.size();
  long long sum = w[0];
  int low = N-1, up = N-1;
  while((sum < l || sum > u) && low >= 0){
    while(sum < l && up >= low){
      up--;
      sum += w[up];
    }
    while(sum > u && low >= 0){
      sum -= w[low];
      low--;
    }
//    cout << low << " " << up << " " << sum << "\n";
  }
  if(l <= sum && sum <= u){
    for(int i = low; i <= up; i++){
      ans.push_back(w[i]);
    }
    return ans;
  }
  return vector<int>(0);
}

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