# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1217065 | moondarkside | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 328 KiB |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset( int l, int u, vector<int> w ) {
map<int,std::stack<int>> Original;
for(int i=0;i<w.size();i++){
Original[w[i]].push(i);
}
sort(w.begin(),w.end());
if(w[0]>u){
return vector<int>();
}
int weight=0;
vector<int> Solve;
for(int i=0;i<w.size();i++){
Solve.push_back(Original[w[i]].top());
Original[w[i]].pop();
weight+=w[i];
if(weight>=l && weight<=u){
return Solve;
}
if(weight>u){
Solve.erase(Solve.begin());
return Solve;
}
}
return 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... |