제출 #486753

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

molecules

#include <bits/stdc++.h>
#include "molecules.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define nax 200005
#define pb push_back
#define sc second
#define fr first
//#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl

vector<int> find_subset(int l, int u, vector<int> w)
{
	int n = w.size();
	vector<pair<int, int>> a(n);
	for(int i = 0; i < n; i++)
	{
		a[i].fr = w[i];
		a[i].sc = i;
	}
	sort(all(a));
	reverse(all(a));
	int pt1 = 0, pt2 = 0, sum = a[0].fr;
	while(!(sum >= l && sum <= u))
	{
		if(sum < l)
		{
			if(pt2 == n-1)
			{
				vector<int> x;
				return x;
			}
			pt2++;
			sum+=a[pt2].fr;
			continue;
		}
		if(sum > u)
		{
			if(pt1 == pt2)
			{
				vector<int> x;
				return x;
			}
			sum-=a[pt1].fr;
			pt1++;
		}
	}
	vector<int> ans(pt2-pt1+1);
	for(int i = 0; i < pt2-pt1+1; i++)
	{
		ans[i] = a[i+pt1].sc;
	}
	return ans;
}
/*
int main()
{
	int n, l, u;
	cin >> n >> l >> u;
	vint a(n);
	for(int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	vint ans = find_subset(l, u, a);
	for(auto x : ans)
	{
		cout << x << " ";
	}
	cout << endl;
}

*/

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