結果
| 問題 | No.1496 不思議な数え上げ |
| ユーザー |
 kaage
|
| 提出日時 | 2021-04-11 15:22:23 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
RE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 11,983 bytes |
| コンパイル時間 | 3,090 ms |
| コンパイル使用メモリ | 169,740 KB |
| 実行使用メモリ | 11,536 KB |
| 最終ジャッジ日時 | 2023-09-13 16:17:48 |
| 合計ジャッジ時間 | 17,192 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge14 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,380 KB |
| testcase_01 | AC | 2 ms
4,380 KB |
| testcase_02 | AC | 1 ms
4,380 KB |
| testcase_03 | RE | - |
| testcase_04 | RE | - |
| testcase_05 | RE | - |
| testcase_06 | RE | - |
| testcase_07 | RE | - |
| testcase_08 | RE | - |
| testcase_09 | RE | - |
| testcase_10 | RE | - |
| testcase_11 | RE | - |
| testcase_12 | RE | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | RE | - |
| testcase_16 | RE | - |
| testcase_17 | RE | - |
| testcase_18 | RE | - |
| testcase_19 | RE | - |
| testcase_20 | RE | - |
| testcase_21 | RE | - |
| testcase_22 | RE | - |
| testcase_23 | RE | - |
| testcase_24 | RE | - |
| testcase_25 | RE | - |
| testcase_26 | RE | - |
| testcase_27 | RE | - |
| testcase_28 | RE | - |
| testcase_29 | RE | - |
| testcase_30 | RE | - |
| testcase_31 | RE | - |
| testcase_32 | RE | - |
| testcase_33 | RE | - |
| testcase_34 | RE | - |
| testcase_35 | RE | - |
| testcase_36 | RE | - |
| testcase_37 | RE | - |
| testcase_38 | RE | - |
| testcase_39 | RE | - |
| testcase_40 | RE | - |
| testcase_41 | RE | - |
ソースコード
#line 2 "library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#ifndef __clang__
#ifdef ONLINE_JUDGE
#pragma GCC target("avx512f")
#elif defined EVAL
#else
#pragma GCC target("avx2")
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define REP(i, n) for (int i = 1; i <= int(n); i++)
#define all(V) V.begin(), V.end()
using i128 = __int128_t;
using u128 = __uint128_t;
using uint = unsigned int;
using lint = long long;
using ulint = unsigned long long;
using IP = std::pair<int, int>;
using LP = std::pair<lint, lint>;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
int popcount(uint x) {
#if __cplusplus >= 202002L
return std::popcount(x);
#else
#ifndef __clang__
return __builtin_popcount(x);
#endif
#endif
x = (x & 0x55555555) + (x >> 1 & 0x55555555);
x = (x & 0x33333333) + (x >> 2 & 0x33333333);
x = (x & 0x0f0f0f0f) + (x >> 4 & 0x0f0f0f0f);
x = (x & 0x00ff00ff) + (x >> 8 & 0x00ff00ff);
return (x & 0x0000ffff) + (x >> 16 & 0x0000ffff);
}
template <class F>
inline constexpr decltype(auto) lambda_fix(F&& f) {
return [f = std::forward<F>(f)](auto&&... args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
template <class T>
constexpr std::vector<T> make_vec(size_t n) {
return std::vector<T>(n);
}
template <class T, class... Args>
constexpr auto make_vec(size_t n, Args&&... args) {
return std::vector<decltype(make_vec<T>(args...))>(
n, make_vec<T>(std::forward<Args>(args)...));
}
template <class T, class U>
constexpr inline bool chmax(T& lhs, const U& rhs) noexcept {
if (lhs < rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U>
constexpr inline bool chmin(T& lhs, const U& rhs) noexcept {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
constexpr inline lint gcd(lint a, lint b) noexcept {
while (b) {
lint c = a;
a = b;
b = c % b;
}
return a;
}
inline lint lcm(lint a, lint b) noexcept { return a / gcd(a, b) * b; }
constexpr bool isprime(lint n) noexcept {
if (n == 1) return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
template <class T>
constexpr T mypow(T a, lint b) noexcept {
T res(1);
while (true) {
if (b & 1) res *= a;
b >>= 1;
if (!b) break;
a *= a;
}
return res;
}
constexpr lint modpow(lint a, lint b, lint m) noexcept {
a %= m;
lint res(1);
while (b) {
if (b & 1) {
res *= a;
res %= m;
}
a *= a;
a %= m;
b >>= 1;
}
return res;
}
template <class T>
constexpr void printArray(const std::vector<T>& vec, char split = ' ') {
rep(i, vec.size()) {
std::cout << vec[i];
std::cout << (i == (int)vec.size() - 1 ? '\n' : split);
}
}
template <class InputIter>
constexpr void printArray(InputIter l, InputIter r, char split = ' ') {
auto rprev = std::prev(r);
for (auto i = l; i != r; i++) {
std::cout << *i;
std::cout << (i == rprev ? '\n' : split);
}
}
LP extGcd(lint a, lint b) noexcept {
if (b == 0) return {1, 0};
LP s = extGcd(b, a % b);
std::swap(s.first, s.second);
s.second -= a / b * s.first;
return s;
}
LP ChineseRem(const lint& b1, const lint& m1, const lint& b2,
const lint& m2) noexcept {
auto p = extGcd(m1, m2);
lint g = gcd(m1, m2), l = m1 / g * m2;
lint tmp = (b2 - b1) / g * p.first % (m2 / g);
lint r = (b1 + m1 * tmp + l) % l;
return {r, l};
}
int LCS(const std::string& a, const std::string& b) {
auto dp = make_vec<int>(a.size() + 1, b.size() + 1);
rep(i, a.size()) {
rep(j, b.size()) {
chmax(dp[i + 1][j], dp[i][j]);
chmax(dp[i][j + 1], dp[i][j]);
if (a[i] == b[j]) chmax(dp[i + 1][j + 1], dp[i][j] + 1);
}
chmax(dp[i + 1][b.size()], dp[i][b.size()]);
}
rep(j, b.size()) chmax(dp[a.size()][j + 1], dp[a.size()][j]);
return dp[a.size()][b.size()];
}
template <class T, std::enable_if_t<std::is_convertible<int, T>::value,
std::nullptr_t> = nullptr>
void compress(std::vector<T>& vec) {
auto tmp = vec;
std::sort(all(tmp));
tmp.erase(std::unique(all(tmp)), tmp.end());
for (T& i : vec) i = std::lower_bound(all(tmp), i) - tmp.begin();
}
template <class T>
void compress(T* l, T* r) {
std::vector<T> tmp(l, r);
std::sort(all(tmp));
tmp.erase(std::unique(all(tmp)), tmp.end());
for (auto i = l; i < r; i++) {
*i = std::lower_bound(all(tmp), *i) - tmp.begin();
}
}
template <class InputIter>
void compress(InputIter l, InputIter r) {
std::vector<typename InputIter::value_type> tmp(l, r);
std::sort(all(tmp));
tmp.erase(std::unique(all(tmp)), tmp.end());
for (auto i = l; i < r; i++) {
*i = std::lower_bound(all(tmp), *i) - tmp.begin();
}
}
#line 3 "library/graph/UnionFind.hpp"
class UnionFind {
protected:
std::vector<int> par, size;
public:
UnionFind() {}
UnionFind(int size) { init(size); }
void init(int size) {
par.resize(size);
this->size.resize(size, 1);
std::iota(all(par), 0);
}
int find(int n) {
if (par[n] == n) return n;
return par[n] = find(par[n]);
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m) return;
int a = n, b = m;
if (size[a] > size[b]) std::swap(a, b);
par[a] = b;
size[b] += size[a];
}
bool same(int n, int m) { return find(n) == find(m); }
int getsize(int n) { return size[find(n)]; }
bool is_root(int n) { return find(n) == n; }
};
/**
* @title Disjoint set
*/
#line 3 "library/other/FastIO.hpp"
namespace FastIO {
static constexpr size_t buf_size = 1 << 18;
static constexpr size_t integer_size = 19;
static char inbuf[buf_size + 1] = {};
static char outbuf[buf_size + 1] = {};
class Scanner {
size_t pos = 0, end = buf_size;
void load() {
end = fread(inbuf, 1, buf_size, stdin);
inbuf[end] = '\0';
}
void ignore_space() {
while (inbuf[pos] <= ' ') {
if (__builtin_expect(++pos == end, 0)) reload();
}
}
char next() { return inbuf[pos++]; }
char next_nonspace() {
ignore_space();
return inbuf[pos++];
}
public:
Scanner() { load(); }
void reload() {
size_t length = end - pos;
memmove(inbuf, inbuf + pos, length);
end = length + fread(inbuf + length, 1, buf_size - length, stdin);
inbuf[end] = '\0';
pos = 0;
}
void scan() {}
void scan(char& c) { c = next_nonspace(); }
void scan(std::string& s) {
ignore_space();
s = "";
do {
size_t start = pos;
while (inbuf[pos] > ' ') pos++;
s += std::string(inbuf + start, inbuf + pos);
if (inbuf[pos] != '\0') break;
reload();
} while (true);
}
template <typename T, std::enable_if_t<std::is_integral<T>::value,
std::nullptr_t> = nullptr>
void scan(T& x) {
char c = next_nonspace();
if (__builtin_expect(pos + integer_size >= end, 0)) reload();
bool minus = false;
if (c == '-')
minus = true, x = 0;
else
x = c & 15;
while ((c = next()) >= '0') x = x * 10 + (c & 15);
if (minus) x = -x;
}
template <typename T, class... Args>
void scan(T& x, Args&... args) {
scan(x);
scan(args...);
}
template <typename T>
Scanner& operator>>(T& x) {
scan(x);
return *this;
}
};
class Printer {
static constexpr size_t block_size = 10000;
static const std::unique_ptr<char[]> block_str;
size_t pos = 0;
static constexpr lint powers[] = {1,
10,
100,
1000,
10000,
100000,
1000000,
10000000,
100000000,
1000000000,
10000000000,
100000000000,
1000000000000,
10000000000000,
100000000000000,
1000000000000000,
10000000000000000,
100000000000000000,
1000000000000000000};
static std::unique_ptr<char[]> precompute() {
std::unique_ptr<char[]> res(new char[block_size * 4]);
rep(i, block_size) {
size_t j = 4, k = i;
while (j--) {
res[i * 4 + j] = k % 10 + '0';
k /= 10;
}
}
return res;
}
template <typename T>
size_t integer_digits(T n) {
if (n >= powers[9]) {
if (n >= powers[13]) {
if (n >= powers[16]) {
if (n >= powers[17]) {
if (n >= powers[18]) return 19;
return 18;
}
return 17;
}
if (n >= powers[14]) {
if (n >= powers[15]) return 16;
return 15;
}
return 14;
}
if (n >= powers[11]) {
if (n >= powers[12]) return 13;
return 12;
}
if (n >= powers[10]) return 11;
return 10;
}
if (n >= powers[4]) {
if (n >= powers[7]) {
if (n >= powers[8]) return 9;
return 8;
}
if (n >= powers[5]) {
if (n >= powers[6]) return 7;
return 6;
}
return 5;
}
if (n >= powers[2]) {
if (n >= powers[3]) return 4;
return 3;
}
if (n >= powers[1]) return 2;
return 1;
}
public:
Printer() = default;
~Printer() { flush(); }
void flush() {
fwrite(outbuf, 1, pos, stdout);
pos = 0;
}
void print() {}
void print(char c) {
outbuf[pos++] = c;
if (__builtin_expect(pos == buf_size, 0)) flush();
}
void print(char* s) {
while (*s != 0) {
outbuf[pos++] = *s++;
if (pos == buf_size) flush();
}
}
template <typename T, std::enable_if_t<std::is_integral<T>::value,
std::nullptr_t> = nullptr>
void print(T x) {
if (__builtin_expect(pos + integer_size >= buf_size, 0)) flush();
if (x < 0) print('-'), x = -x;
size_t digit = integer_digits(x);
size_t len = digit;
while (len >= 4) {
len -= 4;
memcpy(outbuf + pos + len,
block_str.get() + (x % block_size) * 4, 4);
x /= 10000;
}
memcpy(outbuf + pos, block_str.get() + x * 4 + 4 - len, len);
pos += digit;
}
template <typename T, class... Args>
void print(const T& x, const Args&... args) {
print(x);
print(' ');
print(args...);
}
template <class... Args>
void println(const Args&... args) {
print(args...);
print('\n');
}
template <typename T>
Printer& operator<<(const T& x) {
print(x);
return *this;
}
};
const std::unique_ptr<char[]> Printer::block_str = Printer::precompute();
}; // namespace FastIO
/**
* @title Fast IO library
*/
#line 4 "main.cpp"
int N, rev[200010];
lint cum[200010];
std::vector<lint> P, A, ans;
FastIO::Scanner cin;
FastIO::Printer cout;
int main() {
cin >> N;
P.resize(N + 1), A.resize(N + 1), ans.resize(N + 1);
REP(i, N) {
cin >> P[i];
rev[P[i]] = i;
cum[i] = P[i];
}
REP(i, N - 1) cum[i + 1] += cum[i];
REP(i, N) cin >> A[i];
UnionFind uf(N + 2);
for (int i = N; i > 0; i--) {
int l = 0, r = 0;
if (rev[i] != 1 && P[rev[i] - 1] > i) l = uf.getsize(rev[i] - 1);
if (rev[i] != N && i < P[rev[i] + 1]) r = uf.getsize(rev[i] + 1);
if (l < r) {
for (int j = rev[i]; j >= rev[i] - l; j--) {
int x =
std::upper_bound(cum, cum + N + 1, A[i] + cum[j - 1]) - cum;
ans[i] += std::min(r + 1, std::max(0, x - rev[i]));
}
} else {
for (int j = rev[i]; j <= rev[i] + r; j++) {
int x = std::lower_bound(cum, cum + N + 1, cum[j] - A[i]) - cum;
ans[i] += std::min(l + 1, std::max(0, rev[i] - x));
}
}
if (rev[i] != 1 && P[rev[i] - 1] > i) uf.unite(rev[i] - 1, rev[i]);
if (rev[i] != N && i < P[rev[i] + 1]) uf.unite(rev[i], rev[i] + 1);
}
REP(i, N) cout << ans[i] << '\n';
return 0;
}