# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1020473 | vjudge1 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 348 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.
// #pragma once
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
std::vector<int> find_subset(int l, int u, std::vector<int> w){
int mn = 1111, cnt = 0;
for(int x: w){
if(x < mn){
mn = x;
cnt = 0;
}
cnt += mn == x;
}
for(int i = 1; i <= w.size(); i++){
int cal = max(0, (i - cnt));
if(mn * i + cal < l){
cal = l - mn * i;
}
if(cal <= min(i, (int)w.size() - cnt) && mn * i + cal <= u){
int x = i - cal, y = cal;
vector<int> ans;
for(int i = 0; i < w.size(); i++){
if(w[i] == mn && x){
x--; ans.push_back(i);
} else if(w[i] == mn + 1 && y){
y--; ans.push_back(i);
}
}
return ans;
}
}
return {};
}
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... |