Submission #759245

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
759245	2023-06-15 23:06:24	JellyTheOctopus	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	304 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
// IOI 2016 Day 1 Problem 1
// Detecting Molecules
// https://oj.uz/problem/view/IOI16_molecules
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
vector<int> find_subset(int l, int u, vector<int> w) {
  int N = (int)w.size();
  vector<pair<int, int>> valWeight(N);
  for (int i = 0; i < N; i++) {
    valWeight[i] = {w[i], i};
  }
  sort(valWeight.begin(), valWeight.end());
  deque<int> dq;
  long long curSum = 0;
  int i = 0;
  while (i < N) {
    if (l <= curSum && curSum <= u) {
      break;
    }
    if (curSum < l) {
      curSum += valWeight[i].f;
      dq.push_back(i);
      i++;
      continue;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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