Submission #48980

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
48980	2018-05-21 05:56:03	Namnamseo	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	87 ms	32812 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
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pp;
pp d[200010];
using ll=long long;
ll ps[200010];
vector<int> find_subset(int l, int u, vector<int> w) {
  int n = w.size();
  for(int i=0; i<n; ++i){
    d[i]={w[i], i};
  }
  sort(d, d+n);
  for(int i=0; i<n; ++i) ps[i+1]=ps[i]+d[i].first;
  for(int i=1; i<=n; ++i){
    int lp=lower_bound(ps, ps+i, ps[i]-u)-ps;
    if(ps[i]-ps[lp] >= l){
      vector<int> ret;
      for(int j=lp+1; j<=i; ++j) ret.push_back(d[j-1].second);
      return ret;
    }
  }
  return vector<int>();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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