Submission #50499455

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
using pl=pair<long long,long long>;

vector<long long> work(vector<pl> &op,vector<long long> a){
  for(auto &nx : op){
    for(auto &ny : a){
      ny=(ny+nx.first)%nx.second;
    }
  }
  return a;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  long long big=1e12;
  long long n;
  cin >> n;
  vector<long long> a(n),b(n);
  for(auto &nx : a){cin >> nx;}
  for(auto &nx : b){cin >> nx;}
  vector<pl> vp(n);
  for(long long i=0;i<n;i++){
    vp[i].first=a[i];
    vp[i].second=b[i];
  }

  sort(vp.begin(),vp.end());
  reverse(vp.begin(),vp.end());

  vector<long long> del(n);
  for(long long i=0;i<n;i++){
    del[i]=vp[i].first-vp[i].second;
  }
  for(long long i=0;i<n-1;i++){
    del[i]-=del[n-1];
  }
  // for(auto &nx : vp){cout << nx.first << " ";}cout << "\n";
  // for(auto &nx : vp){cout << nx.second << " ";}cout << "\n";
  // for(auto &nx : del){cout << nx << " ";}cout << "\n";

  vector<pl> res;
  long long cm=big;
  for(long long i=0;i<n-1;i++){
    pl op={cm+del[i]-vp[i].first,cm+del[i]};
    cm+=big;
    res.push_back(op);
    for(auto &nx : vp){
      nx.first=(nx.first+op.first)%op.second;
    }
    // cout << op.first << " , " << op.second << "\n";
    // for(auto &nx : vp){cout << nx.first << " ";}cout << "\n";
  }

  long long lf=(big+vp[0].second-(vp[0].first%big))%big;
  long long ls=big;
  res.push_back({lf,ls});
  for(auto &nx : vp){
    nx.first=(nx.first+lf)%ls;
  }
  // cout << lf << " , " << ls << "\n";
  // for(auto &nx : vp){cout << nx.first << " ";}cout << "\n";

  if(work(res,a)!=b){
    cout << "No\n";
    return 0;
  }

  cout << "Yes\n";
  cout << res.size() << "\n";
  for(auto &nx : res){
    cout << nx.first%nx.second << " ";
    cout << nx.second << "\n";
  }
  return 0;
}

Submission Info

Judge Result