#969970 (C++23) No.2716 Falcon Method

提出ソース

結果

問題	No.2716 Falcon Method
ユーザー	coindarw
提出日時	2024-04-05 22:49:34
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	142 ms / 2,000 ms
コード長	6,426 bytes
コンパイル時間	5,124 ms
コンパイル使用メモリ	313,764 KB
実行使用メモリ	7,936 KB
最終ジャッジ日時	2024-04-05 22:49:43
合計ジャッジ時間	8,575 ms
ジャッジサーバーID （参考情報）	judge14 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	2 ms 6,676 KB
testcase_03	AC	2 ms 6,676 KB
testcase_04	AC	2 ms 6,676 KB
testcase_05	AC	1 ms 6,676 KB
testcase_06	AC	2 ms 6,676 KB
testcase_07	AC	3 ms 6,676 KB
testcase_08	AC	3 ms 6,676 KB
testcase_09	AC	3 ms 6,676 KB
testcase_10	AC	3 ms 6,676 KB
testcase_11	AC	131 ms 7,680 KB
testcase_12	AC	97 ms 7,424 KB
testcase_13	AC	76 ms 7,296 KB
testcase_14	AC	118 ms 7,040 KB
testcase_15	AC	85 ms 7,168 KB
testcase_16	AC	103 ms 6,912 KB
testcase_17	AC	119 ms 7,168 KB
testcase_18	AC	142 ms 7,552 KB
testcase_19	AC	103 ms 6,912 KB
testcase_20	AC	82 ms 7,168 KB
testcase_21	AC	107 ms 7,040 KB
testcase_22	AC	113 ms 7,936 KB
testcase_23	AC	118 ms 7,936 KB
testcase_24	AC	120 ms 7,936 KB
testcase_25	AC	3 ms 6,676 KB
testcase_26	AC	2 ms 6,676 KB
testcase_27	AC	110 ms 7,936 KB
testcase_28	AC	111 ms 7,936 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>

#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif

using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;

// clang-format off
#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}

template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }

template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}

inline string YESNO(bool cond) { return cond ? "YES" : "NO"; }inline string yesno(bool cond) { return cond ? "yes" : "no"; }inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif

#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, q;
    inp(n, q);
    string s;
    inp(s);
    using T = tuple<int, int, int>;
    vector<T> querys(q);
    rep(i, q) {
        int h, w, p;
        inp(h, w, p);
        querys[i] = {h, w, p};
    }

    vector<int> cd(2 * n + 1), cr(2 * n + 1);
    rep(i, n) {
        cd[i + 1] = (s[i] == 'D');
        cr[i + 1] = (s[i] == 'R');
    }
    rep(i, n) {
        cd[i + n + 1] = cd[i + 1];
        cr[i + n + 1] = cr[i + 1];
    }
    reps(i, 2 * n) {
        cd[i] += cd[i - 1];
        cr[i] += cr[i - 1];
    }

    ll dNum = 0, rNum = 0;
    dNum = cd[n];
    rNum = cr[n];

    debug(cd);
    debug(cr);
    debug(dNum, rNum);
    for (auto [h, w, p] : querys) {
        auto bsearch = [&](auto cmp) {
            ll ok = inf, ng = -1;
            while (abs(ng - ok) > 1) {
                ll mid = (ng + ok) / 2;
                if (cmp(mid)) ok = mid;
                else ng = mid;
            }
            return ok;
        };
        auto cmp = [&](ll cnt) -> bool {
            ll loop = cnt / n;
            ll dcnt = cnt % n;
            // 一番下に辿り着いているか判定
            ll dx = loop * dNum + cd.at(p + dcnt) - cd.at(p);
            ll dr = loop * rNum + cr.at(p + dcnt) - cr.at(p);
            if (dx >= h) return true;
            if (dr >= w) return true;
            return false;
        };
        ll ans = bsearch(cmp);
        oup((p + ans) % n);
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード