# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701037 | Doncho_Bonboncho | Detecting Molecules (IOI16_molecules) | C++14 | 62 ms | 5508 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>
#include <vector>
typedef long long ll;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
std::vector<std::pair<int, int>> W;
for( int i=0 ; i<w.size() ; i++ ) W.push_back({w[i], i});
std::sort(W.begin(), W.end());
int ind = 0;
ll currSum = 0;
int n = (int)W.size();
for( int i=0 ; i<n ; i++ ){
while( ind < n and currSum < l ) currSum += W[ind++].first;
if( currSum >= l and currSum <= u ){
std::vector<int> nas;
for( int j = i ; j < ind ; j++ ) nas.push_back( W[j].second );
std::sort( nas.begin(), nas.end() );
return nas;
}
currSum -= W[i].first;
}
return std::vector<int>() ;
}
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... |