結果
問題 |
No.2482 Sandglasses
|
ユーザー |
![]() |
提出日時 | 2025-07-12 00:16:19 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 98 ms / 2,000 ms |
コード長 | 3,318 bytes |
コンパイル時間 | 6,342 ms |
コンパイル使用メモリ | 335,980 KB |
実行使用メモリ | 11,264 KB |
最終ジャッジ日時 | 2025-07-12 00:16:32 |
合計ジャッジ時間 | 12,671 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
//#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; using ll = long long; using ull = unsigned long long; using lll = __int128_t; using ld = long double; using pll = pair<ll, ll>; using vi = vector<ll>; using vd = vector<ld>; using vp = vector<pll>; using vS = vector<string>; using vvi = vector<vi>; using vvd = vector<vd>; using vvp = vector<vp>; using v3i = vector<vvi>; using v3d = vector<vvd>; using v3p = vector<vvp>; using v4i = vector<v3i>; using v5i = vector<v4i>; using v6i = vector<v5i>; #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; using mint = modint998244353; using Mint = modint1000000007; using vm = vector<mint>; using vM = vector<Mint>; using vvm = vector<vm>; using vvM = vector<vM>; using v3m = vector<vvm>; using v3M = vector<vvM>; using v4m = vector<v3m>; using v5m = vector<v4m>; #endif template <typename T> using r_pQ = priority_queue<T, vector<T>, greater<T>>; #define rrep(i, n) for (ll i = (n)-1; (i) >= 0; --(i)) #define rep(i, n) for (ll i = 0; (i) < (n); ++(i)) #define loop(i, a) for(ll i = a; true; ++(i)) #define reps(i, n) for (ll i = 1; (i) <= (n); ++(i)) #define Rep(i,a,b) for(ll i = (a); i <= (b); i++) #define all(a) (a).begin(),(a).end() const ll MOD = 998244353; const ll Hash = 10000000000000061; #define Yes(b) ((b)?cout << "Yes" << endl:cout << "No" << endl) #define YES(b) ((b)?cout << "YES" << endl:cout << "NO" << endl) #define Aoki(b) ((b)?cout << "Aoki" << endl:cout << "Takahashi" << endl) #define out(x) cout << (x) << endl #define vout(v) for(auto x : (v)) cout << x << ' '; #define vin(v) rep(i, (v).size()) cin >> (v)[i] #define vin_(v); rep(i, (v).size()) {cin >> (v)[i]; (v)[i]--;} #define vvin(v, w) rep(i, (v).size()) { rep(k, (w)) { cin >> (v)[i][k]; } } #define ft first #define sd second #define vInP(v) rep(i, (v).size()) cin >> (v)[i].ft >> (v)[i].sd #define vInP_(v) rep(i, (v).size()) {cin >> (v)[i].ft >> (v)[i].sd; (v)[i].ft--; (v)[i].sd--;} bool chmin(ll& a, ll b) { return a > b ? a = b, 1 : 0; } bool chmax(ll& a, ll b) { return a < b ? a = b, 1 : 0; } vi s90 = { 0, 1, 0, -1 }, c90 = { 1, 0, -1, 0 }; vi s45 = { 0, 1, 1, 1, 0, -1, -1, -1 }, c45 = { 1, 1, 0, -1, -1, -1, 0, 1 }; void solve(); signed main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); int t = 1; // cin >> t; rep(i, t) solve(); } void solve(){ ll N, K, T; cin >> N >> K >> T; T %= (K * 2); vector<bool> a(N, 0); vector<ll> b(N); rep(i, N){ char c; cin >> c; if(c == 'A') a[i] = 1; } rep(i, N) cin >> b[i]; vector<pll> vec(N); rep(i, N){ vec[i] = {b[i], i}; } sort(all(vec)); vector<ll> w(N); rep(i, N){ if(a[i]){ if(T <= b[i]) w[i] = b[i] - T; else if(T <= b[i] + K) w[i] = T - b[i]; else w[i] = b[i] + (K*2-T); }else{ if(T + b[i] <= K) w[i] = b[i]+T; else if(T + b[i] <= K * 2) w[i] = K * 2 - T - b[i]; else w[i] = T + b[i] - K * 2; } } sort(all(w)); vector<ll> ans(N); rep(i, N){ ans[vec[i].second] = w[i]; } rep(i, N-1){ cout << ans[i] << " "; } cout << ans.back() << endl; }