# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1266674 | cmiuc | Detecting Molecules (IOI16_molecules) | C++20 | 37 ms | 4280 KiB |
#include <iostream>
#include <queue>
#include <algorithm>
#include "molecules.h"
using namespace std;
vector<int> Vector(queue<int> Q){
vector<int> v;
while (Q.size() > 0)
v.push_back(Q.front()), Q.pop();
return v;
}
vector<int> find_subset(int l, int r, vector<int> w){
vector<pair<int,int>> vec;
queue<int> Ans;
long long Sum = 0, n = w.size();
for (int i=0;i<n;i++)
vec.push_back({w[i], i});
sort(vec.begin(), vec.end());
for (auto [W, ind] : vec){
Sum += W;
while (Sum > r and Ans.size() > 0)
Sum -= w[Ans.front()], Ans.pop();
Ans.push(ind);
if (Sum > r)
return {};
if (Sum >= l and Sum <= r)
return Vector(Ans);
// cout<<Sum<<" "<<Ans.size()<<endl;
}
return {};
}
컴파일 시 표준 에러 (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... |