#935784 (C++17) No.2575 Almost Increasing Sequence

提出ソース

結果

問題	No.2575 Almost Increasing Sequence
ユーザー	siro53
提出日時	2023-12-03 03:03:26
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	6,423 ms / 10,000 ms
コード長	6,468 bytes
コンパイル時間	2,594 ms
コンパイル使用メモリ	209,904 KB
実行使用メモリ	6,676 KB
スコア	8,000
最終ジャッジ日時	2023-12-03 03:05:44
合計ジャッジ時間	136,318 ms
ジャッジサーバーID （参考情報）	judge11 / judge13
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6,225 ms 6,676 KB
testcase_01	AC	6,332 ms 6,676 KB
testcase_02	AC	6,397 ms 6,676 KB
testcase_03	AC	6,363 ms 6,676 KB
testcase_04	AC	6,369 ms 6,676 KB
testcase_05	AC	6,359 ms 6,676 KB
testcase_06	AC	6,406 ms 6,676 KB
testcase_07	AC	6,423 ms 6,676 KB
testcase_08	AC	6,414 ms 6,676 KB
testcase_09	AC	6,265 ms 6,676 KB
testcase_10	AC	6,237 ms 6,676 KB
testcase_11	AC	6,271 ms 6,676 KB
testcase_12	AC	6,325 ms 6,676 KB
testcase_13	AC	6,276 ms 6,676 KB
testcase_14	AC	6,254 ms 6,676 KB
testcase_15	AC	6,248 ms 6,676 KB
testcase_16	AC	6,251 ms 6,676 KB
testcase_17	AC	6,291 ms 6,676 KB
testcase_18	AC	6,291 ms 6,676 KB
testcase_19	AC	6,314 ms 6,676 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 1 "combined.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define REVERSE(v) reverse(ALL(v))
#define SZ(v) ((int)(v).size())
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

#line 2 "/Users/siro53/kyo-pro/compro_library/modint/modint.hpp"

#line 6 "/Users/siro53/kyo-pro/compro_library/modint/modint.hpp"

template <int mod> class ModInt {
  public:
    ModInt() : x(0) {}
    ModInt(long long y)
        : x(y >= 0 ? y % umod() : (umod() - (-y) % umod()) % umod()) {}
    unsigned int val() const { return x; }
    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= umod()) x -= umod();
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += umod() - p.x) >= umod()) x -= umod();
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (unsigned int)(1ULL * x * p.x % umod());
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inv();
        return *this;
    }
    ModInt operator-() const { return ModInt(-(long long)x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
    ModInt inv() const {
        long long a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            std::swap(a -= t * b, b);
            std::swap(u -= t * v, v);
        }
        return ModInt(u);
    }
    ModInt pow(unsigned long long n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
    friend std::ostream &operator<<(std::ostream &os, const ModInt &p) {
        return os << p.x;
    }
    friend std::istream &operator>>(std::istream &is, ModInt &a) {
        long long t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }
    static constexpr int get_mod() { return mod; }

  private:
    unsigned int x;
    static constexpr unsigned int umod() { return mod; }
};
#line 78 "combined.cpp"
using mint = ModInt<MOD2>;

int LIS(const vector<int>& p) {
    int n = SZ(p);
    vector<int> dp(n+1, INF);
    REP(i, n) {
        int idx = lower_bound(ALL(dp), p[i]) - dp.begin();
        dp[idx] = p[i];
    }
    return lower_bound(ALL(dp), INF) - dp.begin();
}

int LDS(const vector<int>& p) {
    int n = SZ(p);
    vector<int> dp(n+1, INF);
    REP(i, n) {
        int idx = lower_bound(ALL(dp), -p[i]) - dp.begin();
        dp[idx] = -p[i];
    }
    return lower_bound(ALL(dp), INF) - dp.begin();
}

mint f(int N, int K) {
    vector<int> p(N);
    iota(ALL(p), 1);
    mint ans = 0;
    vector<int> cnt(N+1);
    do {
        if(LDS(p) != 3) continue;
        int len = LIS(p);
        cnt[len]++;
        ans += mint(len).pow(K);
    } while(next_permutation(ALL(p)));
    return ans;
}

void naive() {
    int K;
    cin >> K;
    const int N = 10;
    cout << N << endl;
    REP(n, 1, N + 1) {
        cout << f(n, K) << " \n"[n == N];
    }
}

void solve() {
    int K;
    cin >> K;
    // https://codeforces.com/blog/entry/98167
    auto standard_tableau_count = [&](int n, const vector<int>& lambda) -> mint {
        vector<int> lambda_t(lambda[0]);
        REP(j, lambda[0]) {
            int i = 0;
            while(i < n and lambda[i] >= j+1) i++;
            lambda_t[j] = i; 
        }
        int sum = 0;
        mint num = 1, div = 1;
        REP(i, n) sum += lambda[i];
        REP(i, 1, sum+1) num *= i;
        REP(i, SZ(lambda)) {
            REP(j, lambda[i]) {
                ll mult = 1 + (lambda[i] - j - 1) + (lambda_t[j] - i - 1);
                div *= mult;
            }
        }
        return num / div;
    };
    const int N = 400;
    cout << N << endl;
    REP(n, 1, N+1) {
        mint ans = 0;
        REP(i, 1, n+1) REP(j, i+1) {
            int k = n - i - j;
            if(k < 1) continue;
            if(!(i >= j and j >= k)) continue;
            mint c = standard_tableau_count(3, {i, j, k});
            ans += c * c * mint(i).pow(K);
        }
        cout << ans << " \n"[n == N];
        // debug(ans, n);
    }
}

int main() {
    int T{1};
    // cin >> T;
    while(T--) solve();
}

yukicoder

結果

テストケース

ソースコード