結果

問題 No.1013 〇マス進む
ユーザー Shuz*Shuz*
提出日時 2020-03-20 23:14:13
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 81 ms / 2,000 ms
コード長 4,787 bytes
コンパイル時間 1,678 ms
コンパイル使用メモリ 166,736 KB
実行使用メモリ 74,116 KB
最終ジャッジ日時 2023-08-21 22:11:52
合計ジャッジ時間 7,664 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 2 ms
4,384 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
5,756 KB
testcase_14 AC 25 ms
36,016 KB
testcase_15 AC 46 ms
56,024 KB
testcase_16 AC 36 ms
52,452 KB
testcase_17 AC 23 ms
31,928 KB
testcase_18 AC 29 ms
38,996 KB
testcase_19 AC 16 ms
26,068 KB
testcase_20 AC 53 ms
67,308 KB
testcase_21 AC 20 ms
30,696 KB
testcase_22 AC 30 ms
40,328 KB
testcase_23 AC 10 ms
16,288 KB
testcase_24 AC 51 ms
70,596 KB
testcase_25 AC 50 ms
67,996 KB
testcase_26 AC 11 ms
15,936 KB
testcase_27 AC 19 ms
29,824 KB
testcase_28 AC 10 ms
16,492 KB
testcase_29 AC 47 ms
66,392 KB
testcase_30 AC 18 ms
28,084 KB
testcase_31 AC 33 ms
46,796 KB
testcase_32 AC 23 ms
36,988 KB
testcase_33 AC 27 ms
35,036 KB
testcase_34 AC 46 ms
53,852 KB
testcase_35 AC 54 ms
49,032 KB
testcase_36 AC 5 ms
7,072 KB
testcase_37 AC 4 ms
6,364 KB
testcase_38 AC 52 ms
57,904 KB
testcase_39 AC 17 ms
22,936 KB
testcase_40 AC 65 ms
51,908 KB
testcase_41 AC 13 ms
16,144 KB
testcase_42 AC 28 ms
33,120 KB
testcase_43 AC 19 ms
24,228 KB
testcase_44 AC 28 ms
35,900 KB
testcase_45 AC 23 ms
33,232 KB
testcase_46 AC 14 ms
17,492 KB
testcase_47 AC 25 ms
34,752 KB
testcase_48 AC 30 ms
40,856 KB
testcase_49 AC 59 ms
52,132 KB
testcase_50 AC 41 ms
47,404 KB
testcase_51 AC 39 ms
42,784 KB
testcase_52 AC 9 ms
11,292 KB
testcase_53 AC 11 ms
14,688 KB
testcase_54 AC 40 ms
48,968 KB
testcase_55 AC 16 ms
18,044 KB
testcase_56 AC 61 ms
63,152 KB
testcase_57 AC 53 ms
44,484 KB
testcase_58 AC 81 ms
70,068 KB
testcase_59 AC 69 ms
72,092 KB
testcase_60 AC 70 ms
69,512 KB
testcase_61 AC 51 ms
74,116 KB
testcase_62 AC 50 ms
69,608 KB
testcase_63 AC 2 ms
4,380 KB
testcase_64 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...)                                                         \
    ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...)                                                        \
    ([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << rt;                                                            \
    }

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                        \
        rep(_i, h) {                                                           \
            rep(_j, w) cerr << a[_i][_j] << sp;                                \
            cerr << rt;                                                        \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(_i, n) if (_i) cerr << sp << a[_i];                                \
        else cerr << a[_i];                                                    \
        cerr << "]" << rt;                                                     \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
    return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

signed main() {
    ll N, K;
    cin >> N >> K;
    ll A[N], next[50][N], rap[50][N];
    rep(i, N) {
        cin >> A[i];
        next[0][i] = (i + A[i]) % N + 1;
        rap[0][i] = i + 1 + A[i] > N;
    }
    rep(i, 40) rep(j, N) {
        next[i + 1][j] = next[i][next[i][j] - 1];
        rap[i + 1][j] = rap[i][j] + rap[i][next[i][j] - 1];
    }
    rep(i, N) {
        ll t = i + 1, r = 0;
        dec(j, 40, 0) {
            if ((1LL << j) & K) {
                r += rap[j][t - 1];
                t = next[j][t - 1];
            }
        }
        cout << t + r * N << rt;
    }
}

// -g -D_GLIBCXX_DEBUG -fsanitize=undefined
0