이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define F first
#define S second
#define dbg(x) cout << #x << ": " << x << endl;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = (int) w.size();
vector<pair<int,int>> a;
for(int i=0; i<n; ++i){
a.emplace_back(w[i], i);
}
sort(a.begin(), a.end());
ll sum = 0;
int left = 0;
int right;
for(right=0; right<n; ++right){
sum += a[right].F;
while(sum > u){
if(left == right){
return vector<int>(0);
}
sum -= a[left].F;
left++;
}
if(sum >= l){
// ans found
vector<int> ans;
for(int i=left; i<=right; ++i){
ans.push_back(a[i].S);
}
return ans;
}
}
return vector<int>(0);
}
# | 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... |