이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
#define fi first
#define se second
#define _size(x) (int)x.size()
#define BIT(i, x) ((x >> i) & 1)
#define MASK(n) ((1 << n) - 1)
#define REP(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define FOR(i, a, b) for (int i = a, _b = (b); i <= _b; i++)
#define FORD(i, a, b) for (int i = a, _b = (b); i >= _b; i--)
#define FORB1(i, mask) for (int i = mask; i > 0; i ^= i & - i)
#define FORB0(i, n, mask) for (int i = ((1 << n) - 1) ^ mask; i > 0; i ^= i & - i)
#define FORALL(i, a) for (auto i: a)
#define fastio ios_base::sync_with_stdio(0); cin.tie(0);
vector<int> find_subset(int l, int u, vector<int> w) {
vector<pair<int, int>> g;
int n = _size(w);
REP(i, n) g.push_back({w[i], i});
sort(g.begin(), g.end());
priority_queue<pair<int, int>> inPQ, notinPQ;
int res = 0;
FORD(i, n - 1, 0) {
if (res + g[i].fi <= l) {
res += g[i].fi;
inPQ.push({- g[i].fi, g[i].se});
}
else notinPQ.push(g[i]);
}
if (res < l && notinPQ.empty()) return {};
if (inPQ.empty()) {
if (res + g[0].fi <= u) return {g[0].se};
else return {};
}
while (res < l) {
pair<int, int> subtract = inPQ.top();
inPQ.pop();
pair<int, int> add = notinPQ.top();
notinPQ.pop();
if (add.fi + subtract.fi <= 0) return {};
res += (add.fi + subtract.fi);
inPQ.push({- add.fi, add.se});
notinPQ.push({- subtract.fi, subtract.se});
}
vector<int> ans;
while (!inPQ.empty()) {
ans.push_back(inPQ.top().se);
inPQ.pop();
}
sort(ans.begin(), ans.end());
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... |