이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define double long double
#define pon ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); int T=1;
#define ponchik signed main
#define pb push_back
#define pf push_front
#define endl "\n"
#define F first
#define S second
const long long N=1e5+69,INF=1e18+1488;
vector<int> find_subset(int l, int u, vector<int> w) {
// freopen( "###.in" ,"r",stdin); freopen( "###.out" ,"w",stdout);
// cin>>T;
long long n=w.size(),a=l,b=u;
sort(w.begin(),w.end());
long long l1=0,r=0,sum=w[0];
vector <int> ans;
while (l1<=r&&l<n)
{
if (sum>=a&&sum<=b)
{
for (int i=l1; i<=r; i++) ans.pb(w[i]);
}
if (sum+w[r+1]<a) r++,sum+=w[r];
else if (sum+w[r+1]>b) l1++,sum-=w[l1-1];
}
return ans;
}
# | 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... |