제출 #114625

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
114625		E869120	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	1042 ms	5196 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

long long N, L, R, A[200009], id[200009];

vector<int> solve(int pos) {
	long long sum = 0;
	for (int i = 0; i < pos; i++) sum += A[i];
	
	if (L <= sum && sum <= R) {
		vector<int> X; for (int i = 0; i < pos; i++) X.push_back(id[i]);
		return X;
	}
	
	for (int i = pos - 1; i >= 0; i--) {
		sum -= A[i];
		sum += A[i + (N - pos)];
		
		if (L <= sum && sum <= R) {
			vector<int> X;
			for (int j = 0; j < i; j++) X.push_back(id[j]);
			for (int j = i + (N - pos); j < N; j++) X.push_back(id[j]);
			return X;
		}
	}
	return vector<int>{};
}

vector<int> find_subset(int l, int u, vector<int> w) {
	vector<pair<int, int>> G; N = w.size(); L = l; R = u;
	for (int i = 0; i < N; i++) G.push_back(make_pair(w[i], i));
	sort(G.begin(), G.end());
	for (int i = 0; i < N; i++) { A[i] = G[i].first; id[i] = G[i].second; }
	
	for (int i = 1; i <= N; i++) {
		vector<int> G = solve(i);
		if (G.size() >= 1) return G;
	}
	return vector<int>{};
}

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