# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1262285 | alexiah | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 324 KiB |
#include "molecules.h"
#include <algorithm>
#include <vector>
using namespace std;
typedef vector <int> vi;
vi find_subset(int l, int u, vi w) {
vi index;
int sum = 0;
int mi = *min(w.begin() , w.end());
int s = 0;
for(int i = 0; i < w.size(); i++){
if(w[i] == mi){
s = i; break;
}
}
for(int i = s; i < w.size(); i++){
if(l <= sum && sum <= u) break;
if(sum + w[i] <= u){
sum += w[i];
index.push_back(i);
}
}
return index;
}
컴파일 시 표준 에러 (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... |