Submission #306604

#	Time	Username	Problem	Language	Result	Execution time	Memory
306604		syy	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	61 ms	7208 KiB

molecules

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define all(v) v.begin(), v.end()
#define disc(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
#define INF (int) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; } //inclusivesss

ll n, ss[200005];
pi arr[200005];

vector<int> find_subset(int l, int u, vector<int> w) {
	vector<int> res; res.clear();
    n = w.size();
    FOR(i, 1, n) arr[i] = pi(w[i-1], i-1);
    sort(arr+1, arr+n+1);
    FOR(i, 1, n) ss[i] = ss[i-1] + arr[i].f;
    ll s = 1;
    FOR(i, 1, n) {
		if (ss[i] - ss[s-1] > u) s++;
		if (l <= ss[i] - ss[s-1] and ss[i] - ss[s-1] <= u) {
			FOR(j, s, i) res.pb(arr[j].s);
			break;
		}
	}
	return res;
}

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