提出 #47824461

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define ll long long
#define db double
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define FR first
#define SE second
#define int long long
using namespace std;
inline int read() {
  int x = 0; bool op = false;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 1e3 + 10;
const int P = 1e10;
int n;
pii a[N];
vector<pii> ans;
void work(int x, int y) {
  ans.pb({x, y});
  for(int i = 1; i <= n; i++)a[i].FR = (a[i].FR + x) % y;
  // for(int i = 1; i <= n; i++)printf("%lld ", a[i].FR % P); cout << endl;
  return ;
}
int f[N];
signed main() {
  n = read();
  for(int i = 1; i <= n; i++)a[i].FR = read();
  for(int i = 1; i <= n; i++)a[i].SE = read();
  sort(a + 1, a + 1 + n);
  n = unique(a + 1, a + 1 + n) - (a + 1);
  for(int i = 1; i < n; i++)if(a[i].FR == a[i + 1].FR)return puts("No"), 0;
  puts("Yes");
  // for(int i = 1; i <= n; i++)printf("%d ", a[i].FR % P); cout << endl;
  if(n == 1)work((a[1].SE - a[1].FR + P) % P, P);
  else {
    f[1] = a[1].SE - a[n].SE - a[1].FR + P;
    for(int i = 2; i < n; i++)f[i] = a[n - i + 2].SE - a[n - i + 1].SE + P;
    f[n] = a[2].SE;
    for(int i = n; i > 1; i--)work(f[n - i + 1], a[i].FR + f[n - i + 1]);
    work(f[n], P);
  }
  for(int i = 1; i <= n; i++)assert(a[i].FR == a[i].SE);
  printf("%lu\n", ans.size());
  for(auto t : ans)printf("%lld %lld\n", t.FR, t.SE);
  return 0;
}

提出情報

ジャッジ結果