oj.uz

Submission #967941

# Submission time Handle Problem Language Result Execution time Memory
967941 2024-04-23T05:54:14 Z gaga999 Binaria (CCO23_day1problem1) C++17
25 / 25
 25 ms 14200 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#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 size(x) (int)x.size()
#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 __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
const int M = 1e6 + 3;

// 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);
}

int ar[M], fl[M], iv[M];
bool vd[M], vl[M];

inline int pw(int a, int b)
{
    int re = 1;
    for (; b; b >>= 1)
    {
        if (b & 1)
            tml(re, a);
        tml(a, a);
    }
    return re;
}

inline int C(int n, int k)
{
    return ml(fl[n], ml(iv[k], iv[n - k]));
}

signed main()
{
    fl[0] = iv[0] = 1;
    for (int i = 1; i < M; i++)
        fl[i] = ml(fl[i - 1], i);
    iv[M - 1] = pw(fl[M - 1], M - 2);
    for (int i = M - 1; i > 0; i--)
        iv[i - 1] = ml(iv[i], i);
    int n, k;
    rd(n, k);
    for (int i = 0; i <= n - k; i++)
        rd(ar[i]);
    int n1 = ar[0], n0 = k - n1;
    for (int i = 1; i <= n - k; i++)
    {
        if (ar[i] == ar[i - 1])
            continue;
        vd[i - 1] = vd[i - 1 + k] = 1;
        vl[i - 1] = ((ar[i] - ar[i - 1]) == -1);
        vl[i - 1 + k] = vl[i - 1] ^ 1;
    }
    for (int i = n - k; i > 0; i--)
    {
        if (ar[i] == ar[i - 1])
        {
            if (vd[i - 1 + k])
            {
                vd[i - 1] = 1;
                vl[i - 1] = vl[i - 1 + k];
            }
        }
    }
    for (int i = 0; i < k; i++)
        if (vd[i])
            (vl[i] ? n1 : n0)--;
    prt(C(n1 + n0, n0)), putchar('\n');
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 10588 KB Output is correct
2 Correct 11 ms 10588 KB Output is correct
3 Correct 11 ms 10692 KB Output is correct
4 Correct 11 ms 10584 KB Output is correct
5 Correct 11 ms 10588 KB Output is correct
6 Correct 11 ms 10588 KB Output is correct
7 Correct 11 ms 10588 KB Output is correct
8 Correct 11 ms 10588 KB Output is correct
9 Correct 12 ms 10588 KB Output is correct
10 Correct 13 ms 10588 KB Output is correct
11 Correct 11 ms 10696 KB Output is correct
12 Correct 12 ms 10588 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 10588 KB Output is correct
2 Correct 11 ms 10588 KB Output is correct
3 Correct 11 ms 10692 KB Output is correct
4 Correct 11 ms 10584 KB Output is correct
5 Correct 11 ms 10588 KB Output is correct
6 Correct 11 ms 10588 KB Output is correct
7 Correct 11 ms 10588 KB Output is correct
8 Correct 11 ms 10588 KB Output is correct
9 Correct 12 ms 10588 KB Output is correct
10 Correct 13 ms 10588 KB Output is correct
11 Correct 11 ms 10696 KB Output is correct
12 Correct 12 ms 10588 KB Output is correct
13 Correct 13 ms 10588 KB Output is correct
14 Correct 11 ms 10588 KB Output is correct
15 Correct 11 ms 10588 KB Output is correct
16 Correct 11 ms 10584 KB Output is correct
17 Correct 11 ms 10588 KB Output is correct
18 Correct 11 ms 10588 KB Output is correct
19 Correct 11 ms 10588 KB Output is correct
20 Correct 11 ms 10588 KB Output is correct
21 Correct 11 ms 10588 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 10588 KB Output is correct
2 Correct 11 ms 10588 KB Output is correct
3 Correct 11 ms 10692 KB Output is correct
4 Correct 11 ms 10584 KB Output is correct
5 Correct 11 ms 10588 KB Output is correct
6 Correct 11 ms 10588 KB Output is correct
7 Correct 11 ms 10588 KB Output is correct
8 Correct 11 ms 10588 KB Output is correct
9 Correct 12 ms 10588 KB Output is correct
10 Correct 13 ms 10588 KB Output is correct
11 Correct 11 ms 10696 KB Output is correct
12 Correct 12 ms 10588 KB Output is correct
13 Correct 13 ms 10588 KB Output is correct
14 Correct 11 ms 10588 KB Output is correct
15 Correct 11 ms 10588 KB Output is correct
16 Correct 11 ms 10584 KB Output is correct
17 Correct 11 ms 10588 KB Output is correct
18 Correct 11 ms 10588 KB Output is correct
19 Correct 11 ms 10588 KB Output is correct
20 Correct 11 ms 10588 KB Output is correct
21 Correct 11 ms 10588 KB Output is correct
22 Correct 12 ms 10584 KB Output is correct
23 Correct 11 ms 10584 KB Output is correct
24 Correct 11 ms 10588 KB Output is correct
25 Correct 11 ms 10584 KB Output is correct
26 Correct 11 ms 10840 KB Output is correct
27 Correct 11 ms 10588 KB Output is correct
28 Correct 11 ms 10588 KB Output is correct
29 Correct 11 ms 10588 KB Output is correct
30 Correct 11 ms 10588 KB Output is correct
31 Correct 11 ms 10588 KB Output is correct
32 Correct 11 ms 10588 KB Output is correct
33 Correct 11 ms 10692 KB Output is correct
34 Correct 11 ms 10588 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 10588 KB Output is correct
2 Correct 11 ms 10588 KB Output is correct
3 Correct 11 ms 10692 KB Output is correct
4 Correct 11 ms 10584 KB Output is correct
5 Correct 11 ms 10588 KB Output is correct
6 Correct 11 ms 10588 KB Output is correct
7 Correct 11 ms 10588 KB Output is correct
8 Correct 11 ms 10588 KB Output is correct
9 Correct 12 ms 10588 KB Output is correct
10 Correct 13 ms 10588 KB Output is correct
11 Correct 11 ms 10696 KB Output is correct
12 Correct 12 ms 10588 KB Output is correct
13 Correct 13 ms 10588 KB Output is correct
14 Correct 11 ms 10588 KB Output is correct
15 Correct 11 ms 10588 KB Output is correct
16 Correct 11 ms 10584 KB Output is correct
17 Correct 11 ms 10588 KB Output is correct
18 Correct 11 ms 10588 KB Output is correct
19 Correct 11 ms 10588 KB Output is correct
20 Correct 11 ms 10588 KB Output is correct
21 Correct 11 ms 10588 KB Output is correct
22 Correct 12 ms 10584 KB Output is correct
23 Correct 11 ms 10584 KB Output is correct
24 Correct 11 ms 10588 KB Output is correct
25 Correct 11 ms 10584 KB Output is correct
26 Correct 11 ms 10840 KB Output is correct
27 Correct 11 ms 10588 KB Output is correct
28 Correct 11 ms 10588 KB Output is correct
29 Correct 11 ms 10588 KB Output is correct
30 Correct 11 ms 10588 KB Output is correct
31 Correct 11 ms 10588 KB Output is correct
32 Correct 11 ms 10588 KB Output is correct
33 Correct 11 ms 10692 KB Output is correct
34 Correct 11 ms 10588 KB Output is correct
35 Correct 16 ms 13836 KB Output is correct
36 Correct 21 ms 14172 KB Output is correct
37 Correct 21 ms 14120 KB Output is correct
38 Correct 18 ms 14168 KB Output is correct
39 Correct 16 ms 14168 KB Output is correct
40 Correct 18 ms 14016 KB Output is correct
41 Correct 18 ms 14172 KB Output is correct
42 Correct 22 ms 14200 KB Output is correct
43 Correct 19 ms 14100 KB Output is correct
44 Correct 16 ms 13916 KB Output is correct
45 Correct 19 ms 13916 KB Output is correct
46 Correct 18 ms 13916 KB Output is correct
47 Correct 16 ms 13916 KB Output is correct
48 Correct 18 ms 13916 KB Output is correct
49 Correct 18 ms 14176 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 10588 KB Output is correct
2 Correct 11 ms 10588 KB Output is correct
3 Correct 11 ms 10692 KB Output is correct
4 Correct 11 ms 10584 KB Output is correct
5 Correct 11 ms 10588 KB Output is correct
6 Correct 11 ms 10588 KB Output is correct
7 Correct 11 ms 10588 KB Output is correct
8 Correct 11 ms 10588 KB Output is correct
9 Correct 12 ms 10588 KB Output is correct
10 Correct 13 ms 10588 KB Output is correct
11 Correct 11 ms 10696 KB Output is correct
12 Correct 12 ms 10588 KB Output is correct
13 Correct 13 ms 10588 KB Output is correct
14 Correct 11 ms 10588 KB Output is correct
15 Correct 11 ms 10588 KB Output is correct
16 Correct 11 ms 10584 KB Output is correct
17 Correct 11 ms 10588 KB Output is correct
18 Correct 11 ms 10588 KB Output is correct
19 Correct 11 ms 10588 KB Output is correct
20 Correct 11 ms 10588 KB Output is correct
21 Correct 11 ms 10588 KB Output is correct
22 Correct 12 ms 10584 KB Output is correct
23 Correct 11 ms 10584 KB Output is correct
24 Correct 11 ms 10588 KB Output is correct
25 Correct 11 ms 10584 KB Output is correct
26 Correct 11 ms 10840 KB Output is correct
27 Correct 11 ms 10588 KB Output is correct
28 Correct 11 ms 10588 KB Output is correct
29 Correct 11 ms 10588 KB Output is correct
30 Correct 11 ms 10588 KB Output is correct
31 Correct 11 ms 10588 KB Output is correct
32 Correct 11 ms 10588 KB Output is correct
33 Correct 11 ms 10692 KB Output is correct
34 Correct 11 ms 10588 KB Output is correct
35 Correct 16 ms 13836 KB Output is correct
36 Correct 21 ms 14172 KB Output is correct
37 Correct 21 ms 14120 KB Output is correct
38 Correct 18 ms 14168 KB Output is correct
39 Correct 16 ms 14168 KB Output is correct
40 Correct 18 ms 14016 KB Output is correct
41 Correct 18 ms 14172 KB Output is correct
42 Correct 22 ms 14200 KB Output is correct
43 Correct 19 ms 14100 KB Output is correct
44 Correct 16 ms 13916 KB Output is correct
45 Correct 19 ms 13916 KB Output is correct
46 Correct 18 ms 13916 KB Output is correct
47 Correct 16 ms 13916 KB Output is correct
48 Correct 18 ms 13916 KB Output is correct
49 Correct 18 ms 14176 KB Output is correct
50 Correct 20 ms 14008 KB Output is correct
51 Correct 20 ms 13920 KB Output is correct
52 Correct 20 ms 14168 KB Output is correct
53 Correct 24 ms 14172 KB Output is correct
54 Correct 21 ms 14172 KB Output is correct
55 Correct 20 ms 14172 KB Output is correct
56 Correct 20 ms 14172 KB Output is correct
57 Correct 22 ms 14172 KB Output is correct
58 Correct 20 ms 13916 KB Output is correct
59 Correct 21 ms 14172 KB Output is correct
60 Correct 22 ms 14020 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 10588 KB Output is correct
2 Correct 11 ms 10588 KB Output is correct
3 Correct 11 ms 10692 KB Output is correct
4 Correct 11 ms 10584 KB Output is correct
5 Correct 11 ms 10588 KB Output is correct
6 Correct 11 ms 10588 KB Output is correct
7 Correct 11 ms 10588 KB Output is correct
8 Correct 11 ms 10588 KB Output is correct
9 Correct 12 ms 10588 KB Output is correct
10 Correct 13 ms 10588 KB Output is correct
11 Correct 11 ms 10696 KB Output is correct
12 Correct 12 ms 10588 KB Output is correct
13 Correct 13 ms 10588 KB Output is correct
14 Correct 11 ms 10588 KB Output is correct
15 Correct 11 ms 10588 KB Output is correct
16 Correct 11 ms 10584 KB Output is correct
17 Correct 11 ms 10588 KB Output is correct
18 Correct 11 ms 10588 KB Output is correct
19 Correct 11 ms 10588 KB Output is correct
20 Correct 11 ms 10588 KB Output is correct
21 Correct 11 ms 10588 KB Output is correct
22 Correct 12 ms 10584 KB Output is correct
23 Correct 11 ms 10584 KB Output is correct
24 Correct 11 ms 10588 KB Output is correct
25 Correct 11 ms 10584 KB Output is correct
26 Correct 11 ms 10840 KB Output is correct
27 Correct 11 ms 10588 KB Output is correct
28 Correct 11 ms 10588 KB Output is correct
29 Correct 11 ms 10588 KB Output is correct
30 Correct 11 ms 10588 KB Output is correct
31 Correct 11 ms 10588 KB Output is correct
32 Correct 11 ms 10588 KB Output is correct
33 Correct 11 ms 10692 KB Output is correct
34 Correct 11 ms 10588 KB Output is correct
35 Correct 16 ms 13836 KB Output is correct
36 Correct 21 ms 14172 KB Output is correct
37 Correct 21 ms 14120 KB Output is correct
38 Correct 18 ms 14168 KB Output is correct
39 Correct 16 ms 14168 KB Output is correct
40 Correct 18 ms 14016 KB Output is correct
41 Correct 18 ms 14172 KB Output is correct
42 Correct 22 ms 14200 KB Output is correct
43 Correct 19 ms 14100 KB Output is correct
44 Correct 16 ms 13916 KB Output is correct
45 Correct 19 ms 13916 KB Output is correct
46 Correct 18 ms 13916 KB Output is correct
47 Correct 16 ms 13916 KB Output is correct
48 Correct 18 ms 13916 KB Output is correct
49 Correct 18 ms 14176 KB Output is correct
50 Correct 20 ms 14008 KB Output is correct
51 Correct 20 ms 13920 KB Output is correct
52 Correct 20 ms 14168 KB Output is correct
53 Correct 24 ms 14172 KB Output is correct
54 Correct 21 ms 14172 KB Output is correct
55 Correct 20 ms 14172 KB Output is correct
56 Correct 20 ms 14172 KB Output is correct
57 Correct 22 ms 14172 KB Output is correct
58 Correct 20 ms 13916 KB Output is correct
59 Correct 21 ms 14172 KB Output is correct
60 Correct 22 ms 14020 KB Output is correct
61 Correct 11 ms 10588 KB Output is correct
62 Correct 12 ms 10688 KB Output is correct
63 Correct 11 ms 10584 KB Output is correct
64 Correct 11 ms 10588 KB Output is correct
65 Correct 17 ms 12888 KB Output is correct
66 Correct 20 ms 12816 KB Output is correct
67 Correct 25 ms 13404 KB Output is correct
68 Correct 12 ms 10840 KB Output is correct
69 Correct 11 ms 10588 KB Output is correct
70 Correct 11 ms 10588 KB Output is correct
71 Correct 12 ms 10684 KB Output is correct