# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
297778 | emnik | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 256 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 <bits/stdc++.h>
#include "molecules.h"
using namespace std;
typedef long long ll;
#define pb push_back
#define all(x) begin(x), end(x)
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
std::vector<int> find_subset(int l, int r, vector<int> W){
vector<int> b;
vector<pair<int, int>> a,Pair;
for(int i=0; i < (int)W.size(); i++){
Pair.pb({W[i], i});
}
sort(Pair.begin(), Pair.end());
ll sum=0, x=0, flag=0;
for(int i=0; i < (int)Pair.size(); i++){
if(sum < l){
sum += (ll)Pair[i].first;
a.pb({Pair[i].first, Pair[i].second});
}
if(sum > r){
sum -= (ll)Pair[x].first;
x++;
}
if(sum >= l && sum <= r){
flag=1;
break;
}
}
for(int i=x; i < (int)a.size(); i++){
b.pb(a[i].second);
}
return b;
}
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... |