| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 138378 | cfalas | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 380 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>
using namespace std;
#include "molecules.h"
typedef pair<int, int> ii;
#define S second
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<ii> sorpos;
int f = 0;
int s = 0;
int n = w.size();
for(int i=0;i<w.size();i++) sorpos.push_back(ii(w[i], i));
for(int i=0;i<n;i++){
if(w[i]==w[0]) f++;
else s = w[i];
}
for(int i=0;i<=f;i++){
int tot = i*w[0];
int added = 0;
while(tot<l && s!=0 && added<n-f){
tot+=s;
added++;
}
if(tot>=l && tot<=u){
vector<int> result;
for(int j=0;j<i;j++){
result.push_back(sorpos[j].S);
}
for(int j=0;j<added;j++){
result.push_back(sorpos[n-j-1].S);
}
return result;
}
}
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... | ||||
