結果

問題 No.1496 不思議な数え上げ
ユーザー rniyarniya
提出日時 2021-05-09 16:47:57
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 333 ms / 3,000 ms
コード長 5,801 bytes
コンパイル時間 4,450 ms
コンパイル使用メモリ 213,396 KB
実行使用メモリ 19,568 KB
最終ジャッジ日時 2023-10-19 02:27:20
合計ジャッジ時間 21,626 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 166 ms
19,568 KB
testcase_04 AC 168 ms
19,568 KB
testcase_05 AC 165 ms
19,568 KB
testcase_06 AC 183 ms
19,568 KB
testcase_07 AC 181 ms
19,568 KB
testcase_08 AC 181 ms
19,568 KB
testcase_09 AC 181 ms
19,568 KB
testcase_10 AC 182 ms
19,568 KB
testcase_11 AC 182 ms
19,568 KB
testcase_12 AC 165 ms
19,568 KB
testcase_13 AC 171 ms
19,568 KB
testcase_14 AC 177 ms
19,568 KB
testcase_15 AC 170 ms
19,568 KB
testcase_16 AC 172 ms
19,568 KB
testcase_17 AC 297 ms
19,568 KB
testcase_18 AC 299 ms
19,568 KB
testcase_19 AC 333 ms
19,568 KB
testcase_20 AC 295 ms
19,568 KB
testcase_21 AC 294 ms
19,568 KB
testcase_22 AC 294 ms
19,568 KB
testcase_23 AC 292 ms
19,568 KB
testcase_24 AC 288 ms
19,568 KB
testcase_25 AC 290 ms
19,568 KB
testcase_26 AC 293 ms
19,568 KB
testcase_27 AC 291 ms
19,568 KB
testcase_28 AC 281 ms
19,568 KB
testcase_29 AC 294 ms
19,568 KB
testcase_30 AC 303 ms
19,568 KB
testcase_31 AC 297 ms
19,568 KB
testcase_32 AC 247 ms
17,456 KB
testcase_33 AC 122 ms
11,384 KB
testcase_34 AC 110 ms
10,856 KB
testcase_35 AC 3 ms
4,372 KB
testcase_36 AC 262 ms
17,984 KB
testcase_37 AC 134 ms
11,912 KB
testcase_38 AC 117 ms
11,384 KB
testcase_39 AC 171 ms
14,288 KB
testcase_40 AC 87 ms
9,536 KB
testcase_41 AC 185 ms
14,552 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    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, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> P(N);
    vector<ll> A(N);
    for (int& x : P) cin >> x;
    for (ll& x : A) cin >> x;

    set<int> s;
    s.emplace(-1);
    s.emplace(N);
    vector<int> idx(N), left(N), right(N), pos(N + 1);
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](int a, int b) { return P[a] < P[b]; });
    for (int& x : idx) {
        auto itr = s.upper_bound(x);
        right[x] = *itr;
        left[x] = *(--itr);
        pos[P[x]] = x;
        s.emplace(x);
    }
    vector<ll> rui(N + 1, 0);
    for (int i = 0; i < N; i++) rui[i + 1] = rui[i] + P[i];

    auto calc_left = [&](int l, int r, ll sum) {  // [l,r)でr-1から始まって和がsumを超えない最長の区間長
        int lb = l - 1, ub = r + 1;
        while (ub - lb > 1) {
            int mid = (ub + lb) >> 1;
            (rui[r] - rui[mid] <= sum ? ub : lb) = mid;
        }
        return r - ub + 1;
    };
    auto calc_right = [&](int l, int r, ll sum) {  // [l,r)でlから始まって和がsumを超えない最長の区間長
        int lb = l - 1, ub = r + 1;
        while (ub - lb > 1) {
            int mid = (ub + lb) >> 1;
            (rui[mid] - rui[l] <= sum ? lb : ub) = mid;
        }
        return lb - l + 1;
    };

    for (int i = 1; i <= N; i++) {
        int m = pos[i], l = left[m], r = right[m];
        ll res = 0, sum = A[i - 1];
        if (m - l < r - m) {
            for (int j = m; j > l; j--) {
                sum -= P[j];
                res += calc_right(m + 1, r, sum);
            }
        } else {
            for (int j = m; j < r; j++) {
                sum -= P[j];
                res += calc_left(l + 1, m, sum);
            }
        }
        cout << res << '\n';
    }
    return 0;
}
0