제출 #28950

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
28950	2017-07-18 01:55:28	h0ngjun7	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	99 ms	5336 KiB

molecules

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "molecules.h"
#include <algorithm>
using namespace std;
typedef long long ll;
int n, w[200005], c[200005];
inline bool cmp(const int &a, const int &b) {
  return w[a] < w[b];
}
vector<int> find_subset(int l, int u, vector<int> _w) {
  vector <int> ans = {};
  for (auto &t : _w) c[n] = n, w[n++] = t;
  sort(c, c + n, cmp);
  if (w[c[0]] > u) return ans;
  ll s = 0;
  int left = 0, right = 0;
  for (int i = 0; i < n; i++) {
    if (s + w[c[i]] > u) break;
    s += w[c[i]];
    right = i;
  }
  if (right == n - 1 && s < l) return ans;
  while (right + 1 <= n - 1 && !(l <= s && s <= u)) {
    s += w[c[++right]];
    while (left <= right && s > u) s -= w[c[left++]];
  }
  if (l <= s && s <= u) {
    for (int i = left; i <= right; i++) ans.push_back(c[i]);
  }
  return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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