제출 #1183107

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1183107		kayumov_muhammad	Matching (CEOI11_mat)	C++20	18 / 100	2095 ms	25968 KiB

mat

#include <bits/stdc++.h>

#ifdef LOCAL
#include "debug/debug.hpp"
#else
#define print(...)
#endif

using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define str string

#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define ent cout << "\n";
#define sz(v) ll(v.size())

using namespace std;

const long long MOD = 1e9 + 7, inf = 1e18;

void solve() {
    ll n, m;
    cin >> n >> m;

    ll a[n + 17];
    ll a2[n + 17];

    for (ll i = 1; i <= n; i++) {
        cin >> a2[i];
        a[a2[i]] = i;
    }

    ll b[m + 17];

    for (ll i = 1; i <= m; i++) {
        cin >> b[i];
    }
    vector<ll> ans;
    for (ll i = 1; i + n - 1 <= m; i++) {
        vector<pair<ll, ll>> t;

        for (ll j = i; j - i + 1 <= n; j++) {
            t.push_back({b[j], j - i + 1});
        }
        sort(all(t));
        ll ok = 1;

        for (ll j = 0; j < sz(t); j++) {
            if (a2[j + 1] != t[j].se) {
                ok = 0;
            }
        }
        if (ok) {
            ans.push_back(i);
        }
        // print(t);
    }

    cout << sz(ans) << '\n';

    for (auto c : ans) {
        cout << c << ' ';
    }
    ent;
}

int32_t main() {
#ifdef ONLINE_JUDGE
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    ll ttest = 1;
    // cin >> ttest;

    for (ll test_number = 1; test_number <= ttest; test_number++) {
        solve();
    }

    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 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