結果
問題 |
No.1013 〇マス進む
|
ユーザー |
|
提出日時 | 2020-04-23 12:25:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 55 ms / 2,000 ms |
コード長 | 2,923 bytes |
コンパイル時間 | 2,398 ms |
コンパイル使用メモリ | 205,016 KB |
最終ジャッジ日時 | 2025-01-09 22:45:46 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 62 |
ソースコード
#include <bits/stdc++.h> using i32 = int_fast32_t; using i64 = int_fast64_t; using u32 = uint_fast32_t; using u64 = uint_fast64_t; using f64 = double; using f80 = long double; #define FOR(v, a, b) for(i64 v = (a); v < (b); ++v) #define FORE(v, a, b) for(i64 v = (a); v <= (b); ++v) #define REP(v, n) FOR(v, 0, n) #define REPE(v, n) FORE(v, 0, n) #define REV(v, a, b) for(i64 v = (a); v >= (b); --v) #define ALL(x) (x).begin(), (x).end() #define RALL(x) (x).rbegin(), (x).rend() #define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it) #define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it) #define EXIST(c,x) ((c).find(x) != (c).end()) #define fst first #define snd second #define UNIQ(v) (v).erase(unique(ALL(v)), (v).end()) #define bit(i) (1LL<<(i)) #ifdef DEBUG #include <Mylib/Debug/debug.cpp> #else #define dump(...) ((void)0) #endif using namespace std; template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;} template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;} template <typename T> void puts_all(const T &value){std::cout << value << "\n";} template <typename T, typename ...Args> void puts_all(const T &value, const Args&... args){std::cout << value << " ";puts_all(args...);} template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);} template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);} template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);} template <typename T> auto make_vector(int n, int m, const T &value){return vector<vector<T>>(n, vector<T>(m, value));} struct Init{ Init(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(12); cerr << fixed << setprecision(12); } }init; template <typename T, typename Func> T power(T n, int64_t p, const T &e, const Func &f){ T ret = e; while(p > 0){ if(p & 1) ret = f(ret, n); n = f(n, n); p >>= 1; } return ret; } auto f(const vector<pair<i64,i64>> &a, const vector<pair<i64,i64>> &b){ const int N = a.size(); vector<pair<i64,i64>> ret(N); for(int i = 0; i < (int)N; ++i){ ret[i].first = a[b[i].first].first; ret[i].second = b[i].second + a[b[i].first].second; } return ret; } int main(){ int N, K; while(cin >> N >> K){ vector<int> P(N); cin >> P; vector<pair<i64,i64>> e(N); REP(i,N) e[i] = make_pair(i, 0); vector<pair<i64,i64>> a(N); REP(i,N){ int j = (i + P[i]) % N; a[i] = make_pair(j, j <= i); } auto res = power(a, K, e, f); vector<i64> ans(N); REP(i,N){ ans[i] = res[i].first + 1 + res[i].second * N; } join(cout, ALL(ans), "\n"); cerr << endl; } return 0; }