結果

問題 No.2716 Falcon Method
コンテスト
ユーザー AngrySadEight
提出日時 2024-04-05 22:53:42
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 310 ms / 2,000 ms
コード長 4,907 bytes
コンパイル時間 19,719 ms
コンパイル使用メモリ 261,692 KB
最終ジャッジ日時 2025-02-20 21:54:54
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}
int main() {
    ll N, Q;
    cin >> N >> Q;
    string S;
    cin >> S;
    vector<ll> H(Q);
    vector<ll> W(Q);
    vector<ll> P(Q);
    for (ll i = 0; i < Q; i++) {
        cin >> H[i] >> W[i] >> P[i];
    }
    ll one_loop_h = 0;
    ll one_loop_w = 0;
    for (ll i = 0; i < N; i++) {
        if (S[i] == 'D') {
            one_loop_h++;
        } else {
            one_loop_w++;
        }
    }
    vector<ll> hidx(one_loop_h);
    vector<ll> widx(one_loop_w);
    ll now_h = 0;
    ll now_w = 0;
    for (ll i = 0; i < N; i++) {
        if (S[i] == 'D') {
            hidx[now_h] = i;
            now_h++;
        } else {
            widx[now_w] = i;
            now_w++;
        }
    }
    ll INF = 1000000000000000023;
    for (ll i = 0; i < Q; i++) {
        // h のほうの回数は？
        ll times_h = INF;
        ll goal_h = -1;
        if (one_loop_h > 0) {
            H[i]--;
            ll div = H[i] / one_loop_h;
            ll rem = H[i] % one_loop_h;
            auto itr = lower_bound(all(hidx), P[i]);
            ll fst_idx;
            if (itr == hidx.end()) {
                fst_idx = 0;
            } else {
                fst_idx = itr - hidx.begin();
            }
            times_h = (hidx[fst_idx] + N - P[i]) % N;
            times_h +=
                div * N +
                (hidx[(fst_idx + rem) % one_loop_h] + N - hidx[fst_idx]) % N;
            goal_h = hidx[(fst_idx + rem) % one_loop_h];
        }
        ll times_w = INF;
        ll goal_w = -1;
        if (one_loop_w > 0) {
            W[i]--;
            ll div = W[i] / one_loop_w;
            ll rem = W[i] % one_loop_w;
            auto itr = lower_bound(all(widx), P[i]);
            ll fst_idx;
            if (itr == widx.end()) {
                fst_idx = 0;
            } else {
                fst_idx = itr - widx.begin();
            }
            times_w = (widx[fst_idx] + N - P[i]) % N;
            times_w +=
                div * N +
                (widx[(fst_idx + rem) % one_loop_w] + N - widx[fst_idx]) % N;
            goal_w = widx[(fst_idx + rem) % one_loop_w];
        }
        // debug_out(times_h, times_w, goal_h, goal_w);
        if (times_h > times_w) {
            cout << (goal_w + 1) % N << endl;
        } else {
            cout << (goal_h + 1) % N << endl;
        }
    }
}
0