1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
| #include <algorithm> #include <cstdio> #include <set>
typedef long long ll; using std::multiset; const int maxn = 100005;
ll t,n,m,a[maxn],p[maxn],award[maxn],atk[maxn]; multiset < ll > sword;
namespace func { inline ll max(ll a,ll b) { return a > b ? a : b; }
inline ll read() { #define gc c = getchar() ll d = 0; int f = 0,gc; while(c < 48 || c > 57) f |= (c == '-'),gc; while(c > 47 && c < 58) d = (d << 1) + (d << 3) + (c ^ 48),gc; #undef gc return f ? -d : d; }
ll gcd(ll a,ll b) { if(!b) return a; return gcd(b,a % b); }
ll exgcd(ll a,ll b,ll& x1,ll& y1) { if(!b) { x1 = 1,y1 = 0; return a; } ll x2,y2,ans = exgcd(b,a % b,x2,y2); x1 = y2; y1 = x2 - a / b * y2; return ans; }
ll inv(ll a,ll p) { ll x,y; exgcd(a,p,x,y); return (x % p + p) % p; }
ll fmul(ll a,ll b,ll mod) { ll rep = 0; while(b) { if(b & 1) rep = (rep + a) % mod; a = (a << 1) % mod,b >>= 1; } return rep; }
void init() { multiset < ll >::iterator it; for(int i = 1;i <= n;i ++) { it = sword.upper_bound(a[i]); if(it != sword.begin()) it --; atk[i] = *it; sword.erase(it); sword.insert(award[i]); } } }
namespace sp { bool check() { for(int i = 1;i <= n;i ++) if(p[i] != 1) return false; return true; }
void solve_sp() { ll ans = -1; for(int i = 1;i <= n;i ++) ans = func::max(ans,(a[i] + atk[i] - 1) / atk[i]); printf("%lld\n",ans); } }
namespace soln { ll p1[maxn],q1[maxn];
bool init_equotion() { for(int i = 1;i <= n;i ++ ) { ll g = func::gcd(p[i],a[i]); g = func::gcd(g,atk[i]); a[i] /= g,p[i] /= g,atk[i] /= g; if(func::gcd(atk[i],p[i]) != 1) return false; q1[i] = func::fmul(a[i],func::inv(atk[i],p[i]),p[i]); p1[i] = p[i]; } return true; }
void excrt() { ll M = p1[1]; ll ans = q1[1]; for(int i = 2;i <= n;i ++) { ll k1,x,y; ll g = func::exgcd(M,p1[i],x,y); ll c = (q1[i] - ans % p1[i] + p1[i]) % p1[i]; if(c % g != 0) { puts("-1"); return ; } k1 = func::fmul(x,c / g,p1[i] / g); ans = M * k1 + ans; M = M / g * p1[i]; ans = (ans % M + M) % M; } ans = (ans % M + M) % M; printf("%lld\n",ans); }
void solve() { sword.clear(); n = func::read(),m = func::read(); for(int i = 1;i <= n;i ++) a[i] = func::read(); for(int i = 1;i <= n;i ++) p[i] = func::read(); for(int i = 1;i <= n;i ++) award[i] = func::read(); for(int i = 1;i <= m;i ++) sword.insert(func::read()); func::init(); if(sp::check()) sp::solve_sp(); else if(init_equotion()) excrt(); else puts("-1"); } }
int main() { freopen("dragon.in","r",stdin); freopen("dragon.out","w",stdout); t = func::read(); for(;t;t --) soln::solve(); fclose(stdin); fclose(stdout); return 0; }
|