Submission #739184

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
739184	2023-05-10T06:47:44 Z	GrindMachine	Matching (CEOI11_mat)	C++17	100 / 100	1219 ms	59532 KB

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e6 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> ps = {5791, 8237, 3067, 6991, 3527};
vector<int> mods = {791139137, 433567597, 271149607, 561259969, 222708581};
ll pows[N][2];

void precalc() {
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

    shuffle(all(ps), rng);
    shuffle(all(mods), rng);

    rep(j, 2) {
        pows[0][j] = 1;
        rep1(i, N - 1) {
            pows[i][j] = pows[i - 1][j] * ps[j] % mods[j];
        }
    }
}

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
        array<int, 2> a;
        int cnt;

        data() {
            a.fill(0);
            cnt = 0;
        }
    };

    data neutral = data();

    data merge(data &left, data &right) {
        data curr;

        rep(j, 2) {
            curr.a[j] = (left.a[j] + right.a[j] * pows[left.cnt][j]) % mods[j];
        }

        curr.cnt = left.cnt + right.cnt;

        return curr;
    }

    void create(int i, T v) {
        rep(j, 2) {
            tr[i].a[j] = (v * ps[j]) % mods[j];
        }

        tr[i].cnt = (v > 0);
    }

    void modify(int i, T v) {
        rep(j, 2) {
            tr[i].a[j] = (v * ps[j]) % mods[j];
        }

        tr[i].cnt = (v > 0);
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

void solve(int test_case)
{
    precalc();
    int n, m; cin >> n >> m;
    vector<int> p(n + 5), a(m + 5);
    rep1(i, n) cin >> p[i];
    rep1(i, m) cin >> a[i];

    vector<int> b;
    rep1(i, m) b.pb(a[i]);

    sort(all(b));
    b.resize(unique(all(b)) - b.begin());

    rep1(i, m) {
        a[i] = lower_bound(all(b), a[i]) - b.begin();
    }

    array<int, 2> want, toadd;
    want.fill(0), toadd.fill(0);

    rep1(i, n) {
        rep(j, 2) {
            want[j] = (want[j] + pows[i][j] * p[i]) % mods[j];
            toadd[j] = (toadd[j] + pows[i][j]) % mods[j];
        }
    }

    segtree<int> st(m + 5);
    rep1(i, n) {
        st.pupd(a[i], i);
    }

    vector<int> ans;

    if (st.query(0, m - 1).a == want) {
        ans.pb(1);
    }

    for (int i = 2; i <= m - n + 1; ++i) {
        rep(j, 2) {
            want[j] = (want[j] + toadd[j]) % mods[j];
        }

        st.pupd(a[i - 1], 0);
        st.pupd(a[i + n - 1], i + n - 1);

        if (st.query(0, m - 1).a == want) {
            ans.pb(i);
        }
    }

    cout << sz(ans) << endl;
    trav(x, ans) cout << x << " ";
    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	15956 KB	Output is correct
2	Correct	18 ms	15956 KB	Output is correct
3	Correct	19 ms	15956 KB	Output is correct
4	Correct	18 ms	15852 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	16020 KB	Output is correct
2	Correct	19 ms	15956 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	16648 KB	Output is correct
2	Correct	32 ms	16684 KB	Output is correct

Subtask #4
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	35 ms	16668 KB	Output is correct
2	Correct	36 ms	16652 KB	Output is correct
3	Correct	20 ms	16076 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	165 ms	21904 KB	Output is correct
2	Correct	186 ms	22128 KB	Output is correct
3	Correct	231 ms	22456 KB	Output is correct
4	Correct	231 ms	22484 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	201 ms	22780 KB	Output is correct
2	Correct	238 ms	22356 KB	Output is correct
3	Correct	188 ms	22488 KB	Output is correct
4	Correct	176 ms	24336 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	182 ms	22856 KB	Output is correct
2	Correct	179 ms	22440 KB	Output is correct
3	Correct	203 ms	22292 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1006 ms	50800 KB	Output is correct
2	Correct	861 ms	52440 KB	Output is correct
3	Correct	1031 ms	41484 KB	Output is correct

Subtask #9
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	933 ms	48956 KB	Output is correct
2	Correct	1069 ms	48520 KB	Output is correct
3	Correct	870 ms	52360 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1047 ms	50904 KB	Output is correct
2	Correct	828 ms	59532 KB	Output is correct
3	Correct	1219 ms	48072 KB	Output is correct
4	Correct	616 ms	52572 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1008 ms	51132 KB	Output is correct
2	Correct	1121 ms	48920 KB	Output is correct
3	Correct	452 ms	33424 KB	Output is correct
4	Correct	711 ms	52040 KB	Output is correct

Submission #739184

Compilation message