| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1325767 | antarbanik | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 332 KiB |
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w){
int n = w.size();
vector<int> ans;
bool f = 0;
int s = 0;
for(int i = 0;i<n;++i){
s += w[i];
ans.push_back(i);
if(s >= l && s <= u){
f = 1;
break;
}
}
if(!f) ans.clear();
return ans;
}
// int main(){
// vector<int> v = find_subset(6, 10, {20, 20});
// for(auto e : v) cout<<e<<" ";
// }컴파일 시 표준 에러 (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... | ||||
