제출 #426697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
426697		Mazaalai	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	66 ms	6184 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
typedef long long ll;
#define ff first
#define ss second
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
    int n = w.size();
    vector <pair <int, int> > nums;
    for (int i = 0; i < n; i++) {
        nums.push_back({w[i], i});
    }
    sort(nums.begin(), nums.end());
    queue <pair <int, int> > cur; // val, idx
    vector <int> ans;
    ll sum = 0, pos = 0; 
    bool answ = 0;
    while(pos < n) {
        sum += nums[pos].ff;
        cur.push({nums[pos++]});
        if (l <= sum && sum <= u) {
            answ = 1;
            break;
        }
        while(sum > u) {
            auto num = cur.front();
            cur.pop();
            sum -= num.ff;
        }
        if (l <= sum && sum <= u) {
            answ = 1;
            break;
        }
    }
    if(answ) {
        while(!cur.empty()) {
            ans.push_back(cur.front().ss);
            cur.pop();
        }
    }
    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