# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1211844 | Marco_Escandon | Detecting Molecules (IOI16_molecules) | C++20 | 55 ms | 11948 KiB |
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
vector<pair<ll,ll>> asd;
for(int i=0; i<w.size(); i++)
{
asd.push_back({w[i],i});
}
sort(w.begin(),w.end());
sort(asd.begin(),asd.end());
ll ac=0;
vector<int> ans;
priority_queue<pair<ll,ll>> q;
for(int i=0; i<w.size(); i++)
{
if(ac+w[i]<=u)
{
ac+=w[i];
ans.push_back(i);
if(ac>=l)
{
for(int j=0; j<ans.size(); j++)
ans[j]=asd[ans[j]].second;
return ans;
}
}
else q.push({w[i],i});
}
ll p=0;
while(p<ans.size()&&!q.empty()&&ac<l&&q.top().first>w[ans[p]])
{
ac+=q.top().first-w[ans[p]];
q.push({w[ans[p]],ans[p]});
ans[p]=q.top().second;
p++;
q.pop();
}
if(ac>=l&&ac<=u)
{
for(int j=0; j<ans.size(); j++)
ans[j]=asd[ans[j]].second;
return ans;
}
ans.clear();
return ans;
}
컴파일 시 표준 에러 (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... |