Submission #1151647

#	Time	Username	Problem	Language	Result	Execution time	Memory
1151647		daoquanglinh2007	Matching (CEOI11_mat)	C++20	0 / 100	538 ms	26788 KiB

mat

#include <bits/stdc++.h>
using namespace std;

#define isz(a) (int)(a).size()

const int NM = 1e6, MOD = 2e9+11;

struct node{
    int cnt = 0, res = 0;
};

int n, m, p[NM+5], h[NM+5], pw[NM+5];
vector <int> arr, ans;
node st[4*NM+5];

node merge(node a, node b){
    node c;
    c.cnt = a.cnt+b.cnt;
    c.res = 1LL*a.res*pw[b.cnt]+b.res;
    return c;
}

void update(int id, int l, int r, int i, int val){
    if (i < l || i > r) return;
    if (l == r){
        st[id].cnt = val > 0;
        st[id].res = val;
        return;
    }
    int mid = (l+r)/2;
    update(2*id, l, mid, i, val);
    update(2*id+1, mid+1, r, i, val);
    st[id] = merge(st[2*id], st[2*id+1]);
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;
    for (int i = 1; i <= n; i++){
        cin >> p[i];
        p[i]--;
    }
    for (int i = 1; i <= m; i++){
        cin >> h[i];
        arr.push_back(h[i]);
    }
    sort(arr.begin(), arr.end());
    for (int i = 1; i <= m; i++) h[i] = lower_bound(arr.begin(), arr.end(), h[i])-arr.begin()+1;

    pw[0] = 1;
    for (int i = 1; i <= n; i++)
        pw[i] = 1LL*pw[i-1]*n%MOD;

    int target_res = 0, tmp = 0;
    for (int i = 1; i <= n; i++){
        target_res = (1LL*target_res*n+p[i])%MOD;
        tmp = (1LL*tmp*n+1)%MOD;
    }

    for (int i = 1; i <= n; i++) update(1, 1, m, h[i], i);
    if ((0LL+st[1].res-tmp+MOD)%MOD == target_res) ans.push_back(1);

    for (int i = 2; i+n-1 <= m; i++){
        update(1, 1, m, h[i-1], 0);
        update(1, 1, m, h[i+n-1], i+n-1);
        if (((st[1].res-1LL*i*tmp)%MOD+MOD)%MOD == target_res) ans.push_back(i);
    }
    cout << isz(ans) << '\n';
    for (int x : ans) cout << x << ' ';
    return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 8
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10