Submission #44141032

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const ll MAXN = 1010,K = 1e14;

ll n,a[MAXN],b[MAXN],arr[MAXN],tot;

typedef array<ll,2> pr;

vector<pr>ret;

void add(ll x,ll y){
	x%=y;
	ret.push_back({x,y});
}
void output(){
	cout<<"Yes\n";
	cout<<ret.size()<<"\n";
	for(auto [x,y] : ret)cout<<x<<" "<<y<<"\n";
	exit(0);
}

int main(){
	cin>>n;

	rep(i,1,n)cin>>a[i];
	rep(i,1,n)cin>>b[i];

	rep(i,1,n)rep(j,i+1,n)if(a[i] == a[j] && b[i] != b[j]){
		cout<<"No\n";
		exit(0);
	}

	rep(i,1,n){
		int flag = 1;
		rep(j,1,i-1)if(a[j] == a[i])flag = 0;
		if(flag)arr[++tot] = i;
	}

	if(tot==1){
		add(K + b[1] - a[1],K);
		output();
	}

	sort(arr+1,arr+1+tot,[&](ll x,ll y){return a[x] < a[y];});

	assert(tot > 0);

	ll ps = 0;

	rep(i,1,tot-1){
		int y = (i==1) ? (1) : (tot-i+2),x = (i==1) ? (tot) : (tot-i+1),mx = tot - i + 1;

		ll val = K + b[arr[y]] - b[arr[x]] - ((i==1) ? (a[arr[1]]) : (0));
		ps += val;
		add(val,a[arr[mx]] + ps);
	}

	add(b[arr[2]],K);
	output();

    return 0;
}

Submission Info

Judge Result