結果
問題 |
No.2482 Sandglasses
|
ユーザー |
![]() |
提出日時 | 2025-07-15 18:07:02 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 149 ms / 2,000 ms |
コード長 | 2,766 bytes |
コンパイル時間 | 6,743 ms |
コンパイル使用メモリ | 333,008 KB |
実行使用メモリ | 9,432 KB |
最終ジャッジ日時 | 2025-07-15 18:07:16 |
合計ジャッジ時間 | 13,319 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
#include <bits/stdc++.h> using namespace std; template<class T> bool chmin(T& a, T b) { return a > b ? a = b, true : false; } template<class T> bool chmax(T& a, T b) { return a < b ? a = b, true : false; } template<typename T> concept Iterable = requires(T t) { std::begin(t); std::end(t); }; template<typename T> requires Iterable<T> && (!is_same_v<T, string>) ostream& operator<<(ostream& os, const T& container) { for (auto& element : container) os << element << ' '; return os; } template<typename R> requires ranges::range<R> && (!is_same_v<decay_t<R>, string>) && (!is_same_v<decay_t<R>, const char*>) ostream& operator<<(ostream& os, R&& range) { for (auto& element : range)os << element << ' '; return os; } template<typename T> requires Iterable<T> && (!is_same_v<T, string>) istream& operator>>(std::istream& is, T& container) { for (auto& e : container)is >> e; return is; } using ll = long long; using ull = unsigned long long; using uint = unsigned int; template<class T = ll> struct Edge { int to; T weight; bool operator==(Edge e) { return this->to == e.to and this->weight == e.weight; } bool operator<(Edge e) { return this->to == e.to ? this->weight < e.weight : this->to < e.to; } }; #ifdef _DEBUG #define SHOW(n) {const auto& _ret = n; cerr << #n << ": " << _ret << endl;} #define MSG(x) cerr << x << endl; #else #define SHOW(n) #define MSG(x) #endif //AtCoder Library #include <atcoder/all> using namespace atcoder; //using mint = modint998244353; using mint = modint1000000007; //using mint1 = dynamic_modint<0>; //using mint = modint; //mint::set_mod(); istream& operator>>(istream& is, mint& x) { ll r; is >> r; x = r; return is; } ostream& operator<<(ostream& os, mint& x) { os << x.val(); return os; } //boost //#include <boost/multiprecision/cpp_int.hpp> //using namespace boost::multiprecision; //using l3 = int128_t; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n, k, t; cin >> n >> k >> t; vector<char> a(n); vector<ll> b(n); cin >> a >> b; vector<int> ord(n); { auto v = b; ranges::sort(v); for (int i = 0; i < n; ++i) { ord[i] = ranges::lower_bound(v, b[i]) - v.begin(); } } vector<ll> res; // tの残り、今の砂の量 auto sim = [&](auto&& f, char c, ll rem, ll cur)->ll { if (c == 'A') { ll mi = min(cur, rem); cur -= mi; rem -= mi; if (rem == 0)return cur; return f(f, 'B', rem, cur); } else { ll pl = min(k - cur, rem); cur += pl; rem -= pl; if (rem == 0)return cur; return f(f, 'A', rem, cur); } }; t %= 2 * k; for (int i = 0; i < n; ++i) { b[i] %= 2 * k; res.push_back(sim(sim, a[i], t, b[i])); } ranges::sort(res); for (int i = 0; i < n; ++i) { cout << res[ord[i]] << " "; } cout << endl; return 0; }