제출 #299413

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
299413		sandoval	Detecting Molecules (IOI16_molecules)	C++11	19 / 100	1 ms	384 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
using ii = pair<int,int>;
using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w) {
  if (l > u) return {};

  const int n = (int)w.size();
  map<ll,int> m;
  m[0] = 0;
  ll sum = 0;

  for (int i = 1; i <= (int)n; ++i) {
    sum += w[i-1];
    ll k = sum-l;
    auto it = m.upper_bound(k);
    if (it != m.begin()) {
      it = prev(it);
      ll o = sum-it->first;
      assert(o >= l);
      if (o <= u) {
        const int len = i-it->second;
        vector<int> res;
        for (int j = i-len+1, c = 0; j <= i; ++j, ++c) {
          res.push_back(j-1);
        }
        return res;
      }
    }
    m[sum] = i;
  }

  return {};
}

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