제출 #352365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
352365		spike1236	Detecting Molecules (IOI16_molecules)	C++14	0 / 100	1 ms	364 KiB

molecules

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>
veci find_subset(int asd, int asdas, veci w) {
    ll L = asd, R = asdas;
    int n = sz(w);
    vector <pair <ll, int> > a;
    for(int i = 0; i < n; ++i)
        a.pb(mp(w[i], i));
    sort(all(a));
    ll sum = 0;
    int r = 0;
    for(int l = 0; l < n; ++l) {
        while(r < n && sum + a[r].f <= R) sum += a[r++].f;
        if(L <= sum && sum <= R) {
            veci res;
            for(int j = l; j <= r; ++j) res.pb(a[j].s);
            return res;
        }
        sum -= a[l].f;
    }
    return {};
}

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