【2021CCPC女生赛】E. 被遗忘的计划

typedef vector<ll> vl;

vl operator *(vl a, vl b){

    vl ve(a.size(), -LNF);
    for(int i = 0; i < a.size(); ++ i){
        for(int j = 0; j < b.size(); ++ j){
            ve[(i + j) % a.size()] = max (ve[(i + j) % a.size()], a[i] + b[j]);
        }
    }
    return ve;
}

vl qmi(vl m, ll k){
    vl res (m.size(), -LNF);
    res[0] = 0; // 答案至少是0
    while (k){
        if(k&1) res = res * m;
        m = m * m;
        k >>= 1;
    }
    return res;
}

int main(){
    int n; cin >> n;
    vl v(n), f(n);
    for(int i = 1; i <= n ; ++ i) cin >> v[i%n];
    for(int i = 0; i < n ; ++ i) cin >> f[i];
    ll maxv=*max_element(v.begin(), v.end());
    ll maxf=*max_element(f.begin(), f.end());
    ll k=maxf / maxv;
    if(k>1e9||k<1) cout<<-1;
    else{
        v = qmi(v, k);
        cout << (v == f ? k : -1) << endl;
    }
    return 0;
}