Submission #783898

#	Time	Username	Problem	Language	Result	Execution time	Memory
783898		Alfraganus	Detecting Molecules (IOI16_molecules)	C++14	19 / 100	1 ms	304 KiB

molecules

#include "molecules.h"
// #include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<int> ans;
    int mn = *min_element(all(w)), k = count(all(w), mn);
    for(int i = 0; i <= k; i ++){
        int t = i * mn;
        if(u < t)break;
        if(l <= t and t <= u){
            for(int j = 0; j < (int)w.size(); j ++){
                if(w[j] == mn and i > 0){
                    ans.push_back(j);
                    i --;
                }
                if(i == 0)break;
            }
            break;
        }
        int left = (l - t + mn) / (mn + 1);
        if(left > (int)w.size() - k or t + left * (mn + 1) > u)continue;
        for(int j = 0; j < (int)w.size(); j ++){
            if(w[j] == mn and i > 0){
                ans.push_back(j);
                i --;
            }
            if(w[j] == mn + 1 and left > 0){
                ans.push_back(j);
                left --;
            }
        }
        break;
    }
    return ans;
}

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