제출 #590621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
590621		Vanilla	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	59 ms	6176 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"
typedef long long int64;
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector <pair <int, int> > a;
    for (int i = 0; i < n; i++) {
        a.push_back({w[i], i});
    }
    sort(a.begin(), a.end());
    int it = -1;
    int64 sum = 0;
    queue <int> dq;
    bool good = 0;
    while (it != n) {
        // cout << it << " " << sum << " " << dq.size() << "\n";
        if (sum < l) {
            dq.push(a[++it].second);
            sum+=a[it].first;
        }
        else if (sum > u) {
            sum-=w[dq.front()];
            dq.pop();
        }
        else {
            good = 1;
            break;
        }
    }
    // cout << good << " " << dq.size() << "\n";
    vector <int> rs;
    if (good) {
        while (!dq.empty()) {
            rs.push_back(dq.front());
            dq.pop();
        }
    }
    return rs;
}

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