結果

問題 No.1013 〇マス進む
ユーザー 👑 hitonanodehitonanode
提出日時 2020-03-20 21:46:22
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 135 ms / 2,000 ms
コード長 4,988 bytes
コンパイル時間 1,615 ms
コンパイル使用メモリ 173,264 KB
実行使用メモリ 28,628 KB
最終ジャッジ日時 2023-08-21 16:02:21
合計ジャッジ時間 9,346 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 3 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 3 ms
4,376 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 4 ms
4,376 KB
testcase_14 AC 38 ms
15,120 KB
testcase_15 AC 69 ms
22,796 KB
testcase_16 AC 60 ms
20,940 KB
testcase_17 AC 35 ms
13,588 KB
testcase_18 AC 46 ms
15,980 KB
testcase_19 AC 26 ms
10,960 KB
testcase_20 AC 81 ms
27,360 KB
testcase_21 AC 31 ms
12,752 KB
testcase_22 AC 46 ms
16,500 KB
testcase_23 AC 15 ms
7,596 KB
testcase_24 AC 81 ms
28,104 KB
testcase_25 AC 81 ms
27,596 KB
testcase_26 AC 16 ms
7,524 KB
testcase_27 AC 28 ms
12,308 KB
testcase_28 AC 15 ms
7,544 KB
testcase_29 AC 77 ms
26,736 KB
testcase_30 AC 30 ms
11,212 KB
testcase_31 AC 51 ms
18,872 KB
testcase_32 AC 35 ms
14,588 KB
testcase_33 AC 44 ms
14,680 KB
testcase_34 AC 77 ms
21,464 KB
testcase_35 AC 82 ms
20,416 KB
testcase_36 AC 6 ms
4,384 KB
testcase_37 AC 6 ms
4,380 KB
testcase_38 AC 85 ms
23,764 KB
testcase_39 AC 31 ms
9,640 KB
testcase_40 AC 94 ms
21,476 KB
testcase_41 AC 22 ms
7,528 KB
testcase_42 AC 50 ms
14,072 KB
testcase_43 AC 30 ms
10,136 KB
testcase_44 AC 49 ms
14,964 KB
testcase_45 AC 44 ms
13,276 KB
testcase_46 AC 23 ms
8,004 KB
testcase_47 AC 43 ms
14,196 KB
testcase_48 AC 51 ms
16,228 KB
testcase_49 AC 97 ms
21,512 KB
testcase_50 AC 65 ms
18,808 KB
testcase_51 AC 58 ms
17,004 KB
testcase_52 AC 14 ms
5,684 KB
testcase_53 AC 18 ms
6,932 KB
testcase_54 AC 68 ms
20,468 KB
testcase_55 AC 26 ms
8,252 KB
testcase_56 AC 105 ms
25,280 KB
testcase_57 AC 76 ms
18,040 KB
testcase_58 AC 135 ms
28,600 KB
testcase_59 AC 126 ms
28,576 KB
testcase_60 AC 104 ms
28,600 KB
testcase_61 AC 75 ms
28,588 KB
testcase_62 AC 69 ms
28,628 KB
testcase_63 AC 2 ms
4,380 KB
testcase_64 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

// Binary lifting / `Doubling`
// Complexity: O(NlogN) precalculation / O(logN) per query
// <https://atcoder.jp/contests/arc060/submissions/7039451>
struct BinaryLifting
{
    int N, INVALID, lgD;
    std::vector<std::vector<lint>> mat;
    BinaryLifting() : N(0), lgD(0) {}
    BinaryLifting(const std::vector<lint> &vec_nxt, int INVALID = -1, int lgd = 0) : N(vec_nxt.size()), INVALID(INVALID), lgD(lgd)
    {
        while ((1LL << lgD) < N) lgD++;
        mat.assign(lgD, std::vector<lint>(N, INVALID));
        mat[0] = vec_nxt;
        for (int d = 0; d < lgD - 1; d++) {
            for (int i = 0; i < N; i++) if (mat[d][i] != INVALID) mat[d + 1][i] = mat[d][mat[d][i] % N] + mat[d][i] / N * N;
        }
    }
    lint kth_next(lint now, lint k)
    {
        if (k >= (1 << lgD)) exit(8);
        for (lint d = 0; k and now != INVALID; d++, k >>= 1) if (k & 1) now = mat[d][now % N] + now / N * N;
        return now;
    }

    // Distance from l to [r, \infty)
    // Requirement: mat[0][i] > i for all i (monotone increasing)
    int distance(int l, int r)
    {
        if (l >= r) return 0;
        int ret = 0;
        for (int d = lgD - 1; d >= 0; d--) {
            if (mat[d][l] < r and mat[d][l] != INVALID) ret += 1 << d, l = mat[d][l];
        }
        if (mat[0][l] == INVALID or mat[0][l] >= r) return ret + 1;
        else return -1; // Unable to reach
    }
};

int main()
{
    int N, K;
    cin >> N >> K;
    vector<int> P(N);
    cin >> P;
    vector<lint> nxt(N);
    REP(i, N) nxt[i] = i + P[i];
    BinaryLifting bl(nxt, -1, 30);
    REP(i, N) printf("%lld\n", bl.kth_next(i, K) + 1);
}
0