結果

問題 No.1013 〇マス進む
ユーザー ningenMeningenMe
提出日時 2020-04-25 03:05:25
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 230 ms / 2,000 ms
コード長 3,220 bytes
コンパイル時間 1,682 ms
コンパイル使用メモリ 174,984 KB
実行使用メモリ 56,832 KB
最終ジャッジ日時 2024-10-15 15:56:01
合計ジャッジ時間 12,124 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 3 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 AC 3 ms
5,248 KB
testcase_08 AC 2 ms
5,248 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 3 ms
5,248 KB
testcase_11 AC 3 ms
5,248 KB
testcase_12 AC 4 ms
5,248 KB
testcase_13 AC 9 ms
5,248 KB
testcase_14 AC 97 ms
28,672 KB
testcase_15 AC 158 ms
44,672 KB
testcase_16 AC 146 ms
41,088 KB
testcase_17 AC 84 ms
25,600 KB
testcase_18 AC 101 ms
30,592 KB
testcase_19 AC 62 ms
19,328 KB
testcase_20 AC 189 ms
53,888 KB
testcase_21 AC 76 ms
23,680 KB
testcase_22 AC 110 ms
31,488 KB
testcase_23 AC 36 ms
12,288 KB
testcase_24 AC 191 ms
55,808 KB
testcase_25 AC 194 ms
54,528 KB
testcase_26 AC 33 ms
12,416 KB
testcase_27 AC 71 ms
22,656 KB
testcase_28 AC 36 ms
12,416 KB
testcase_29 AC 185 ms
52,864 KB
testcase_30 AC 65 ms
20,352 KB
testcase_31 AC 119 ms
36,224 KB
testcase_32 AC 88 ms
27,776 KB
testcase_33 AC 94 ms
27,776 KB
testcase_34 AC 154 ms
42,240 KB
testcase_35 AC 163 ms
40,064 KB
testcase_36 AC 12 ms
5,760 KB
testcase_37 AC 10 ms
5,632 KB
testcase_38 AC 175 ms
46,336 KB
testcase_39 AC 54 ms
17,024 KB
testcase_40 AC 183 ms
41,984 KB
testcase_41 AC 39 ms
12,672 KB
testcase_42 AC 87 ms
26,752 KB
testcase_43 AC 57 ms
18,176 KB
testcase_44 AC 101 ms
28,032 KB
testcase_45 AC 85 ms
24,960 KB
testcase_46 AC 43 ms
13,440 KB
testcase_47 AC 87 ms
26,496 KB
testcase_48 AC 110 ms
30,720 KB
testcase_49 AC 165 ms
41,856 KB
testcase_50 AC 128 ms
36,096 KB
testcase_51 AC 122 ms
32,768 KB
testcase_52 AC 25 ms
8,960 KB
testcase_53 AC 33 ms
11,520 KB
testcase_54 AC 145 ms
39,808 KB
testcase_55 AC 47 ms
13,952 KB
testcase_56 AC 189 ms
49,792 KB
testcase_57 AC 144 ms
34,688 KB
testcase_58 AC 230 ms
56,832 KB
testcase_59 AC 220 ms
56,832 KB
testcase_60 AC 213 ms
56,704 KB
testcase_61 AC 196 ms
56,832 KB
testcase_62 AC 201 ms
56,704 KB
testcase_63 AC 2 ms
5,248 KB
testcase_64 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    int N,K; cin >> N >> K;
    vector<int> P(N);
    for(int i = 0; i < N; ++i){
        cin >> P[i];
    }
    auto A = multivector(33,N,make_pair(0,0LL));
    for(int i = 0; i < N; ++i) A[0][i] = {(P[i]+i)%N,P[i]};
    for(int i = 1; i < 33; ++i) {
        for(int j = 0; j < N; ++j) {
            int k = A[i-1][j].first;
            ll x = A[i-1][j].second;
            A[i][j] = {A[i-1][k].first,A[i-1][k].second+x};
        }
    }
    for(int i = 0; i < N; ++i) {
        int idx = i;
        ll sum = 0;
        for(int j = 31; 0 <= j ; --j) if(K&(1LL<<j)) {
            sum += A[j][idx].second;
            idx = A[j][idx].first;
        }
        cout << sum+i+1 << endl;
    }
    return 0;
}
0