結果
| 問題 | No.2617 容量3のナップザック |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2024-01-26 23:13:18 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,836 bytes |
| コンパイル時間 | 2,652 ms |
| コンパイル使用メモリ | 226,716 KB |
| 実行使用メモリ | 74,644 KB |
| 最終ジャッジ日時 | 2024-09-28 09:01:30 |
| 合計ジャッジ時間 | 12,920 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | WA | - |
| testcase_36 | WA | - |
| testcase_37 | WA | - |
| testcase_38 | WA | - |
| testcase_39 | WA | - |
| testcase_40 | WA | - |
| testcase_41 | WA | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))
typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;
template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
ll n, k, seed, a, b, m;
void input(){
in(n, k, seed, a, b, m);
}
void solve(){
vll f(2 * n);
f[0] = seed;
rep(i, 1, 2 * n){
f[i] = (a * f[i - 1] + b) % m;
}
vll v(n), w(n);
rep(i, n){
w[i] = (f[i] % 3) + 1;
v[i] = w[i] * f[n + i];
}
out(w);
vector<priority_queue<ll>> q(4);
rep(i, n){
q[w[i]].push(v[i]);
}
using T = tuple<ll, ll, ll>;
priority_queue<T, vector<T>, greater<T>> fin;
while(q[1].size() && q[2].size()){
ll t1 = q[1].top(), t2 = q[2].top();
fin.emplace(t1 + t2, 2, t2);
q[1].pop();
q[2].pop();
}
while(q[3].size()){
ll t = q[3].top();
q[3].pop();
fin.emplace(t, 3, t);
}
while(q[2].size()){
ll t = q[2].top();
q[2].pop();
fin.emplace(t, 3, t);
}
while(fin.size() > k){
fin.pop();
}
ll ans = 0;
while(fin.size()){
auto [vt, typ, vt2] = fin.top();
fin.pop();
if(typ == 2){
if(q[1].size() >= 2){
ll t1 = q[1].top(); q[1].pop();
ll t2 = q[1].top(); q[1].pop();
out(t1 + t2, vt2);
if(vt2 < t1 + t2){
vt += t1 + t2 - vt2;
}else{
q[1].push(t1);
q[1].push(t2);
}
}else if(q[1].size() == 1){
ll t1 = q[1].top(); q[1].pop();
if(vt2 < t1){
vt += t1 - vt2;
}else{
q[1].push(t1);
}
}
}else if(typ == 3){
if(q[1].size() >= 3){
ll t1 = q[1].top(); q[1].pop();
ll t2 = q[1].top(); q[1].pop();
ll t3 = q[1].top(); q[1].pop();
if(vt2 < t1 + t2 + t3){
vt += t1 + t2 + t3 - vt2;
}else{
q[1].push(t1);
q[1].push(t2);
q[1].push(t3);
}
}else if(q[1].size() == 2){
ll t1 = q[1].top(); q[1].pop();
ll t2 = q[1].top(); q[1].pop();
if(vt2 < t1 + t2){
vt += t1 + t2 - vt2;
}else{
q[1].push(t1);
q[1].push(t2);
}
}else if(q[1].size() == 1){
ll t1 = q[1].top(); q[1].pop();
if(vt2 < t1){
vt += t1 - vt2;
}else{
q[1].push(t1);
}
}
}
ans += vt;
}
out(ans);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
input();
solve();
}