이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/**
* بسم الله الرحمن الرحيم *
﴾ رَبِّ اشْرَحْ لِي صَدْرِي * وَيَسِّرْ لِي أَمْرِي * وَاحْلُلْ عُقْدَةً مِّن لِّسَانِي * يَفْقَهُوا قَوْلِي ﴿
*/
/// author : "ASGA"
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ONLINE 0
#ifdef ONLINE_JUDGE
#undef ONLINE;
#define ONLINE 1
#endif
#define dbg(a) if(!ONLINE)cout << a << ' ';
const ll inf = 1e18;
vector <int> find_subset(int l,int r,vector <int> a){
int n = a.size();
sort(a.begin(),a.end());
ll sum = 0;vector <int> ans;
int i = 0,j = 0;
while(i < n){
sum += a[i];
while(j <= i && sum > r)sum -= a[j++];
if(l <= sum && sum <= r){
while(j <= i)ans.push_back(j++);
break;
}
i++;
}
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... |