# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667096 | irmuun | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 340 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;
#define pb push_back
#define ll long long
vector<int>find_subset(int l,int u,vector<int>w){
int n=w.size();
int mn=2147483647;
for(int i=0;i<n;i++){
mn=min(mn,w[i]);
}
vector<int>v[2];
for(int i=0;i<n;i++){
v[w[i]-mn].pb(i);
}
vector<int>ans;
for(int i=0;i<=v[0].size();i++){
for(int j=0;j<=v[1].size();j++){
if(l<=i*mn+j*(mn+1)&&i*mn+j*(mn+1)<=u){
for(int k=0;k<i;k++){
ans.pb(v[0][k]);
}
for(int k=0;k<j;k++){
ans.pb(v[1][k]);
}
return ans;
}
}
}
return ans;
}
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... |