제출 #519783

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

molecules

#include "bits/stdc++.h"
using namespace std;
long long o,n,b,c,e,l,r,md,jog,k;
vector<int> a,d;
map <long long, long long> p;
vector <pair <long long, long long>> u;

vector<int> find_subset(int x, int y, vector<int> v){
	n = v.size();
	for (int i = 0; i < n; i++) u.push_back({v[i], i});
	sort(u.begin(), u.end());
	for (int i = 0; i < n; i++) p[i] = p[i - 1] + u[i].first;
	for (int i = 0; i < n; i++){
		l = i; r = n - 1; jog = -1;
		while (l <= r){
			md = (l + r) / 2;
			if (y < p[md] - p[i - 1]) r = md - 1;
			else if (x > p[md] - p[i - 1]) l = md + 1;
			else{
				e = i; jog = md; break;
			}
		}
		if (jog != -1) break;
	}
	for (int i = e; i <= jog; i++) a.push_back(u[i].second);
	sort(a.begin(), a.end());
	return a;
}

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