제출 #281543

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
281543		AKaan37	Detecting Molecules (IOI16_molecules)	C++17	9 / 100	1 ms	384 KiB

molecules

//Bismillahirrahmanirrahim

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t;
int cev;
vector<int> vv;
priority_queue<PII> pq;
string s;

std::vector<int> find_subset(int l, int u, std::vector<int> v) {
	sort(v.begin(),v.end());
    for(int i=0;i<(int)v.size();i++){
		if(v[i]<=u)cev+=v[i];
		else continue;
		flag=0;
		while(pq.size() && cev>u){
			cev+=pq.top().fi;
			flag=1;
			pq.pop();
		}
		//~ cout<<cev<<" : ; "<<i<<endl;
		if(cev>=l && cev<=u){
			pq.push({-v[i],i});
			while(pq.size()){vv.pb(pq.top().se);pq.pop();}
			return vv;
		}
		if(flag){
			cev-=v[i];
		}
		else pq.push({-v[i],i});
	}
	return vv;
}

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