oj.uz

Submission #949475

# Submission time Handle Problem Language Result Execution time Memory
949475 2024-03-19T09:28:26 Z _callmelucian Matching (CEOI11_mat) C++14
100 / 100
 314 ms 57548 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tt;

#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())

struct BIT {
    vector<int> tr;
    BIT (int sz) : tr(sz + 1, INT_MIN) {}

    int p (int k) { return k & -k; }

    void update (int k, int val) {
        for (; k < tr.size(); k += p(k))
            tr[k] = max(tr[k], val);
    }

    int query (int k, int ans = INT_MIN) {
        for (; k; k -= p(k)) ans = max(ans, tr[k]);
        return ans;
    }
};

const int mn = 2e6 + 6;
int p[mn], s[mn], lb[mn], rb[mn], z[mn];

bool ok (int i, int nxt) {
    // check if [i..nxt] is isomorphic to [0..p]
    // knowing that [i..nxt-1] is already isomorphic to the prefix
    if (max(s[i], s[nxt]) == INT_MAX) return 0;
    int p = nxt - i;
    if (lb[p] != -1) {
        int dist = p - lb[p];
        if (nxt - dist < 0 || s[nxt - dist] > s[nxt]) return 0; // s[nxt - dist] must be < s[nxt]
    }
    if (rb[p] != -1) {
        int dist = p - rb[p];
        if (nxt - dist < 0 || s[nxt - dist] < s[nxt]) return 0; // s[nxt - dist] must be > s[nxt]
    }
    return 1;
}

void zFunc (int n) {
    int x = 0, y = 0;
    for (int i = 1; i < n; i++) {
        z[i] = max(0, min(y - i + 1, z[i - x]));
        if (i + z[i] > y) {
            while (i + z[i] < n && ok(i, i + z[i]))
                z[i]++, y++;
            x = i;
        }
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, m; cin >> n >> m;
    int len = n + m + 1;

    for (int i = 1; i <= n; i++) {
        cin >> p[i];
        s[--p[i]] = i;
    }
    s[n] = INT_MAX;
    for (int i = n + 1; i <= n + m; i++) cin >> s[i];

    BIT lt(n + 1), rt(n + 1);
    for (int i = 0; i < n; i++) {
        int lval = lt.query(s[i]), rval = rt.query(n - s[i] + 1);
        lb[i] = (lval == INT_MIN ? -1 : p[lval]);
        rb[i] = (rval == INT_MIN ? -1 : p[-rval]);
        lt.update(s[i], s[i]);
        rt.update(n - s[i] + 1, -s[i]);
    }
    zFunc(len);

    vector<int> ans;
    for (int i = n + 1; i < len; i++)
        if (z[i] == n) ans.push_back(i - n);

    cout << ans.size() << "\n";
    for (int u : ans) cout << u << " ";

    return 0;
}

Compilation message

mat.cpp: In member function 'void BIT::update(int, int)':
mat.cpp:20:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         for (; k < tr.size(); k += p(k))
      |                ~~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 11096 KB Output is correct
2 Correct 14 ms 12116 KB Output is correct
3 Correct 26 ms 13404 KB Output is correct
4 Correct 28 ms 13376 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 11612 KB Output is correct
2 Correct 19 ms 12892 KB Output is correct
3 Correct 21 ms 13392 KB Output is correct
4 Correct 26 ms 14296 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 11740 KB Output is correct
2 Correct 20 ms 12816 KB Output is correct
3 Correct 22 ms 12884 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 23456 KB Output is correct
2 Correct 314 ms 57548 KB Output is correct
3 Correct 71 ms 22908 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 25428 KB Output is correct
2 Correct 75 ms 23768 KB Output is correct
3 Correct 247 ms 51792 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 18240 KB Output is correct
2 Correct 124 ms 34736 KB Output is correct
3 Correct 92 ms 27460 KB Output is correct
4 Correct 216 ms 55636 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 20800 KB Output is correct
2 Correct 93 ms 27636 KB Output is correct
3 Correct 55 ms 19904 KB Output is correct
4 Correct 218 ms 53332 KB Output is correct