제출 #20596

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
20596		model_code	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	63 ms	8356 KiB

molecules

// name = molecules_sk.cpp, type = cpp.g++11

#include "molecules.h"
/** Author: Sergey Kopeliovich ([e-mail]) */

#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

#define forn(i, n) for (int i = 0; i < (int)(n); i++)

typedef pair <int, int> pii;
typedef long long ll;

// return value: result if solution exists and empty vector otherwise
vector<int> find_subset( int l, int u, vector<int> w ) {
	int n = w.size();
	vector<pii> wp(n);
	forn(i, n)
		wp[i] = pii(w[i], i);
	sort(wp.begin(), wp.end());
	vector<ll> mi(n + 1), ma(n + 1);
	forn(i, n) {
		mi[i + 1] = mi[i] + wp[i].first;
		ma[i + 1] = ma[i] + wp[n - i - 1].first;
	}
	forn(i, n + 1)
		if (mi[i] <= u && ma[i] >= l) {
			int pos = n - 1;
			ll sum = mi[i];
			vector<int> result(i);
			forn(j, i) {
				while (pos >= i && sum + wp[pos].first - wp[j].first > u)
					pos--;
				if (pos >= i && sum + wp[pos].first - wp[j].first <= u)
					sum += wp[pos].first - wp[j].first, result[j] = wp[pos--].second;
				else
					result[j] = wp[j].second;
			}
			return result;
		}
	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: 31 / 31