제출 #1088547

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

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

const long long INF = 1e15;

vector<int> find_subset(int l, int u, vector<int> w) {
  vector<pair<long long, int>> v;
  int n = (int)w.size();
  for (int i = 0; i < n; ++i)
    v.push_back({w[i], i});
  v.push_back({INF, n});
  sort(v.begin(), v.end());
  long long pref = 0, suff = 0;
  for (int i = 0; i < n; ++i) {
    pref += v[i].first;
    suff += v[n - 1 - i].first;
    if (pref <= u && suff >= l) {
      vector<int> res;
      for (int j = i; j < n; ++j) {
        if (pref >= l) {
          for (int k = j - i; k <= j; ++k)
            res.push_back(v[k].second);
          return res;
        }
        pref += v[j + 1].first - v[j - i].first;
      }
    }
  }
  return vector<int>();
}

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