2020牛客暑期多校训练营（第十场）解题报告（更新中）

2020牛客暑期多校训练营（第十场）

A:Permutation

直接暴力模拟就好了

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)	
#define T int t ;cin >> t;while(t--)
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
ll p ;
inline ll gcd(ll a,ll b){
   return b == 0? a:gcd(b, a % b);}
inline ll lcm(ll a,ll b){
   return a/gcd(a,b)*b;}
ll Mode(ll a, ll b, ll mode)    {
   ll sum = 1;if(mode == 1)return 0 ;while (b) {
   if (b & 1) {
   sum = (sum * a) % mode;b--;}b /= 2;a = a * a % mode;}return sum;}
const int maxn = 2e5 + 10;
const int INF = 0x3f3f3f3f;
const double eps = 1e-11;
ll a[maxn] ;
ll b[maxn] ;
int main(){
   
	T