| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1317970 | _unknown_2010 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 332 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
deque<int> v;
long long s=0, n=w.size();
vector<int> o(n), ans;
iota(o.begin(), o.end(), 0);
sort(o.begin(), o.end(), [&](int i, int j){ return w[i] > w[j]; });
for(int i:o){
s += w[i];
v.emplace_back(i);
if(s>u){
s-=w[v[0]];
v.pop_front();
continue;
}
if(s>=l && s<=u)break;
}
for(auto &x:v)ans.emplace_back(x);
if(s<l || s>u)return vector<int>{0};
else return ans;
}
컴파일 시 표준 에러 (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... | ||||
