제출 #125800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
125800		Sorting	Detecting Molecules (IOI16_molecules)	C++14	9 / 100	2 ms	376 KiB

molecules

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 7;

long long prefix[N], suffix[N];

vector<int> find_subset(int l, int r, vector<int> w){
	vector<int> ans;
	int n = (int)w.size();

	sort(w.begin(), w.end());

	prefix[0] = w[0];
	for(int i = 1; i < n; i++){
		prefix[i] = prefix[i - 1] + (long long)w[i];
	}

	suffix[n - 1] = w[n - 1];
	for(int i = n - 2; i >= 0; i--){
		suffix[i] = suffix[i + 1] + (long long)w[i];
	}

	for(int i = 1; i <= n; i++){
		if(prefix[i - 1] > r || suffix[n - i] < l){
			continue;
		}

		for(int j = 0; j <= n - i; j++){
			long long sum = prefix[j + i - 1];

			if(j != 0){
				sum -= prefix[j - 1];
			}

			if(l <= sum && sum <= r){
				for(int k = 0; k < i; k++){
					ans.push_back(j + k);
				}

				return ans;
			}
		}
	}

	return ans;
}

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