結果

問題 No.1496 不思議な数え上げ
ユーザー 👑 hitonanodehitonanode
提出日時 2021-04-30 23:24:18
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 300 ms / 3,000 ms
コード長 6,055 bytes
コンパイル時間 2,366 ms
コンパイル使用メモリ 210,020 KB
実行使用メモリ 18,740 KB
最終ジャッジ日時 2023-09-26 08:29:00
合計ジャッジ時間 14,814 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 213 ms
18,620 KB
testcase_04 AC 213 ms
18,504 KB
testcase_05 AC 216 ms
18,540 KB
testcase_06 AC 173 ms
18,508 KB
testcase_07 AC 172 ms
18,580 KB
testcase_08 AC 173 ms
18,624 KB
testcase_09 AC 177 ms
18,540 KB
testcase_10 AC 176 ms
18,740 KB
testcase_11 AC 176 ms
18,568 KB
testcase_12 AC 222 ms
18,580 KB
testcase_13 AC 169 ms
18,644 KB
testcase_14 AC 167 ms
18,536 KB
testcase_15 AC 170 ms
18,548 KB
testcase_16 AC 171 ms
18,692 KB
testcase_17 AC 300 ms
18,620 KB
testcase_18 AC 298 ms
18,580 KB
testcase_19 AC 299 ms
18,616 KB
testcase_20 AC 293 ms
18,564 KB
testcase_21 AC 289 ms
18,576 KB
testcase_22 AC 292 ms
18,572 KB
testcase_23 AC 282 ms
18,652 KB
testcase_24 AC 293 ms
18,568 KB
testcase_25 AC 290 ms
18,564 KB
testcase_26 AC 289 ms
18,580 KB
testcase_27 AC 247 ms
18,572 KB
testcase_28 AC 257 ms
18,648 KB
testcase_29 AC 259 ms
18,584 KB
testcase_30 AC 260 ms
18,696 KB
testcase_31 AC 256 ms
18,648 KB
testcase_32 AC 248 ms
16,740 KB
testcase_33 AC 122 ms
10,816 KB
testcase_34 AC 109 ms
10,128 KB
testcase_35 AC 3 ms
4,376 KB
testcase_36 AC 251 ms
16,952 KB
testcase_37 AC 122 ms
11,180 KB
testcase_38 AC 119 ms
10,648 KB
testcase_39 AC 169 ms
13,568 KB
testcase_40 AC 89 ms
9,044 KB
testcase_41 AC 175 ms
13,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

int main() {
    int N;
    cin >> N;
    vector<int> P(N);
    vector<lint> A(N);
    cin >> P >> A;
    vector<lint> PP(N + 1);
    REP(i, N) PP[i + 1] += PP[i] + P[i];

    set<int> se;
    FOR(i, -1, N + 3) se.insert(i);

    vector<int> pinv(N + 1);
    REP(i, N) pinv[P[i]] = i;

    vector<lint> ret(N + 1);
    IFOR(lo, 1, N + 1) {
        const int c = pinv[lo];
        se.erase(c);
        const auto itr = se.lower_bound(c);
        int rlim = *itr;
        int llim = *prev(itr) + 1;
        lint cum = 0;
        if (rlim - c - 1 > c - llim) {
            dbg("A");
            IFOR(L, llim, c + 1) {
                // マージテク あわない
                cum += P[L];
                if (cum > A[lo - 1]) break;
                int safe = c + 1, bad = rlim + 1;
                while (bad - safe > 1) {
                    int rc = (safe + bad) / 2;
                    lint tmp = PP[rc] - PP[L];
                    (tmp <= A[lo - 1] ? safe : bad) = rc;
                }
                // int r = lower_bound(PP.begin() + c + 1, PP.begin() + rlim + 1, A[lo - 1] - PP[L]) - PP.begin() - 1;
                ret[lo] += safe - c;
            }
        } else {
            dbg("B");
            dbg((pint(llim, rlim)));
            FOR(R, c + 1, rlim + 1) {
                cum += P[R - 1];
                if (cum > A[lo - 1]) break;
                int safe = c, bad = llim - 1;
                while (safe - bad > 1) {
                    int rc = (safe + bad) / 2;
                    lint tmp = PP[R] - PP[rc];
                    (tmp <= A[lo - 1] ? safe : bad) = rc;
                }
                ret[lo] += c - safe + 1;
                // int l = lower_bound(PP.begin() + llim, PP.begin() + c, PP[R] - A[lo - 1]) - PP.begin();
                // ret[lo] += c - l;
            }
        }
    }
    FOR(lo, 1, N + 1) cout << ret[lo] << '\n';
}
0