【模拟赛】2021.8.16.B

题目描述

一个长为10的从0到9的排列，和n个操作，每个操作有x,y，表示交换第x个数和第y个数，有m个询问，每个询问有x,y，表示进行从x到y的所有操作后，这个排列的顺序

思路

见下

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;

int F[100250][15], A[15], b[100250];
int n, m, l, r;

inline int read()
{
	int x = 0, r = 1; char c = getchar();
	while(c < '0' || c > '9'){if(c == '-')r = -1;c = getchar();}
	while('0' <= c && c <= '9')x = x * 10 + c - 48, c = getchar();
	return x * r;
}

void write(int k)
{if(k > 9)write(k / 10); putchar(k % 10 + '0');}

int main()
{
	n = read(), m = read();
	for(int i = 0; i <= 9; ++i)
		A[i] = i, F[0][i] = i;
	for(int i = 1; i <= n; ++i)
	{
		l = read(), r = read();
		swap(A[l], A[r]);
		for(int j = 0; j <= 9; j++)
			F[i][j] = A[j];//记录每次交换的排列顺序
	}
	for(int i = 1; i <= m; ++i)
	{
		l = read(), r = read();
		for(int j = 0; j <= 9; ++j)
			b[F[l - 1][j]] = j;//记录第l-1的操作的顺序
		for(int j = 0; j <= 9; ++j)
			write(b[F[r][j]]), putchar(' ');//比较玄学...
		putchar('\n');
	}
	return 0;
}