제출 #489556

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
489556		PoPularPlusPlus	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	47 ms	7700 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

vector<int> find_subset(int l, int u, vector<int> w){
	int n = w.size();
	vector<pair<ll,int>> arr;
	for(int i = 0; i < n; i++){
		arr.pb(mp(w[i] , i));
	}
	sv(arr);
	ll sum = 0;
	queue<int> q;
	for(int i = 0; i < n; i++){
		sum += arr[i].vf;
		q.push(i);
		if(sum > u){
			int pos = q.front();
			q.pop();
			sum -= arr[pos].vf;
		}
		if(sum >= l && sum <= u)break;
	}
	vector<int> v;
	while(q.size() && sum >= l && sum <= u){
		int pos =  q.front();
		q.pop();
		v.pb(arr[pos].vs);
	}
	return v;
}
/*
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	int t;cin >> t;while(t--)
	solve();
	return 0;
}
*/

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