oj.uz

Submission #930034

# Submission time Handle Problem Language Result Execution time Memory
930034 2024-02-18T09:26:56 Z gaga999 Matching (CEOI11_mat) C++17
100 / 100
 65 ms 29736 KB 
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 1e6 + 6;
int ar[N], pr[N], br[N], l[N], r[N], bf[N], af[N], kp[N];

inline bool ck(int fr[], int i, int j) // pr now
{
    return fr[j + bf[i]] > fr[j] || fr[j + af[i]] < fr[j];
}

signed main()
{
    int n, m;
    rd(n, m);
    for (int i = 1; i <= n; i++)
    {
        rd(pr[i]), ar[pr[i]] = i;
        l[i] = i - 1, r[i] = i + 1;
    }
    for (int i = n; i > 0; i--)
    {
        int p = ar[i];
        if (l[p])
            bf[i] = pr[l[p]] - i;
        if (r[p] <= n)
            af[i] = pr[r[p]] - i;
        l[r[p]] = l[p], r[l[p]] = r[p];
    }
    for (int i = 2; i <= n; i++)
    {
        kp[i] = kp[i - 1];
        while (kp[i] > 0 && ck(ar, kp[i] + 1, i))
            kp[i] = kp[kp[i]];
        kp[i]++;
    }
    vector<int> an;
    for (int i = 1, j = 0; i <= m; i++)
    {
        rd(ar[i]);
        while (j > 0 && ck(ar, j + 1, i))
            j = kp[j];
        if (++j == n)
            an.pb(i - n + 1), j = kp[j];
    }
    prt(an.size()), putchar('\n');
    for (int i : an)
        prt(i), putchar(' ');
    putchar('\n');
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 12892 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 8 ms 14940 KB Output is correct
4 Correct 9 ms 14936 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15452 KB Output is correct
2 Correct 6 ms 12636 KB Output is correct
3 Correct 7 ms 13148 KB Output is correct
4 Correct 10 ms 12964 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15320 KB Output is correct
2 Correct 5 ms 12892 KB Output is correct
3 Correct 5 ms 12892 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 24020 KB Output is correct
2 Correct 65 ms 29736 KB Output is correct
3 Correct 17 ms 14940 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 25436 KB Output is correct
2 Correct 21 ms 15196 KB Output is correct
3 Correct 59 ms 29548 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 18120 KB Output is correct
2 Correct 44 ms 23992 KB Output is correct
3 Correct 21 ms 17240 KB Output is correct
4 Correct 33 ms 29532 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 20436 KB Output is correct
2 Correct 21 ms 17500 KB Output is correct
3 Correct 10 ms 19036 KB Output is correct
4 Correct 45 ms 29704 KB Output is correct