Submission #2233213

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>     //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>        //do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int mod=1000000007;

int main(){
	int n,m,d;
	int one[100100]={},r[2][100100]={};
	cin>>n>>m>>d;
	FORQ(i,1,n)r[0][i]=i;
	FOR(i,0,m){
		int a;
		cin>>a;
		swap(r[0][a],r[0][a+1]);
	}
	FORQ(i,1,n)one[r[0][i]]=i;
	//FORQ(i,1,n)cout<<r[i]<<endl;
	int t=0,idx=0;
	FORQ(ii,1,n){
		int i=ii;
		while(1){
			i=one[i];
			t++;
			//idx^=1;
			int f=1;
			if(ii!=i)f=0;
			if(f){
				d=d%t;
				break;
			}
		}
		i=ii;
		FOR(j,0,d){
			i=one[i];
		}
		cout<<i<<endl;
	}
    return 0;
}

Submission Info

Judge Result