Submission #1353610

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N;
	cin >> N;
	vector<int> X(N);
	for(int i=0;i<N;++i){
		cin >> X[i];
	}
	vector<int> D(N-1);//元
	for(int i=0;i<N-1;++i){
		D[i] = X[i+1]-X[i];
	}
	LL M,K;
	cin >> M >> K;
	vector< vector<int> > dp(64,vector<int>(N-1));
	for(int i=0;i<N-1;++i){
		dp[0][i] = i;
	}
	dp[1] = dp[0];
	
	for(int i=0;i<M;++i){
		int A;
		cin >> A;
		swap(dp[1][A-2], dp[1][A-1]);
	}

	for(int k=2;k<64;++k){//ダブリング
		//dp[k-1]からdp[k]を作る
		for(int i=0;i<N-1;++i){
			int pos1 = dp[k-1][i];//pos1->i
			int pos2 = dp[k-1][pos1];//pos2->pos1
			dp[k][pos2] = i;//pos2->i
		}
	}
	LL num = K;
	int pow = 1;
	vector<int> ans = dp[0];
	while(num){
		if(num&1){
			vector<int> temp = ans;
			for(int i=0;i<N-1;++i){
				int pos1 = dp[pow][ i ];//pos1->i
				temp[i] = ans[pos1];
			}
			ans = temp;
		}
		num >>=1;
		++pow;
	}
	LL now = X[0];
	cout << now << endl;
	for(int i=0;i<N-1;++i){
		now += D[ ans[i] ];
		cout << now << endl;
	}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Judge Result