Submission #1408203

---

Source Code Expand

#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<random>
#include<unordered_set>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const llint mod=1000000007;
const llint big=1e17-10;
const long double pai=3.141592653589793238462643383279;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
int main(void){
	llint i,j,n,m;cin>>n;
	llint k;
	vector<llint>sa(n);
	vector<llint>go(n);
	vector<llint>ans(n);
	for(j=0;j<n;j++){go[j]=j;ans[j]=j;}
	llint mae=0;
	for(i=0;i<n;i++){llint now;cin>>now;sa[i]=now-mae;mae=now;}
	cin>>m>>k;
	for(i=0;i<m;i++){llint q;cin>>q;swap(go[q],go[q-1]);}
	vector<llint> iti(n);
	for(i=0;i<61;i++){
		if((k&(((llint)1)<<(llint)i))!=0){for(j=0;j<n;j++){ans[j]=go[ans[j]];}}
		for(j=0;j<n;j++){iti[j]=go[go[j]];}
		swap(iti,go);
	}
	ans[0]=sa[0];
	for(j=1;j<n;j++){ans[j]=sa[ans[j]]+ans[j-1];}//どうせans[0]=go[0]だし
	for(j=0;j<n;j++){cout<<ans[j]<<endl;}
	return 0;
}

Submission Info

Judge Result