Submission #1134859

#	Time	Username	Problem	Language	Result	Execution time	Memory
1134859		trvhung	Detecting Molecules (IOI16_molecules)	C++20	100 / 100	35 ms	4936 KiB

molecules

#ifndef TPV
#include "molecules.h"
#endif

#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>

// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

// #define   ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define            ll long long
#define           ull unsigned long long
#define            ld long double
#define            pb push_back
#define  bit(mask, i) ((mask >> i) & 1)
#define            el '\n'
#define             F first
#define             S second

template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }

const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U
const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL
const char cx[4] = {'R', 'D', 'L', 'U'};
const ll base = 31;
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};

const int maxn = 2e5 + 5;
int n, m, l, u, ori[maxn];
pair<int, int> w[maxn];
vector<int> res;
deque<int> q;

void solve() {
	sort(w + 1, w + 1 + n);

	for (int i = 1; i <= n; ++i)
		ori[w[i].S] = w[i].F;

	ll sum = 0;
	for (int i = 1; i <= n; ++i) {
		sum += w[i].F;
		if (sum < l) {
			q.pb(w[i].S);
			continue;
		}

		if (sum >= l && sum <= u) {
			q.pb(w[i].S);
			for (int x: q) res.pb(x);
			return;
		}

		sum -= ori[q.front()];
		q.pop_front();

		if (sum < l) {
			q.pb(w[i].S);
			continue;
		}

		if (sum >= l && sum <= u) {
			q.pb(w[i].S);
			for (int x: q) res.pb(x);
			return;
		}
	}

	res.clear();
	return;
}

vector<int> find_subset(int L, int U, vector<int> W) {
	l = L; u = U;
	m = (int) W.size();

	for (int i = 0; i < m; ++i) {
		if (W[i] > U) continue;
		if (L <= W[i] && W[i] <= U) {
			vector<int> T = {i};
			return T;
		}

		w[++n] = make_pair(W[i], i);
	}

	solve();

	sort(res.begin(), res.end());

	return res;
}

#ifdef TPV
	
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	freopen("input.inp", "r", stdin);
	freopen("output.out", "w", stdout);

	int nn, LL, uu;
	vector<int> vv;

	cin >> nn >> LL >> uu;

	vv.resize(nn);
	for (int &x: vv) cin >> x;

	vector<int> ans = find_subset(LL, uu, vv);	
	for (int x: ans) cout << x << ' ';

	return 0;
}

#endif

Compilation message (stderr)

molecules.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
molecules_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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