Submission #1633067

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
using namespace std;
typedef long long LL;
const int N=2e5;
int gi() {
	int w=0;bool q=1;char c=getchar();
	while ((c<'0'||c>'9') && c!='-') c=getchar();
	if (c=='-') q=0,c=getchar();
	while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar();
	return q? w:-w;
}
int d[N],p[N],to[N],x[N];
int n;
inline void mul(int *a,int *b) {
	for (int i=1;i<n;i++) x[i]=a[b[i]];
	for (int i=1;i<n;i++) a[i]=x[i];
}
int main()
{
	n=gi();int i,a,b,m,S=gi();LL k;
	for (i=1,a=S;i<n;i++)
		b=gi(),d[i]=b-a,a=b;
	
	for (i=1;i<n;i++) p[i]=to[i]=i;
	for (i=1,m=gi(),cin>>k;i<=m;i++)
		a=gi(),swap(p[a-1],p[a]);
	while (k) {
		if (k&1) mul(to,p);
		mul(p,p);k>>=1;
	}
	for (i=1;i<=n;i++) printf("%d.0\n",S),S+=d[to[i]];
	return 0;
}

Submission Info

Judge Result