結果

問題 No.2374 ASKT Subsequences
ユーザー hibit_athibit_at
提出日時 2023-06-10 00:09:39
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,448 bytes
コンパイル時間 1,202 ms
コンパイル使用メモリ 122,632 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-09-12 09:49:23
合計ジャッジ時間 11,256 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 3 ms
4,376 KB
testcase_11 AC 11 ms
4,380 KB
testcase_12 AC 5 ms
4,376 KB
testcase_13 AC 4 ms
4,376 KB
testcase_14 AC 23 ms
4,376 KB
testcase_15 AC 38 ms
4,380 KB
testcase_16 AC 16 ms
4,376 KB
testcase_17 AC 68 ms
4,376 KB
testcase_18 AC 171 ms
4,376 KB
testcase_19 AC 145 ms
4,376 KB
testcase_20 AC 337 ms
4,380 KB
testcase_21 AC 435 ms
4,376 KB
testcase_22 AC 274 ms
4,376 KB
testcase_23 AC 175 ms
4,376 KB
testcase_24 AC 176 ms
4,380 KB
testcase_25 AC 8 ms
4,380 KB
testcase_26 AC 784 ms
4,376 KB
testcase_27 AC 26 ms
4,380 KB
testcase_28 AC 162 ms
4,376 KB
testcase_29 AC 308 ms
4,376 KB
testcase_30 TLE -
権限があれば一括ダウンロードができます

ソースコード

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)
{
    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;
    vector<int> a(n);
    cin >> a;
    map<int, int> total_buf;
    rep(i, n)
    {
        total_buf[a[i]]++;
    }
    // debug(total_buf);
    ll ans = 0;
    rep(i, n)
    {
        // debug(i);
        total_buf[a[i]]--;
        if (total_buf[a[i]] == 0)
        {
            total_buf.erase(a[i]);
        }
        map<int, int> right_buf = total_buf;
        map<int, int> left_buf;
        for (int j = i + 1; j < n; j++)
        {
            right_buf[a[j]]--;
            if (right_buf[a[j]] == 0)
            {
                right_buf.erase(a[j]);
            }
            if (j - 1 > i)
            {
                left_buf[a[j - 1]]++;
            }
            if (a[i] + 10 != a[j])
            {
                continue;
            }
            // debug(left_buf);
            // debug(right_buf);
            for (auto [key, val] : left_buf)
            {
                ll estimate = key - a[i] - 10;
                // debug(estimate);
                if(estimate <= 0){
                    continue;
                }
                ans += right_buf[key+1] * val;
            }
        }
    }
    cout << ans << endl;
}
0