제출 #643440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
643440		CDuong	Matching (CEOI11_mat)	C++17	54 / 100	2094 ms	10188 KiB

mat

/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#define taskname "bai3"
#define int long long
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
#define pii pair<int, int>
using namespace std;
const int mxN = 1e6 + 5;
const int mod = 1e9 + 7;
const int oo = 1e18;
int n, m, sx[mxN], a[mxN];
void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> sx[i];
    for(int i = 1; i <= m; ++i) cin >> a[i];
    vector<int> v;
    for(int i = 1; i <= m - n + 1; ++i){
        int lst = 0;
        bool flag = false;
        for(int j = i; j < i + n; ++j){
            int tmp = a[sx[j - i + 1] + i - 1];
            if(tmp < lst){
                flag = true;
                break;
            }
            else lst = tmp;
        }
        if(!flag) v.pb(i);
    }
    cout << v.size() << endl;
    for(int tmp : v){
        cout << tmp << " ";
    }
    cout << endl;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen(taskname".inp", "r", stdin);
    //freopen(taskname".out", "w", stdout);
    int t = 1; //cin >> t;
    while(t--) solve();
}

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