結果

問題 No.2374 ASKT Subsequences
ユーザー hibit_athibit_at
提出日時 2023-06-16 11:49:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 4,378 bytes
コンパイル時間 1,056 ms
コンパイル使用メモリ 116,924 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-29 22:32:51
合計ジャッジ時間 13,588 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 3 ms
6,944 KB
testcase_03 AC 3 ms
6,940 KB
testcase_04 AC 4 ms
6,940 KB
testcase_05 AC 3 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 10 ms
6,940 KB
testcase_08 AC 4 ms
6,940 KB
testcase_09 AC 6 ms
6,944 KB
testcase_10 AC 28 ms
6,944 KB
testcase_11 AC 139 ms
6,940 KB
testcase_12 AC 59 ms
6,944 KB
testcase_13 AC 48 ms
6,940 KB
testcase_14 AC 261 ms
6,940 KB
testcase_15 AC 415 ms
6,944 KB
testcase_16 AC 188 ms
6,944 KB
testcase_17 AC 705 ms
6,940 KB
testcase_18 AC 1,655 ms
6,940 KB
testcase_19 AC 1,435 ms
6,940 KB
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 AC 1,708 ms
6,940 KB
testcase_24 AC 1,748 ms
6,940 KB
testcase_25 AC 1,715 ms
6,944 KB
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
権限があれば一括ダウンロードができます

ソースコード

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>
#include <cassert>

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)
{
    for (int i = 0; i < (int)v.size(); i++)
    {
        os << "i = " << i << endl;
        os << v[i];
    }
    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;
}

int main()
{
    int n;
    cin >> n;
    bool n_check = 4 <= n && n <= 1000;
    assert(n_check && "Error");
    vector<int> a(n);
    rep(i, n)
    {
        cin >> a[i];
        bool a_check = 1 <= a[i] && a[i] <= 1000;
        assert(a_check && "Error");
    }
    ll ans = 0;
    for (int d = 1; d < 1e3; d++)
    {
        // debug(d);
        vector<vector<ll>> dp(n, vector<ll>(4));
        vector<vector<ll>> cp(n + 1, vector<ll>(4));
        rep(i, n)
        {
            dp[i][0] = 1;
        }
        rep(i, n)
        {
            rep(k, i)
            {
                dp[i][1] += dp[k][0] * (a[k] == a[i] - d - 10);
            }
            rep(k, i)
            {
                dp[i][2] += dp[k][1] * (a[k] == a[i] + d);
            }
            rep(k, i)
            {
                dp[i][3] += dp[k][2] * (a[k] == a[i] - d - 1);
            }
            rep(k, 4)
            {
                cp[i + 1][k] = cp[i][k] + dp[i][k];
            }
        }
        // cout << dp << endl;
        // cout << cp << endl;
        ans += cp[n][3];
    }
    cout << ans << endl;
}
0