# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1150902 | danglayloi1 | Detecting Molecules (IOI16_molecules) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
using ll = long long;
const ll mod=1e9+7;
vector<int> find_subset(int l, int u, vector<int> a)
{
vector<int> res;
int n=a.size();
ll sum=0;
vector<pair<ll, int>> b;
for(int i = 0; i < n; i++)
b[i]={a[i], i};
sort(b.begin(), b.end());
if(b[0].fi>u || b.back().fi<l)
{
res.clear();
return res;
}
for(int i = 0; i < n; i++)
if(sum+b[i].fi<l) sum+=b[i].fi, res.emplace_back(b[i].se);
int lim=n, j=res.size()-1;
while(sum<l || sum>u)
{
ll tmp=sum-a[res[j]]+b[lim-1].fi;
sum=tmp, res[j]=b[lim-1].se;
lim--;
j--;
}
if(sum>=l && sum<=u)
return res;
res.clear();
return res;
}
컴파일 시 표준 에러 (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... |