結果

問題 No.1079 まお
ユーザー minatominato
提出日時 2020-10-18 07:14:09
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 370 ms / 2,000 ms
コード長 5,577 bytes
コンパイル時間 3,673 ms
コンパイル使用メモリ 233,008 KB
実行使用メモリ 9,360 KB
最終ジャッジ日時 2023-09-28 08:48:08
合計ジャッジ時間 9,792 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 3 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 3 ms
4,376 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 3 ms
4,380 KB
testcase_11 AC 3 ms
4,376 KB
testcase_12 AC 151 ms
6,228 KB
testcase_13 AC 147 ms
5,864 KB
testcase_14 AC 224 ms
5,880 KB
testcase_15 AC 232 ms
6,724 KB
testcase_16 AC 241 ms
6,456 KB
testcase_17 AC 313 ms
7,460 KB
testcase_18 AC 240 ms
5,100 KB
testcase_19 AC 333 ms
6,424 KB
testcase_20 AC 328 ms
7,576 KB
testcase_21 AC 303 ms
7,244 KB
testcase_22 AC 324 ms
9,360 KB
testcase_23 AC 318 ms
7,940 KB
testcase_24 AC 334 ms
7,456 KB
testcase_25 AC 344 ms
6,908 KB
testcase_26 AC 370 ms
8,000 KB
testcase_27 AC 16 ms
4,376 KB
testcase_28 AC 129 ms
4,904 KB
testcase_29 AC 134 ms
6,584 KB
testcase_30 AC 133 ms
6,460 KB
testcase_31 AC 21 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
istream& operator>>(istream& is, __int128_t& x) {
    x = 0;
    string s;
    is >> s;
    int n = int(s.size()), it = 0;
    if (s[0] == '-') it++;
    for (; it < n; it++) x = (x * 10 + s[it] - '0');
    if (s[0] == '-') x = -x;
    return is;
}
ostream& operator<<(ostream& os, __int128_t x) {
    if (x == 0) return os << 0;
    if (x < 0) os << '-', x = -x;
    deque<int> deq;
    while (x) deq.emplace_front(x % 10), x /= 10;
    for (int e : deq) os << e;
    return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}
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];
    }
    return os << "}";
}
template<class Container> inline int SZ(Container& v) { return int(v.size()); }
template<typename T> inline void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); }
template<class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) {a = b; return true ;} return false ;}
template<class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) {a = b; return true ;} return false ;}
inline int topbit(int x) { return x == 0 ? -1 : 31 - __builtin_clz(x); }
inline int topbit(long long x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); }
inline int botbit(int x) { return x == 0 ? 32 : __builtin_ctz(x); }
inline int botbit(long long x) { return x == 0 ? 64 : __builtin_ctzll(x); }
inline int popcount(int x) { return __builtin_popcount(x); }
inline int popcount(long long x) { return __builtin_popcountll(x); }
inline int kthbit(long long x, int k) { return (x>>k) & 1; }
inline constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x-1) * 10; }
namespace detail {
    template<typename Tp, int Nb>
    auto make_vector(vector<int>& sizes, Tp const& x) {
        if constexpr (Nb == 1) {
            return vector(sizes[0], x);
        } else {
            int size = sizes[Nb-1];
            sizes.pop_back();
            return vector(size, make_vector<Tp, Nb-1>(sizes, x));
        }
    }
}
template<typename Tp, int Nb>
auto make_vector(int const(&sizes)[Nb], Tp const& x = Tp()) {
    vector<int> s(Nb);
    for (int i = 0; i < Nb; i++) s[i] = sizes[Nb-i-1];
    return detail::make_vector<Tp, Nb>(s, x);
}
inline void print() { cout << "\n"; }
template<class T>
inline void print(const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        if (i) cout << " ";
        cout << v[i];
    }
    print();
}
template<class T, class... Args>
inline void print(const T& x, const Args& ... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
inline void debug_out() { cerr << endl; }
template <class T, class... Args>
inline void debug_out(const T& x, const Args& ... args) {
    cerr << " " << x;
    debug_out(args...);
}
#define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

constexpr int INF = TEN(9)+1;
int main() {   
    int N,K; cin >> N >> K;
    vector<int> A(N);
    rep(i,N) cin >> A[i];

    ll ans = 0;
    auto rec=[&](auto self, int l, int r)->void {
        if (r-l==1) {
            if (A[l]*2==K) ans++;
            return;
        }

        int m = (l+r)/2;
        self(self,l,m);
        self(self,m,r);
        int MIN = INF;
        int cur_r = m;
        bool ok = true;
        map<int, pll> R;
        for (int pos = m-1; pos >= l; pos--) {
            if (MIN==A[pos]) ok = false;
            if (chmin(MIN,A[pos])) ok = true;
            if (!ok) continue;
            while (cur_r < r and A[cur_r] > MIN) {
                auto[len,cnt] = R[A[cur_r]];
                len += cur_r - m + 1;
                cnt++;
                R[A[cur_r]] = pll(len,cnt);
                cur_r++;
            }
            if (R.count(K - A[pos])) {
                auto[len,cnt] = R[K - A[pos]];
                ans += len + cnt*(m-pos);
            }
        }
        
        MIN = INF;
        int cur_l = m-1;
        ok = true;
        map<int, pll> L;
        for (int pos = m; pos < r; pos++) {
            if (MIN==A[pos]) ok = false;
            if (chmin(MIN,A[pos])) ok = true;
            if (!ok) continue;
            while (cur_l >= l and A[cur_l] > MIN) {
                auto[len,cnt] = L[A[cur_l]];
                len += m - cur_l;
                cnt++;
                L[A[cur_l]] = pll(len,cnt);
                cur_l--;
            }
            if (L.count(K - A[pos])) {
                auto[len,cnt] = L[K - A[pos]];
                ans += len + cnt*(pos-m+1);
            }
        }
        return;
    };

    rec(rec,0,N);
    cout << ans << ln;
}
0