Submission #1092877

#	Time	Username	Problem	Language	Result	Execution time	Memory
1092877		TrinhKhanhDung	Detecting Molecules (IOI16_molecules)	C++14	100 / 100	36 ms	6324 KiB

molecules

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)
#include "molecules.h"

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

vector<int> find_subset(int l, int r, vector<int> arr){
    vector<int> ans;
    int n = sz(arr);

    vector<pair<int, int>> ord;
    for(int i = 0; i < n; i++){
        ord.push_back({arr[i], i});
    }
    sort(ALL(ord));

    ll cur = 0;
    int j = 0;
    for(int i = 0; i < n; i++){
        cur += ord[i].fi;
        while(cur > r){
            cur -= ord[j].fi;
            j++;
        }

        if(cur >= l){
            for(int k = j; k <= i; k++){
                ans.push_back(ord[k].se);
            }
            break;
        }
    }

    return ans;
}

//int main(){
//    ios_base::sync_with_stdio(0); cin.tie(0);
////     freopen("durian.inp","r",stdin);
////     freopen("durian.out","w",stdout);
//
//    vector<int> ans = find_subset(10, 20, {15, 17, 16, 18});
//    for(int i: ans) cout << i << ' ';
//
//    return 0;
//}

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