# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
774596 | aguss | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 212 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 <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <string>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
vector<int> find_subset(int l, int u, vector<int> w){
ll n = w.size();
vector<pair<int, int>> v(n);
vector<int> ans;
ll sum = 0;
bool t = true;
for(int i = 0; i < n; i++){
v[i].first = w[i];
v[i].second = i;
}
sort(v.begin(), v.end());
ll mv = 0;
for(int i = 0; i < n; i++){
mv += v[i].first;
ans.push_back(v[i].second);
if(mv >= l and mv <= u) {
sort(ans.begin(), ans.end());
return ans;
}
if(mv > u)
break;
}
return vector<int>(0);
}
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... |