結果

問題 No.2716 Falcon Method
ユーザー 👑 binap
提出日時 2024-04-05 22:35:55
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 2,106 bytes
コンパイル時間 4,490 ms
コンパイル使用メモリ 252,532 KB
最終ジャッジ日時 2025-02-20 21:49:01
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 16 RE * 12
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;
ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return 
    os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); 
    return os;}
template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}
int main(){
    int n, q;
    cin >> n >> q;
    string s;
    cin >> s;
    vector<int> r(n + 1);
    vector<int> d(n + 1);
    rep(i, n){
        r[i + 1] = r[i];
        d[i + 1] = d[i];
        if(s[i] == 'R') r[i + 1]++;
        if(s[i] == 'D') d[i + 1]++;
    }
    auto calc = [&](int p, int q){
        int r_cnt = 0, d_cnt = 0;
        r_cnt += r[(p + q) % n] + r[n] * ((p + q) / n);
        r_cnt -= r[p % n] + r[n] * (p / n);
        d_cnt += d[(p + q) % n] + d[n] * ((p + q) / n);
        d_cnt -= d[p % n] + d[n] * (p / n);
        return make_pair(r_cnt, d_cnt);
    };
    rep(_, q){
        int h, w, p;
        cin >> h >> w >> p;
        int ok = 0, ng = 2002002002;
        while(ng - ok > 1){
            int mid = (ng + ok) / 2;
            auto [r_cnt, d_cnt] = calc(p, mid);
            if(r_cnt < w and d_cnt < h) ok = mid;
            else ng = mid;
        }
        p += ng;
        p %= n;
        cout << p << "\n";
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0