# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1197521 | vivkostov | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 328 KiB |
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
long long int n,l,r,a[200005];
vector<int>v;
std::vector<int> find_subset(int L, int R, std::vector<int> W)
{
n=W.size();
l=L;
r=R;
long long int sum=0;
for(int i=1;i<=n;i++)
{
a[i]=W[i-1];
sum+=a[i];
}
if(sum<r)return v;
sort(a+1,a+n+1);
for(int i=n;i>1;i--)
{
while(i>1&&r-a[i]<a[1])i--;
v.push_back(i);
r-=a[i];
l-=a[i];
}
if(l<=0&&r>=0)return v;
v.clear();
return v;
}
컴파일 시 표준 에러 (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... |