제출 #1003263

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1003263		toast12	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	32 ms	4048 KiB

molecules

#include "molecules.h"
#include <vector>
#include <algorithm>

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    int n = (int)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 left = 0, right = 0;
    int cur_sum = a[0].first;
    bool poss = false;
    while (right < n) {
        while (cur_sum < l && right < n) {
            right++;
            cur_sum += a[right].first;
        }
        while (cur_sum > u) {
            cur_sum -= a[left].first;
            left++;
            if (right <= left) {
                right = left;
                cur_sum = a[left].first;
            }
        }
        if (cur_sum >= l && cur_sum <= u) {
            poss = true;
            break;
        }
    }
    vector<int> answer(0);
    if (poss) {
        for (int i = left; i <= right; i++) {
            answer.push_back(a[i].second);
        }
    }
    return answer;
}

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