제출 #470828

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
470828		jalsol	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	62 ms	5592 KiB

molecules

// looking to shine brighter in this world...

#define TASK "molecules"
#include "molecules.h"

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// ================================================================================

constexpr int maxn = 3e5 + 5;

vector<int> find_subset(int l, int r, vector<int> w) {
    int n = isz(w);

    vector<pair<int, int>> a(n);
    Rep (i, n) {
        a[i] = { w[i], i };
    }

    sort(all(a));

    deque<int> q;
    ll sum = 0;

    Rep (i, n) {
        sum += a[i].first;
        q.push_back(a[i].second);

        while (sum > r) {
            sum -= w[q.front()];
            q.pop_front();
        }

        if (l <= sum && sum <= r) {
            return vector<int>(all(q));
        }
    }

    return {};
}

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