# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1235857 | kaltspielerhy | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> trans(deque<int> q) {
vector<int> res;
while (!q.empty()) {
res.push_back(q.back());
q.pop_back();
}
return res;
}
vector<int> find_subset(int l, int u, vector<int> w) {
sort(w.begin(), w.end());
int N = w.size();
int idx = N-1;
ll somme = 0;
deque<int> result;
while (idx >= 0 && somme < l) {
somme += w[idx];
result.push_back(idx);
idx--;
}
if (somme >= l && somme <= u) return trans(result);
for (int i = 0; i < N; i++) {
somme -= result.back();
result.pop_back();
somme += w[i];
result.push_front(i);
if (somme >= l && somme <= u) return trans(result);
}
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... |