Submission #50332

#	Time	Username	Problem	Language	Result	Execution time	Memory
50332		ernestvw	Detecting Molecules (IOI16_molecules)	C++11	9 / 100	2 ms	568 KiB

molecules

#include <bits/stdc++.h>
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    vector<int> result;
    vector<pair<int, int>> poids;
    for(int i = 0; i < (int)w.size(); i++) {
        poids.push_back({w[i], i});
    }
    sort(poids.rbegin(), poids.rend());
    long long somme = 0;
    int i2 = -1;
    int a(-1), b(-1);
    for(int i = 0; i < (int)w.size(); i++) {
        if(i2 < i) {
            somme = (long long)poids[i].first;
            i2 = i;
        }
        while(i2+1 < (int)w.size() and somme+poids[i2+1].first<=u)
 {
            somme += (long long)poids[i2+1].first;
            i2++;
        }
        if(l <= somme and somme <= u) {
            a = i;
            b = i2;
            break;
        }
    }
    if(a == -1) return result;
    for(int i = a; i <= b; i++) result.push_back(poids[i].second);
    return result;
}

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