제출 #114844

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
114844		oolimry	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	83 ms	7660 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<int> v;

    int n = w.size();
    typedef pair<long long, long long> ii;

    ii arr[n];

    for(int i = 0;i < n;i++){
        arr[i] = ii(w[i],i);
    }

    sort(arr,arr+n);

    long long low = 0;
    long long high = 0;
    vector<int> ll;
    vector<int> hh;
    for(int c = 0;c < n;c++){
        low += arr[c].first;
        high += arr[n-c-1].first;
        ll.push_back(arr[c].second);
        hh.push_back(arr[n-c-1].second);
        if(l <= low && low <= u){
            return ll;
        }
        else if(l <= high && high <= u){
            return hh;
        }
        else if(low < l && high > u){
            for(int i = 0;i <= c;i++){
                long long x = ll[i];
                long long y = hh[i];
                low -= w[x];
                low += w[y];
                hh[i] = x;
                ll[i] = y;
                if(l <= low && low <= u){
                    return ll;
                }
            }
            while(true){

            }
        }
    }


    return v;
}

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