結果
問題 | No.2025 Select -th Submultiset |
ユーザー |
![]() |
提出日時 | 2022-07-29 22:32:16 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 103 ms / 2,000 ms |
コード長 | 8,830 bytes |
コンパイル時間 | 3,978 ms |
コンパイル使用メモリ | 280,252 KB |
実行使用メモリ | 10,284 KB |
最終ジャッジ日時 | 2024-07-19 15:42:51 |
合計ジャッジ時間 | 9,713 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
#pragma GCC optimize("fast-math")#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using ull = unsigned long long;using uint = unsigned;using pcc = pair<char, char>;using pii = pair<int, int>;using pll = pair<ll, ll>;using pdd = pair<ld, ld>;using tuplis = array<ll, 3>;template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;const ll LINF=0x1fffffffffffffff;const ll MINF=0x7fffffffffff;const int INF=0x3fffffff;const int MOD=1000000007;const int MODD=998244353;const ld DINF=numeric_limits<ld>::infinity();const ld EPS=1e-9;const ld PI=3.1415926535897932;const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};#define overload5(a,b,c,d,e,name,...) name#define overload4(a,b,c,d,name,...) name#define overload3(a,b,c,name,...) name#define rep1(n) for(ll i=0;i<n;++i)#define rep2(i,n) for(ll i=0;i<n;++i)#define rep3(i,a,b) for(ll i=a;i<b;++i)#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)#define rrep1(n) for(ll i=n;i--;)#define rrep2(i,n) for(ll i=n;i--;)#define rrep3(i,a,b) for(ll i=b;i-->(a);)#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)#define each1(i,a) for(auto&&i:a)#define each2(x,y,a) for(auto&&[x,y]:a)#define each3(x,y,z,a) for(auto&&[x,y,z]:a)#define each4(w,x,y,z,a) for(auto&&[w,x,y,z]:a)#define each(...) overload5(__VA_ARGS__,each4,each3,each2,each1)(__VA_ARGS__)#define all1(i) begin(i),end(i)#define all2(i,a) begin(i),begin(i)+a#define all3(i,a,b) begin(i)+a,begin(i)+b#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)#define rall1(i) (i).rbegin(),(i).rend()#define rall2(i,k) (i).rbegin(),(i).rbegin()+k#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)#define sum(...) accumulate(all(__VA_ARGS__),0LL)#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)#define Msum(...) accumulate(all(__VA_ARGS__),Modint{0})#define elif else if#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)#define Sort(a) sort(all(a))#define Rev(a) reverse(all(a))#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))#define vec(type,name,...) vector<type>name(__VA_ARGS__)#define VEC(type,name,size) vector<type>name(size);in(name)#define vv(type,name,h,...) vector name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,w) vector name(h,vector<type>(w));in(name)#define vvv(type,name,h,w,...) vector name(h,vector(w,vector<type>(__VA_ARGS__)))template<class T> auto min(const T& a){ return *min_element(all(a)); }template<class T> auto max(const T& a){ return *max_element(all(a)); }template<class T, class U> auto count(const T& a, const U& b){ return count(all(a), b); }template<class T, class U> auto count_if(const T& a, U b){ return count_if(all(a), b); }template<class T, class U> T filter(T a, U b){ a.erase(remove_if(all(a), not_fn(b)), a.end()); return a; }inline ll popcnt(ull a){ return __builtin_popcountll(a); }ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }template<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }template<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }template<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }template<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }vector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }vector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }vector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }template<class T> unordered_map<T, ll> press(vector<T> a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }template<class T> auto run_press(const T& a){ vector<pair<decay_t<decltype(a[0])>, ll>> ans; each(x, a){ if(ans.empty() || ans.back().first != x) ans.emplace_back(x, 1); else ans.back().second++; } return ans; }template<class... Ts> void in(Ts&... t);[[maybe_unused]] void print(){}template<class T, class... Ts> void print(const T& t, const Ts&... ts);template<class... Ts> void out(const Ts&... ts){ print(ts...); cout << '\n'; }namespace IO{#define VOID(a) decltype(void(a))struct setting{setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;template<int I> struct P : P<I-1>{};template<> struct P<0>{};template<class T> void i(T& t){ i(t, P<3>{}); }void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});}template<class T> void o(const T& t){ o(t, P<4>{}); }template<size_t N> void o(const char (&t)[N], P<4>){ cout << t; }template<class T, size_t N> void o(const T (&t)[N], P<3>){o(t[0]); for(size_t i = 1; i < N; i++){ o(' '); o(t[i]); }}template<class T> auto o(const T& t, P<2>) -> VOID(cout << t){ cout << t; }template<class T> auto o(const T& t, P<1>) -> VOID(begin(t)){ bool first = 1; for(auto&& x : t) { if(first) first = 0; else o(' '); o(x); } }template<class T, size_t... idx> void otuple(const T& t, index_sequence<idx...>){print(get<idx>(t)...);}template<class T> auto o(T& t, P<0>) -> VOID(tuple_size<T>{}){otuple(t, make_index_sequence<tuple_size<T>::value>{});}#undef VOID}#define unpack(a) (void)initializer_list<int>{(a, 0)...}template<class... Ts> void in(Ts&... t){ unpack(IO::i(t)); }template<class T, class... Ts> void print(const T& t, const Ts&... ts){IO::o(t); unpack(IO::o((cout << ' ', ts)));}#undef unpack#ifdef DEBUGinline ll __lg(ull x){ return 63 - __builtin_clzll(x); }#define debug(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }#else#define debug(...) void(0)#endifvoid first(bool i = true){ return out(i?"first":"second"); }void First(bool i = true){ return out(i?"First":"Second"); }void Yes(bool i = true){ return out(i?"Yes":"No"); }void No(){ return out("No"); }void YES(bool i = true){ return out(i?"YES":"NO"); }void NO(){ return out("NO"); }void Yay(bool i = true){ return out(i?"Yay!":":("); }void possible(bool i = true){ return out(i?"possible":"impossible"); }void Possible(bool i = true){ return out(i?"Possible":"Impossible"); }void POSSIBLE(bool i = true){ return out(i?"POSSIBLE":"IMPOSSIBLE"); }void Case(ll i){ printf("Case #%lld: ", i); }template<class T> struct PartialSum{vector<T> data;template<class U> PartialSum(const U& v): data(v.size() + 1){for(ll i = 0; i < v.size(); i++) data[i + 1] = data[i] + v[i];}T get(ll l, ll r) const {return data[r] - data[l];}T operator[](ll at) const { return data[at]; }};int main(){LL(n,l);VEC(ll,a,n);vv(ll,b,n+1,l+1);b[n][0]=1;vector<PartialSum<ll>>s(n,vector<ll>{});rrep(n){s[i]=PartialSum<ll>{b[i+1]};rep(j,l+1)b[i][j]=s[i].get(max(0LL,j-a[i]),j+1);}LL(q);rep(q){ll L=l;LL(k);if(k>b[0][l]){out(-1);continue;}k--;vec(ll,ans,n);rep(n-1){ll ok = 0, ng = a[i]+1;auto check = [&](ll x) -> bool {return k>=s[i].get(max(0LL,L-a[i]),max(0LL,L-a[i]+x));};while(abs(ok - ng) > 1){ll cen = (ok + ng) / 2;(check(cen) ? ok : ng) = cen;}k-=s[i].get(max(0LL,L-a[i]),max(0LL,L-a[i]+ok));ans[i]=a[i]-ok;L-=a[i]-ok;}ans[n-1]=L;out(ans);}}