제출 #432520

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432520		MarcoMeijer	Detecting Molecules (IOI16_molecules)	C++14	69 / 100	1082 ms	4684 KiB

molecules

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

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

vi find_subset(int l, int u, vi w) {
    int n = w.size();
    vi sa;
    RE(i,n) sa.pb(i);
    sort(all(sa),[&](int i, int j) {
        return w[i]<w[j];
    });
    RE(j,w.size()) {
        ll total = 0;
        vi ans;
        REP(i,j,w.size()) {
            total += w[sa[i]];
            ans.pb(sa[i]);
            if(total >= l && total <= u)
                return ans;
        }
    }
    return {};
}

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