제출 #787351

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
787351		NothingXD	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	46 ms	4108 KiB

molecules

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

using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<double> point;

void debug_out(){cerr << endl;}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 2e5 + 10;

int n, a[maxn], idx[maxn];

bool cmp(int x, int y){
	return a[x] < a[y];
}

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	vector<int> ans;
	n = w.size();
    for (int i = 0; i < n; i++){
		a[i] = w[i];
		idx[i] = i;
	}
	sort(idx, idx + n, cmp);
	ll sum = 0;
	int ptr = 0;
	for (int i = 0; i < n; i++){
		sum += a[idx[i]];
		while (sum > u){
			sum -= a[idx[ptr]];
			ptr++;
		}
		if (sum < l) continue;
		for (int j = ptr; j <= i; j++) ans.push_back(idx[j]);
		break;
	}
	return ans;
}

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