結果

問題 No.2792 Security Cameras on Young Diagram
ユーザー hibit_athibit_at
提出日時 2024-06-21 22:15:22
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 91 ms / 2,000 ms
コード長 4,746 bytes
コンパイル時間 1,320 ms
コンパイル使用メモリ 115,620 KB
実行使用メモリ 7,868 KB
最終ジャッジ日時 2024-06-24 18:45:34
合計ジャッジ時間 2,738 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 8 ms
7,168 KB
testcase_01 AC 9 ms
7,168 KB
testcase_02 AC 8 ms
7,160 KB
testcase_03 AC 9 ms
7,096 KB
testcase_04 AC 9 ms
7,168 KB
testcase_05 AC 9 ms
7,092 KB
testcase_06 AC 9 ms
7,168 KB
testcase_07 AC 9 ms
7,144 KB
testcase_08 AC 9 ms
7,168 KB
testcase_09 AC 9 ms
7,164 KB
testcase_10 AC 9 ms
7,168 KB
testcase_11 AC 9 ms
7,168 KB
testcase_12 AC 66 ms
7,560 KB
testcase_13 AC 55 ms
7,468 KB
testcase_14 AC 63 ms
7,532 KB
testcase_15 AC 46 ms
7,424 KB
testcase_16 AC 67 ms
7,528 KB
testcase_17 AC 78 ms
7,672 KB
testcase_18 AC 43 ms
7,296 KB
testcase_19 AC 41 ms
7,228 KB
testcase_20 AC 50 ms
7,424 KB
testcase_21 AC 10 ms
7,168 KB
testcase_22 AC 9 ms
7,168 KB
testcase_23 AC 91 ms
7,868 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>
#include <complex>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p)
{
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i] << endl;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)
{
    int n = v.size();
    int m = v[0].size();
    int p = v[0][0].size();
    rep(k, p)
    {
        os << "k = " << k << endl;
        rep(i, n)
        {
            rep(j, m)
            {
                os << v[i][j][k];
                if (j < m - 1)
                {
                    os << " ";
                }
                else
                {
                    os << endl;
                }
            }
        }
    }
    return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}

template <typename T, typename S>
ostream &operator<<(ostream &os, map<T, S> &mp)
{
    for (auto &[key, val] : mp)
    {
        os << key << ":" << val << " ";
    }
    cout << endl;
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, set<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, multiset<T> st)
{
    auto itr = st.begin();
    for (int i = 0; i < (int)st.size(); i++)
    {
        os << *itr << (i + 1 != (int)st.size() ? " " : "");
        itr++;
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, queue<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, deque<T> q)
{
    while (q.size())
    {
        os << q.front() << " ";
        q.pop_front();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, stack<T> st)
{
    while (st.size())
    {
        os << st.top() << " ";
        st.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T> pq)
{
    while (pq.size())
    {
        os << pq.top() << " ";
        pq.pop();
    }
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, priority_queue<T, vector<T>, greater<T>> mpq)
{
    while (mpq.size())
    {
        os << mpq.top() << " ";
        mpq.pop();
    }
    return os;
}
#include <atcoder/modint>
using namespace atcoder;
using mint=modint998244353;
ostream &operator<<(ostream &os, mint &i)
{
    os << i.val();
    return os;
}

ostream &operator<<(ostream &os, const vector<mint> &v)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << v[i].val() << (i + 1 != (int)v.size() ? " " : "");
    }
    return os;
}
int main(){
    ll n;
    cin >> n;
    vector<ll> a(n);
    cin >> a;
    a.push_back(0);
    vector<mint> factor(1e6 + 1, 1);
    rep(i, 1e6)
    {
        factor[i + 1] = factor[i] * (i + 1);
    }
    auto comb = [&](int n, int r)
    {
        return factor[n] / factor[n - r] / factor[r];
    };
    auto H = [&](int n, int r)
    {
        return comb(n + r - 1, r - 1);
    };
    // debug(a);
    mint ans = 0;
    int now = 0;
    for(int i=n-1;i>=0;i--){
        // debug(i);
        if(now == a[i]){
            ans += comb(i+now-1,now-1);
        }else{
            while(now<a[i]){
                ans += comb(i+now,now);
                now++;
            }
            ans += comb(i+now-1,now-1);
        }
        // debug(now);
        // debug(ans);
    }
    cout << ans << endl;
}
0