Milestone Counter

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <sstream>
#include <utility>
#include <set>
#include <iomanip>

using namespace std;
typedef __int128 LL;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    long long m,n;
    cin >> m >> n;
    vector<LL> p;
    vector<LL> s;
    for(LL i = 0; i < m; i++){
        long long x; cin >> x;
        p.push_back(x);
    }
    for(LL i = 0; i < n; i++){
        long long x; cin >> x;
        s.push_back(x);
    }
    
    LL k = p.size();
    vector<LL> ans;
    for(LL start = 0; start < n; start++){
        if(start + k - 1 >= n) break;
        LL A = s[start+1] - s[start];
        LL B = p[1] - p[0];
        bool good = true;
        for(LL i = 1; i < k; i++){
            if(A*(p[i] - p[i-1]) != B*(s[start+i]-s[start+i-1])) good = false;
        }
        if(good) ans.push_back(A);
    }
    set<LL> distinct(ans.begin(), ans.end());
    cout << distinct.size() << endl;
    for(auto x : distinct) cout << (long long)x << " "; cout << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED