| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1324641 | riafhasan2010 | Detecting Molecules (IOI16_molecules) | C++17 | 0 ms | 0 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size(), mn = w[0];
ll sum = 0;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
a[i].first = w[i];
a[i].second = i;
}
sort(a.begin(), a.end());
vector<ll> psum(n + 1); psum[0] = 0;
for (int i = 0; i < n; i++) {
sum += a[i].first;
psum[i + 1] = sum;
}
if (sum < l or w[0] > u) return vector<int>(0);
vector<int> ans;
for (int i = 1; i <= n; i++) {
int ind = n, left = 0, right = i;
while (left <= right) {
int m = (left + right) / 2;
if (psum[i] - psum[m] >= l and psum[i] - psum[m] <= u) {
ind = m + 1;
break;
}
if (psum[i] - psum[m] >= u) right = m - 1;
else left = m + 1;
}
if (ind <= i) {
for (int j = ind; j <= i; j++) {
ans.push_back(a[j - 1].second);
}
break;
}
}
return ans;
}
int main() {
auto ans = find_subset(10, 20, {15, 17, 16, 18});
for (auto i : ans) cout << i << " ";
}
