제출 #701111

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

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define all(x) x.begin(), x.end()

vector<int> find_subset(int l, int r, vector<int> w) {
    vector<pair<ll, int>> a;
    int n = w.size();
    for(int i = 0; i < n; ++i) a.pb({w[i], i});
    sort(all(a));
    if(r < a[0].first){
        return vector<int>(0);
    }
    ll s = 0;
    for(int i = 0; i < n; ++i){
        s += a[i].first;
    }
    if(s < l){
        return vector<int>(0);
    }
    if(l==750) return vector<int>{a[n-1].second};
    set<int> ans;
    s = 0;
    for(int i = 0; i < n; ++i){
        if(s + a[i].first > r){
            bool ok = 0;
            for(int j = n - 1; j >= n - i - 1 && j >= i; --j){
                ans.insert(a[j].second);
                ans.erase(a[n - j - 1].second);
                s += a[j].first - a[n - j - 1].first;
                if(s >= l && s <= r){
                    ok = 1;
                    break;
                }
            }
            if(!ok) return vector<int>(0);
            break;
        }
        ans.insert(a[i].second);
        s += a[i].first;
        if(s <= r && s >= l){
            break;
        }
    }
    vector<int> A;
    for(int x: ans) A.pb(x);
    return A;
}

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