Submission #318717

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
318717	2020-11-03T01:42:49 Z	thecodingwizard	Matching (CEOI11_mat)	C++11	100 / 100	405 ms	48064 KB

#include <bits/stdc++.h>

using namespace std;

#define ii pair<int, int>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define maxn 1000002

int n, m;
int pi[maxn];
// l[i] and r[i] give the previous and next greatest number of A[i]
// in the [0...i] prefix
int l[maxn], r[maxn];
int A[maxn];
int B[maxn];

bool eq(int i, int j) {
    int start = i - j;
    return (l[j] == -1 || A[start + l[j]] < A[i]) && (r[j] == n || A[i] < A[start + r[j]]);
}
bool eq2(int i, int j) {
    if (j == n) return false;
    int start = i - j;
    return (l[j] == -1 || B[start + l[j]] < B[i]) && (r[j] == n || B[i] < B[start + r[j]]);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    int idxMap[n];
    for (int i = 0; i < n; i++) {
        int x; cin >> x;
        A[x-1] = i;
        idxMap[i] = x-1;
    }
    int L[n], R[n];
    for (int i = 0; i < n; i++) {
        L[i] = i-1, R[i] = i+1;
    }
    for (int idx = n-1; ~idx; idx--) {
        int i = A[idx];
        l[idx] = L[i] == -1 ? -1 : idxMap[L[i]], r[idx] = R[i] == n ? n : idxMap[R[i]];
        if (L[i] != -1) R[L[i]] = R[i];
        if (R[i] != n) L[R[i]] = L[i];
    }

    pi[0] = 0;
    for (int i = 1; i < n; i++) {
        int j = pi[i-1];
        while (j > 0) {
            if (!((l[j] == -1 || A[l[j]] < A[j]) && (r[j] == n || A[j] < A[r[j]]))) {
                cout << "???" << endl;
            }
            if (eq(i, j)) break;
            j = pi[j-1];
        }
        if (eq(i, j)) j++;
        pi[i] = j;
    }

    for (int i = 0; i < m; i++) {
        cin >> B[i];
    }
    vector<int> indexes;
    int j = 0;
    for (int i = 0; i < m; i++) {
        while (j > 0 && !eq2(i, j)) j = pi[j-1];
        if (eq2(i, j)) j++;

        if (j == n) indexes.pb(i-j+2);
    }

    cout << indexes.size() << endl;
    for (int x : indexes) cout << x << " ";
    cout << endl;

    return 0;
}

Subtask #1
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	748 KB	Output is correct
2	Correct	3 ms	748 KB	Output is correct

Subtask #4
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	748 KB	Output is correct
2	Correct	3 ms	748 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	3684 KB	Output is correct
2	Correct	20 ms	2540 KB	Output is correct
3	Correct	33 ms	4708 KB	Output is correct
4	Correct	33 ms	4708 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	31 ms	4580 KB	Output is correct
2	Correct	26 ms	3428 KB	Output is correct
3	Correct	29 ms	4076 KB	Output is correct
4	Correct	40 ms	4700 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	4592 KB	Output is correct
2	Correct	26 ms	3940 KB	Output is correct
3	Correct	28 ms	3812 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	153 ms	21480 KB	Output is correct
2	Correct	405 ms	48064 KB	Output is correct
3	Correct	100 ms	11876 KB	Output is correct

Subtask #9
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	151 ms	23012 KB	Output is correct
2	Correct	107 ms	10980 KB	Output is correct
3	Correct	360 ms	43620 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	123 ms	14644 KB	Output is correct
2	Correct	211 ms	21956 KB	Output is correct
3	Correct	131 ms	16228 KB	Output is correct
4	Correct	229 ms	46052 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	134 ms	16356 KB	Output is correct
2	Correct	135 ms	16484 KB	Output is correct
3	Correct	64 ms	9188 KB	Output is correct
4	Correct	241 ms	44004 KB	Output is correct

Submission #318717

Compilation message