Submission #902704

#	Time	Username	Problem	Language	Result	Execution time	Memory
902704		Darren0724	Matching (CEOI11_mat)	C++17	0 / 100	188 ms	13572 KiB

mat

#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define all(x) x.begin(), x.end()
const int N=200005;


int32_t main() {
    LCBorz;
    int n,m;cin>>n>>m;
    vector<int> a1(n),a(n),b(m),ans;
    int idx=0;
    for(int i=0;i<n;i++){
        cin>>a1[i];
    }
    for(int i=0;i<n;i++){
        a[a1[i]-1]=i+1;
    }
    for(int i=0;i<n;i++){
        idx=(a[i]==1?i:idx);
    }
    for(int j=0;j<m;j++){
        cin>>b[j];
    }
    deque<int> dq;
    int cnt=0;
    for(int i=0;i<m;i++){
        while(dq.size()&&dq.front()<=i-n){
            dq.pop_front();
        }
        while(dq.size()&&b[dq.back()]>b[i]){
            dq.pop_back();
        }
        dq.push_back(i);
        if(i>=n-1&&dq.front()-i+(n-1)==idx){
            cnt++;
            assert(cnt<=m/n+1);
            vector<int> t;
            for(int j=0;j<n;j++){
                t.push_back(b[i-(n-1)+j]);
            }
            sort(all(t));
            int flag=1;
            for(int j=0;j<n;j++){
                if(b[i-(n-1)+j]!=t[a[j]-1]){
                    flag=0;
                    break;
                }
            }
            if(flag)ans.push_back(i-(n-2));
        }
    }
    cout<<ans.size()<<endl;
    for(int j:ans){
        cout<<j<<' ';
    }
    cout<<endl;

    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