Submission #1100980

#	Time	Username	Problem	Language	Result	Execution time	Memory
1100980		Mike_Vu	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	40 ms	7372 KiB

molecules

//#ifndef mikevui
//    #include "task.h"
//#endif // mikevui

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double dou;
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
#define MASK(x) (1LL<<(x))
#define BITj(x, j) (((x)>>(j))&1)

template<typename T> bool maximize(T &x, const T &y) {
    if (x < y) {x = y; return 1;}
    return 0;
}
template<typename T> bool minimize(T &x, const T &y) {
    if (x > y) {x = y; return 1;}
    return 0;
}

const int maxn = 2e5+5;
int n, l, r;
vector<int> ans;
vector<pii> a;

void solve() {
    int j = 0, sum = 0;
    //be careful of overflow
    sort(a.begin(), a.end());
    for (int i = 0; i < n; i++) {
        while (j+1 <= n && r-sum-a[i].fi < 0) {
            sum -= a[j++].fi;
        }
        sum += a[i].fi;
//        cout << i << ' ' << j << ' ' << sum << "\n";
        if (l <= sum && sum <= r) {
            for (int cur = j; cur <= i; cur++) {
                ans.pb(a[cur].se);
            }
            break;
        }
    }
    sort(ans.begin(), ans.end());
}

vector<int> find_subset(int _l, int _r, vector<int> w) {
    n = (int)w.size();
    l = _l;
    r = _r;
    for (int i= 0; i < n; i++) {
        a.pb({w[i], i});
    }
    solve();
    return ans;
}

#ifdef mikevui
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    #define name "task"
//    if (fopen(name".inp", "r")) {
//        freopen(name".inp", "r", stdin);
//        freopen(name".out", "w", stdout);
//    }
    int n, l, u;
    vector<int> w;
    cin >> n >> l >> u;
    for (int i= 1; i <= n; i++) {
        int x;
        cin >> x;
        w.pb(x);
    }
    vector<int> res = find_subset(l, u, w);
    for (int x : res ){
        cout << x << ' ';
    }
}
#endif // mikevui
/*
4 15 17
6 8 8 7
*/

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