Submission #1288808

#TimeUsernameProblemLanguageResultExecution timeMemory
1288808muhammad-ahmadDetecting Molecules (IOI16_molecules)C++20
100 / 100
39 ms8348 KiB
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;

#define ll long long

vector<int> find_subset(int l, int u, vector<int> w) {
	int n = w.size();
	vector<pair<int, int>> X;
	for (int i = 0; i < n; i++){
		X.push_back({w[i], i});
	}
	sort(X.begin(), X.end());
	int a[n + 1], idx[n + 1];
	for (int i = 0; i < n; i++){
		a[i + 1] = X[i].first;
		idx[i + 1] = X[i].second;
	}
	ll pref[n + 2] = {}, suf[n + 2] = {};
	
	for (int i = 1; i <= n; i++){
		pref[i] = pref[i - 1];
		pref[i] += a[i];
	}
	for (int i = n; i >= 1; i--){
		suf[i] = suf[i + 1];
		suf[i] += a[i];
	}
	
	
	suf[0] = u;
	suf[0] *= 2;
	int R = 0;
	for (int L = 0; L <= n; L++){
		while (R <= n && (ll)(pref[L] + suf[R]) > u) {
			R++;
		}
		// cout << L << ' ' << R << endl;
		ll s = pref[L] + suf[R];
		if (s >= l && s <= u && R > L){
			vector<int> ans;
			for (int i = 1; i <= L; i++) ans.push_back(idx[i]);
			for (int i = R; i <= n; i++) ans.push_back(idx[i]);
			return ans;
		}
	}
	
	
	return {};
	
}

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
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...