제출 #853712

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

molecules

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    pair<int, int> a[n];
    ll sum = 0;
    for (int i = 0;i < n;i++) {
        sum += w[i];
        a[i] = { w[i],i };
    }
    sort(a, a + n);
    deque<int> dq;
    vector<int> ans;
    for (int i = 0;i < n;) {
        if (l <= sum && sum <= u) break;
        if (sum > u) {
            sum -= a[dq.front()].first;
            dq.pop_front();
            continue;
        }
        else if (sum < l) {
            sum += a[i].first;
            dq.push_back(i);
            i++;
        }
    }
    while (sum > u) {
        sum -= a[dq.front()].first;
        dq.pop_front();
    }
    while (!dq.empty() && (l <= sum && sum <= u)) {
        ans.push_back(a[dq.front()].second);
        dq.pop_front();
    }
    return ans;
}

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