제출 #342038

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
342038		SeDunion	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	56 ms	3968 KiB

molecules

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 66;
 
vector<int> find_subset(int l, int r, vector<int> w) {
	ll L = 0, R = 0;
	int n = (int)w.size();
  	vector<bool> u(n);
	vector<pair<int,int>> a(n); for (int i = 0 ; i < n ; ++ i) a[i] = {w[i], i};
	sort(a.begin(), a.end());
	for (int i = 0 ; i < n ; ++ i) {
		L += a[i].first;
      	u[i] = 1;
		R += a[n - i - 1].first;
		if (L <= r && R >= l) {
			int j = i;
			for ( ; L < l ; ) {
				++j;
				L -= a[j - i - 1].first;
              	u[j - i - 1] = 0;
				L += a[n - j + i].first;
              	u[n - j + i] = 1;
			}
			vector<int> res;
          	for (int q = 0 ; q < n ; ++ q) if (u[q]) res.push_back(a[q].second);
			return res;
		}
	}
	return {};
}
/*
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int n, l, u;
	cin >> n >> l >> u;
	vector<int> w(n);
	for (int &i : w) cin >> i;
	auto A = find_subset(l, u, w);
	cout << A.size() << "\n";
	for (int i : A) cout << i << " ";
}
 
*/

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