제출 #442922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442922		prvocislo	Matching (CEOI11_mat)	C++17	63 / 100	2098 ms	5388 KiB

mat

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

const int maxn = 1e6 + 5;
int st[maxn], s[maxn], h[maxn], l = 0, r = 0;
void pridaj(int i)
{
    while (r > l && h[st[r-1]] > h[i]) r--;
    st[r++] = i;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); 
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> s[i], s[i]--;
    for (int i = 0; i < m; i++) cin >> h[i];
    vector<int> ans;
    for (int i = 0; i < n; i++) pridaj(i);
    for (int i = 0; i + n - 1 < m; i++)
    {
        if (i) pridaj(i + n - 1);
        if (st[l] < i) l++;
        if (st[l] != i + s[0]) continue;
        bool ok = true;
        for (int j = 1; j < n; j++)
        {
            //cout << i+s[j-1] << " " << i+s[j] << endl;
            if (h[i+s[j-1]] > h[i+s[j]])
            {
                ok = false;
                break;
            }
        }
        if (ok) ans.push_back(i+1);
    }
    cout << ans.size() << "\n";
    for (int i : ans) cout << i << " ";
    cout << "\n";
    return 0;
}

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