| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1323195 | phoenix0423 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 332 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size();
if(accumulate(w.begin(), w.end(), 0LL) < l) return {};
vector<int> ans;
vector<int> id(n);
iota(id.begin(), id.end(), 0);
sort(id.begin(), id.end(), [&](int a, int b){ return w[a] < w[b]; });
ll cur = 0;
for(int i = n - 1; i >= 0 && cur < l; i--){
ans.pb(id[i]);
cur += w[id[i]];
}
int p = 0;
for(int i = 0; i < ans.size(); i++){
if(cur <= u) break;
if(id[p] >= ans[i]) return {};
// assert(id[p] < ans[i]);
cur += w[id[p]] - w[ans[i]];
ans[i] = id[p++];
}
if(cur > u) return {};
sort(ans.begin(), ans.end());
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... | ||||
