結果

問題 No.1013 〇マス進む
ユーザー haruki_Kharuki_K
提出日時 2020-03-20 22:00:53
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 135 ms / 2,000 ms
コード長 4,355 bytes
コンパイル時間 2,017 ms
コンパイル使用メモリ 171,240 KB
実行使用メモリ 30,644 KB
最終ジャッジ日時 2023-08-21 16:34:17
合計ジャッジ時間 9,274 ms
ジャッジサーバーID
(参考情報)
judge12 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,384 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 3 ms
4,380 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 4 ms
4,380 KB
testcase_14 AC 41 ms
16,268 KB
testcase_15 AC 70 ms
24,368 KB
testcase_16 AC 63 ms
22,572 KB
testcase_17 AC 36 ms
14,652 KB
testcase_18 AC 48 ms
17,028 KB
testcase_19 AC 27 ms
11,516 KB
testcase_20 AC 85 ms
29,204 KB
testcase_21 AC 33 ms
13,540 KB
testcase_22 AC 48 ms
17,584 KB
testcase_23 AC 15 ms
7,840 KB
testcase_24 AC 85 ms
29,964 KB
testcase_25 AC 83 ms
29,632 KB
testcase_26 AC 16 ms
7,776 KB
testcase_27 AC 30 ms
13,028 KB
testcase_28 AC 15 ms
7,744 KB
testcase_29 AC 79 ms
28,648 KB
testcase_30 AC 31 ms
11,932 KB
testcase_31 AC 55 ms
19,980 KB
testcase_32 AC 37 ms
15,704 KB
testcase_33 AC 46 ms
15,744 KB
testcase_34 AC 79 ms
23,024 KB
testcase_35 AC 84 ms
22,088 KB
testcase_36 AC 7 ms
4,392 KB
testcase_37 AC 6 ms
4,388 KB
testcase_38 AC 81 ms
25,220 KB
testcase_39 AC 30 ms
10,176 KB
testcase_40 AC 97 ms
22,864 KB
testcase_41 AC 22 ms
8,076 KB
testcase_42 AC 51 ms
15,212 KB
testcase_43 AC 31 ms
10,708 KB
testcase_44 AC 49 ms
15,712 KB
testcase_45 AC 45 ms
14,076 KB
testcase_46 AC 23 ms
8,280 KB
testcase_47 AC 44 ms
15,124 KB
testcase_48 AC 53 ms
17,236 KB
testcase_49 AC 98 ms
22,836 KB
testcase_50 AC 68 ms
19,968 KB
testcase_51 AC 60 ms
18,000 KB
testcase_52 AC 14 ms
5,884 KB
testcase_53 AC 18 ms
7,232 KB
testcase_54 AC 70 ms
21,728 KB
testcase_55 AC 27 ms
8,620 KB
testcase_56 AC 109 ms
26,840 KB
testcase_57 AC 79 ms
19,436 KB
testcase_58 AC 135 ms
30,636 KB
testcase_59 AC 131 ms
30,612 KB
testcase_60 AC 108 ms
30,644 KB
testcase_61 AC 79 ms
30,448 KB
testcase_62 AC 73 ms
30,488 KB
testcase_63 AC 2 ms
4,380 KB
testcase_64 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<

int32_t main() {
    int n,k; cin >> n >> k;
    vector<int> p(n); cin >> p;

    const int LG = 33;
    auto dp = make_v<int,2>(LG,n);
    rep (i,n) dp[0][i] = p[i];
    rep (j,LG-1) rep (i,n) {
        int pos = i+dp[j][i];
        int idx = pos%n;
        dp[j+1][i] = dp[j][i] + dp[j][idx];
    }

    rep (i,n) {
        int pos = i;
        for (int kk = k, j = 0; kk; kk >>= 1, j++) {
            if (kk&1) pos += dp[j][pos%n];
        }
        cout << pos+1 << "\n";
    }
}
0