# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1144119 | crispxx | Detecting Molecules (IOI16_molecules) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
#include "molecules.h"
// #include "grader.cpp"
using namespace std;
#define all(x) x.begin(), x.end()
#define nl '\n'
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<int> ans;
bool flag = false;
for(int i = 0; i < n; i++) {
ans.push_back(i);
if(int v = w[0] * (i + 1); l <= v && v <= u) {
flag = true;
break;
}
}
if(flag) return ans;
return vector<int>(0);
}
컴파일 시 표준 에러 (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... |