# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1217054 | moondarkside | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 332 KiB |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
vector<int> find_subset( int l, int u, vector<int> w ) {
sort(w.begin(),w.end());
if(w[0]>u){
return vector<int>();
}
int weight=0;
vector<int> Solve;
for(int i=0;i<w.size();i++){
Solve.push_back(i);
weight+=w[i];
if(weight>l && weight<=u){
return Solve;
}
if(weight>u){
Solve.erase(Solve.begin());
return Solve;
}
}
return vector<int>();
}
컴파일 시 표준 에러 (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... |