結果

問題 No.1535 五七五
ユーザー keijakkeijak
提出日時 2021-06-06 18:43:41
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 936 ms / 2,000 ms
コード長 2,819 bytes
コンパイル時間 12,003 ms
コンパイル使用メモリ 388,464 KB
最終ジャッジ日時 2025-01-22 04:06:36
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define REP_(i, a_, b_, a, b, ...) \
for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using i64 = long long;
#include <boost/multiprecision/cpp_int.hpp>
using i128 = boost::multiprecision::int128_t;
using Int = boost::multiprecision::cpp_int;
template <typename T, typename U>
inline bool chmax(T &a, U b) {
return a < b and ((a = std::move(b)), true);
}
template <typename T, typename U>
inline bool chmin(T &a, U b) {
return a > b and ((a = std::move(b)), true);
}
template <typename T>
inline int ssize(const T &a) {
return (int)std::size(a);
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
for (auto &x : a) is >> x;
return is;
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) {
return os << "(" << a.first << ", " << a.second << ")";
}
template <typename Container>
std::ostream &print_seq(const Container &a, std::string_view sep = " ",
std::string_view ends = "\n",
std::ostream &os = std::cout) {
auto b = std::begin(a), e = std::end(a);
for (auto it = std::begin(a); it != e; ++it) {
if (it != b) os << sep;
os << *it;
}
return os << ends;
}
template <typename T, typename = void>
struct is_iterable : std::false_type {};
template <typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
decltype(std::end(std::declval<T>()))>>
: std::true_type {};
template <typename T, typename = std::enable_if_t<
is_iterable<T>::value &&
!std::is_same<T, std::string_view>::value &&
!std::is_same<T, std::string>::value>>
std::ostream &operator<<(std::ostream &os, const T &a) {
return print_seq(a, ", ", "", (os << "{")) << "}";
}
#ifdef ENABLE_DEBUG
#include "debug_dump.hpp"
#else
#define DUMP(...)
#endif
using namespace std;
auto solve() {
int n, a, b, c;
cin >> n >> a >> b >> c;
Int slen = a + b + c;
vector<Int> S(n), cum(n + 1);
map<Int, int> mp;
mp[0] = 0;
i64 ans = 0;
REP(i, n) {
string s;
cin >> s;
S[i] = Int(s.size());
DUMP(s, S[i]);
cum[i + 1] = cum[i] + S[i];
if (auto cit = mp.find(cum[i + 1] - c); cit != mp.end()) {
int bend = cit->second;
if (auto bit = mp.find(cum[bend] - b); bit != mp.end()) {
int aend = bit->second;
if (auto ait = mp.find(cum[aend] - a); ait != mp.end()) {
++ans;
}
}
}
mp[cum[i + 1]] = i + 1;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
cout << solve() << "\n";
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0