Submission #50197

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
50197	2018-06-08 08:45:21	hugo_pm	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	92 ms	26904 KiB

molecules

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wunused-result"
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w)
{
    vector<pair<int, int>> rafin(w.size());
    for (int i = 0; i < (int)(w.size()); ++i) rafin[i] = {w[i], i};
    sort(rafin.begin(), rafin.end());
    sort(w.begin(), w.end());
    ll somme = 0;
    int k = w.size() - 1;
    int i = k;
    while ((somme < (ll)(l) || somme > (ll)(u)) && (i >= 0 && k >= 0))
    {
        if (somme < l) { somme += (ll)(w[i]); --i; }
        else { somme -= (ll)(w[k]); --k; }
    }
    if (somme < (ll)(l) || somme > (ll)(u)) return {};
    ++i;
    vector<int> ans(k-i+1);
    for (int o = i; o <= k; ++o) ans[o-i] = rafin[o].second;
    return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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