题目链接:https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_c
题意:给你两个数列a和b,问能不能经过最多n-2次交换a中的元素是的任意的i,使得a[i] <= b[i]
思路:首先,我们把a,b全都排序一遍,之后扫一遍,如果有a[i] > b[i]那一定是No,如果有a[i+1] <= b[i] 拿一定是Yes,之后,就要知道一个结论就是全排列的最小交换次数是n-c(c是两个数组中圈的个数)那么我没就只需要跑一遍看看这两个数组里面有没有圈就行啦。
代码:
#include <stack>
#include <queue>
#include <cmath>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
const int INF = 0x3f3f3f3f;
const int maxn = 1e5 + 7;
const int mod = 1e9 + 7;
int n;
struct node {
int val;
int id;
}a[maxn],b[maxn];
bool cmp(node aa,node bb) {
return aa.val < bb.val;
}
int p[maxn];
int main() {
while(~scanf("%d",&n)) {
for(int i = 0 ; i < n ; i++) {
scanf("%d",&a[i].val);
a[i].id = i;
}
for(int i = 0 ; i < n ; i++) {
scanf("%d",&b[i].val);
b[i].id = i;
}
sort(a,a+n,cmp);
sort(b,b+n,cmp);
bool flag = false;
for(int i = 0 ; i < n ; i++) {
if(a[i].val > b[i].val) {
flag = true;
break;
}
}
if(flag) printf("No\n");
else {
for(int i = 0 ; i < n - 1 ; i++) {
// cout << a[i+1].val << " " << b[i].val << endl;
if(a[i+1].val <= b[i].val) {
flag = true;
break;
}
}
// cout << flag << endl;
if(flag) printf("Yes\n");
else {
memset(p,0,sizeof(p));
for(int i = 0 ; i < n ; i++) {
p[a[i].id] = b[i].id;
}
int x = p[0] , len = 1;
while(x != 0) {
x = p[x];
len++;
}
if(len > n - 1) printf("No\n");
else printf("Yes\n");
}
}
}
return 0;
}