| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1102202 | akzytr | Detecting Molecules (IOI16_molecules) | C++17 | 132 ms | 27468 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// #include "molecules.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
	ll p = 0;
	vector<int> result;
    int n = w.size();
	pair<int, int> w2[n];
	for(int i = 0; i < n; i++) {
		w2[i].first = w[i];
		w2[i].second = i;
	}
	sort(w2, w2 + n);
	set<ll> pss;
	map<ll, int> psjn;
	psjn[0] = -1;
	pss.insert(0);
	for(int i = 0; i < w.size(); i++) {
		p += w2[i].first;
		auto lb = pss.lower_bound(p - u);
		if(lb == pss.end()) {
			lb--;
		}
		if(lb != pss.end() && p - *lb >= l && p - *lb <= u) {
			for(int j = psjn[*lb] + 1; j <= i; j++) {
				result.push_back(w2[j].second);
			}
			break;
		}
		pss.insert(p);
		psjn[p] = i;
	}
	return result;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
