# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
543055 | Olympia | Detecting Molecules (IOI16_molecules) | C++17 | 95 ms | 296 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 <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <limits.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset (int l, int r, vector<int> w) {
for (int i = 0; i < w.size(); i++) {
if (w[i] >= l && w[i] <= r) {
return {i};
}
}
vector<pair<int64_t,int>> vec;
for (int i = 0; i < w.size(); i++) {
vec.push_back({w[i], i});
}
int t = 50000;
while (t--) {
random_shuffle(vec.begin(), vec.end());
int64_t pref = 0;
for (int i = 0; i < w.size(); i++) {
pref += vec[i].first;
if (pref >= l && pref <= r) {
vector<int> indices;
for (int j = 0; j <= i; j++) {
indices.push_back(vec[j].second );
}
return indices;
}
if (pref > r) {
break;
}
}
}
return {};
}
void print (vector<int> v) {
for (int i: v) {
cout << i << ' ';
}
cout << '\n';
}
/*
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
print(find_subset(14, 15, {5, 5, 6, 6}));
}
*/
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... |