Submission #967941

#	Time	Username	Problem	Language	Result	Execution time	Memory
967941		gaga999	Binaria (CCO23_day1problem1)	C++17	25 / 25	25 ms	14200 KiB

Main

// #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 / 3
• Subtask 2: 3 / 3
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 7 / 7