제출 #957505

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

molecules

#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
int check(int x, int l, int r) {
    return l >= x && x <= r;
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    map<int, deque<int>> ids;
    for(int i = 0; i < n; i++) {
        ids[w[i]].push_back(i);
    }
    sort(w.begin(), w.end());
    vector<int> d(n + 1);
    for(int i = 0; i < n; i++) {
        for(int j = i; j < n; j++) {
            if(u - l >= w[i] - w[j]) {
                d[i] = j;
            }
        }
    }
    vector<int> ans;
    for(int i = 0; i < n; i++) {
        multiset<int> ms;
        for(int j = i; j < d[i]; j++) {
            ms.insert(w[j]);
        }
        // s + x <= r
        // x <= r - s
        int s = 0;
        int ok = 0;
        while(1) {
            auto it = ms.upper_bound(u - s);
            if(it == ms.begin()) {
                ans.clear();
                break;
            }
            it--;
            int x = *it;
            s += x;
            ans.push_back(x);
            ms.erase(x);
            if(s >= l) {
                ok = 1;
                break;
            }
        }
        if(ok) {
            break;
        }
    }
    vector<int> p;
    for(auto it : ans) {
        p.push_back(ids[it].front());
        ids[it].pop_front();
    }
    return p;
}/*
signed main(){
    for(auto it:find_subset(10, 20, {15, 17,
                             16, 18}))cout<<it<<" ";
}
*/

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