結果

問題 No.3010 水色コーダーさん
ユーザー e6nlaq
提出日時 2025-01-25 13:59:01
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 61 ms / 2,000 ms
コード長 41,096 bytes
コンパイル時間 4,573 ms
コンパイル使用メモリ 311,332 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2025-01-25 23:04:10
合計ジャッジ時間 6,589 ms
ジャッジサーバーID
(参考情報)
judge1 / judge9
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

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

/*------------------------------------------------------------
Welcome to my program!
@x__0 / @e6nlaq
  _∧ AtCoder / Codeforces etc...
  (  ・ω・)
_(__/ /
  /     / C++ GCC 14.2.0
    
Let's write Codes!
------------------------------------------------------------*/
// Return Code 139(out_of_range)
// #define _GLIBCXX_DEBUG
/* #region AtCoder Template */
#include <bits/stdc++.h>
using namespace std;
//
#if __has_include("./cpp-dump/cpp-dump.hpp")
#define LOCAL
#endif
// AC Library(C++17使)
#if defined(LOCAL) || defined(ATCODER)
#include <atcoder/all>
using namespace atcoder;
#endif
#ifdef LOCAL
#include "./cpp-dump/cpp-dump.hpp"
#ifdef ATCODER_MODINT_HPP
namespace cpp_dump::_detail {
template <int m>
inline std::string export_var(
const atcoder::static_modint<m> &mint, const std::string &indent, std::size_t last_line_length,
std::size_t current_depth, bool fail_on_newline, const export_command &command) {
return export_var(mint.val(), indent, last_line_length, current_depth, fail_on_newline, command);
}
template <int m>
inline std::string export_var(
const atcoder::dynamic_modint<m> &mint, const std::string &indent, std::size_t last_line_length,
std::size_t current_depth, bool fail_on_newline, const export_command &command) {
return export_var(mint.val(), indent, last_line_length, current_depth, fail_on_newline, command);
}
} // namespace cpp_dump::_detail
#endif
#define debug(...) cpp_dump(__VA_ARGS__)
CPP_DUMP_SET_OPTION_GLOBAL(log_label_func, cpp_dump::log_label::filename(true));
//
CPP_DUMP_SET_OPTION_GLOBAL(es_value.log, "\x1b[02m"); // log:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.expression, "\x1b[38;5;39m"); // reserved:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.reserved, "\x1b[34m"); // expression:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.number, "\x1b[38;5;150m"); // number:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.character, "\x1b[38;5;172m"); // character:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.escaped_char, "\x1b[38;5;220m"); // escaped_char:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.op, "\x1b[02m"); // op:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.identifier, "\x1b[32m"); // identifier:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.member, "\x1b[96m"); // member:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.unsupported, "\x1b[31m"); // unsupported:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.bracket_by_depth, (std::vector<std::string>{
"\x1b[33m", // bracket_by_depth[0]:
"\x1b[35m", // bracket_by_depth[1]:
"\x1b[36m", // bracket_by_depth[2]:
}));
CPP_DUMP_SET_OPTION_GLOBAL(es_value.class_op, "\x1b[02m"); // class_op:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.member_op, "\x1b[02m"); // member_op:
CPP_DUMP_SET_OPTION_GLOBAL(es_value.number_op, ""); // number_op:
// (::, <>, (), -, +, etc...)
// (class_op, member_op, number_op)
CPP_DUMP_SET_OPTION_GLOBAL(detailed_class_es, true);
CPP_DUMP_SET_OPTION_GLOBAL(detailed_member_es, true);
CPP_DUMP_SET_OPTION_GLOBAL(detailed_number_es, true);
namespace cp = cpp_dump;
// clangd
const auto _unnsedcpnamespaceunwarn = cp::options::es_value;
#else
#define debug(...)
#endif
//
#pragma GCC target("avx,avx2")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//
using uint = unsigned;
using ll = long long;
// using ll = __int128_t;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vd = vector<double>;
using vld = vector<ld>;
using vull = vector<ull>;
using vpll = vector<pll>;
using pdd = pair<ld, ld>;
using psl = pair<string, ll>;
using pcl = pair<char, ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvc = vector<vc>;
using vvs = vector<vs>;
using vvb = vector<vb>;
using vvld = vector<vld>;
using vvd = vector<vd>;
using mll = map<ll, ll>;
using mcl = map<char, ll>;
using msl = map<string, ll>;
using sll = set<ll>;
using spll = set<pair<ll, ll>>;
using spdd = set<pair<ld, ld>>;
using stll = stack<ll>;
using qll = queue<ll>;
using qd = queue<ld>;
using qs = queue<string>;
using qc = queue<char>;
using int128_t = __int128_t;
template <typename Tp1, typename Tp2>
using unmap = unordered_map<Tp1, Tp2>;
template <typename Tp>
using unset = unordered_set<Tp>;
template <typename Tp>
using reverse_queue = priority_queue<Tp, vector<Tp>, greater<Tp>>;
template <typename T>
using vec2 = vector<vector<T>>;
template <typename T>
using vec3 = vector<vector<vector<T>>>;
#if __cplusplus >= 202002L
#define cpp20
template <typename T>
concept number = integral<T> || floating_point<T>;
#endif
//
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i, n) for (ll i = (n) - 1; i >= 0; i--)
#define irep(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define arep(i, a, n) for (ll i = (a); i < (ll)(n); i++)
#define adrep(i, a, d, n) for (ll i = (a); i < (ll)(n); i += d)
#define until(b) while (!(b))
// define
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define endl "\n"
#define br break
#define el else
#define elif else if
template <typename T>
inline void YESNO(T b) {
cout << (b ? "YES" : "NO") << endl;
}
template <typename T>
inline void yesno(T b) {
cout << (b ? "yes" : "no") << endl;
}
template <typename T>
inline void YesNo(T b) {
cout << (b ? "Yes" : "No") << endl;
}
template <typename T, typename tr, typename fal>
inline void outif(T b, tr tru, fal fals) {
if (b) {
cout << tru << endl;
} else {
cout << fals << endl;
}
}
#define exit exit(0)
#define co(x) cout << (x) << endl
//
const string sl = "";
constexpr char cl = '\0';
constexpr ll nl = 0LL;
constexpr ll INFINT = 2047483647;
constexpr ll INFLL = 1023372036854775807LL; //
const ll mod1 = pow(10, 9) + 1;
constexpr char sp = ' ';
const ll j2_32 = pow(2, 32);
const ll j2_m32 = pow(2, -32);
const ll j2_10 = pow(2, 10);
const vector<int> dx = {0, 0, 1, -1};
const vector<int> dy = {1, -1, 0, 0};
const vector<int> ex = {-1, -1, -1, 0, 0, 1, 1, 1};
const vector<int> ey = {-1, 0, 1, -1, 1, -1, 0, 1};
const string spa = " ";
constexpr bool except = true;
mt19937_64 rng;
// ()
template <class T>
size_t HashCombine(const size_t seed, const T &v) {
return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));
}
/* pair */
template <class T, class S>
struct std::hash<std::pair<T, S>> {
size_t operator()(const std::pair<T, S> &keyval) const noexcept {
return HashCombine(std::hash<T>()(keyval.first), keyval.second);
}
};
/* vector */
template <class T>
struct std::hash<std::vector<T>> {
size_t operator()(const std::vector<T> &keyval) const noexcept {
size_t s = 0;
for (auto &&v : keyval)
s = HashCombine(s, v);
return s;
}
};
/* tuple */
template <int N>
struct HashTupleCore {
template <class Tuple>
size_t operator()(const Tuple &keyval) const noexcept {
size_t s = HashTupleCore<N - 1>()(keyval);
return HashCombine(s, std::get<N - 1>(keyval));
}
};
template <>
struct HashTupleCore<0> {
template <class Tuple>
size_t operator()(const Tuple &keyval) const noexcept { return 0; }
};
template <class... Args>
struct std::hash<std::tuple<Args...>> {
size_t operator()(const tuple<Args...> &keyval) const noexcept {
return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);
}
};
std::string
operator""_s(char const *str, std::size_t) {
return str;
}
std::string
operator*(std::string const &str, int n) {
if (n < 1)
return "";
std::string result;
result.reserve(str.length() * n);
for (int i = 0; i < n; ++i) {
result += str;
}
return result;
}
// https://kenkoooo.hatenablog.com/entry/2016/11/30/163533
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 parse(string &s) {
__int128 ret = 0;
for (ull i = 0; i < s.length(); i++)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
if (s[0] == '-') {
ret = -ret;
}
return ret;
}
istream &operator>>(std::istream &is, __int128_t &value) {
string tmp;
is >> tmp;
value = parse(tmp);
return is;
}
//
/**
* @brief
*
* @param num
* @return bool
*/
inline bool isprime(const ull num) noexcept(except) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
/**
* @brief charint
*
* @param c
* @return int
*/
inline int ctoi(const char c) noexcept(except) {
if (c >= '0' && c <= '9')
return c - '0';
return 0;
}
/**
* @brief 1+2+3+4+...n
*
* @param n
* @return int
*/
inline ull minisum(const ull n) noexcept(except) {
return n * (n + 1ULL) / 2ULL;
}
/**
* @brief 0
*
* @tparam T
* @param i
* @param s
* @return string 0
*/
inline string zerou(const ull i, string s) noexcept(except) {
while (s.size() != i)
s = '0' + s;
return s;
}
/**
* @brief Tchar
*
* @tparam T
* @param i
* @return char
*/
inline char to_char(const ull i) noexcept(except) {
assert(i <= 9);
return '0' + i;
}
/**
* @brief i < j ij
*
* @tparam T1_ i
* @tparam T2_ j
* @param i
* @param j
* @return bool
*/
template <typename T1_, typename T2_>
inline bool chmax(T1_ &i, const T2_ j) noexcept(except) {
if (i < j) {
i = j;
return true;
}
return false;
}
/**
* @brief i > j ij
*
* @tparam T1_ i
* @tparam T2_ j
* @param i
* @param j
* @return bool
*/
template <typename T1_, typename T2_>
inline bool chmin(T1_ &i, const T2_ j) noexcept(except) {
if (i > j) {
i = j;
return true;
}
return false;
}
/**
* @brief
*
* @tparam T (vector<T>)
* @param v
* @param s ()
* @author https://zenn.dev/antyuntyun
*/
template <typename T>
inline void print(const vector<T> &v, const string &s = " ") noexcept(except) {
rep(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");
}
template <typename A, typename B>
inline void print(const vector<pair<A, B>> &v, const string &s = "\n") noexcept(except) {
rep(i, v.size()) cout << v[i].first << " " << v[i].second << s;
}
/// @brief
/// @tparam T (vector<vector<T>>)
/// @param v
/// @param s
template <typename T>
inline void print(const vector<vector<T>> &v, string const &s = " ") noexcept(except) {
rep(i, v.size()) {
rep(j, v[i].size()) cout << v[i][j] << (j != (ll)v[i].size() - 1 ? s : "\n");
}
}
template <typename T>
inline istream &operator>>(istream &os, vector<T> &v) {
assert(v.size() != 0);
rep(i, v.size()) {
cin >> v[i];
}
return os;
}
/**
* @brief
*
* @param s
* @return string
*/
inline string srev(string s) noexcept(except) {
reverse(all(s));
return s;
}
/// @brief long long
/// @param x x^nx
/// @param n x^nn
/// @return x^n
inline unsigned long long pow_ll(unsigned long long x, unsigned long long n) noexcept(except) {
ull ret = 1LL;
while (n > 0) {
if (n & 1LL)
ret *= x;
x *= x;
n >>= 1LL;
}
return ret;
}
template <typename T>
inline vector<vector<T>> make_vec2(const ull H, const ull W, const T &init) {
return vector<vector<T>>(H, vector<T>(W, init));
}
template <typename T>
inline vector<vector<T>> make_vec2(const ull H, const ull W) {
return vector<vector<T>>(H, vector<T>(W));
}
template <typename T>
inline vector<vector<vector<T>>> make_vec3(const ull X, const ull Y, const ull Z, const T &init) {
return vector<vector<vector<T>>>(X, make_vec2<T>(Y, Z, init));
}
template <typename T>
inline vector<vector<vector<T>>> make_vec3(const ull X, const ull Y, const ull Z) {
return vector<vector<vector<T>>>(X, make_vec2<T>(Y, Z));
}
/// @brief N10
/// @param c N
/// @return 10
inline int ntodec(const char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
case 'A':
return 10;
case 'B':
return 11;
case 'C':
return 12;
case 'D':
return 13;
case 'E':
return 14;
case 'F':
return 15;
case 'G':
return 16;
case 'H':
return 17;
case 'I':
return 18;
case 'J':
return 19;
case 'K':
return 20;
case 'L':
return 21;
case 'M':
return 22;
case 'N':
return 23;
case 'O':
return 24;
case 'P':
return 25;
case 'Q':
return 26;
case 'R':
return 27;
case 'S':
return 28;
case 'T':
return 29;
case 'U':
return 30;
case 'V':
return 31;
case 'W':
return 32;
case 'X':
return 33;
case 'Y':
return 34;
case 'Z':
return 35;
default:
return -1;
}
}
/// @brief 10N
/// @param n 10
/// @return N
inline char decton(const int n) {
switch (n) {
case 0:
return '0';
case 1:
return '1';
case 2:
return '2';
case 3:
return '3';
case 4:
return '4';
case 5:
return '5';
case 6:
return '6';
case 7:
return '7';
case 8:
return '8';
case 9:
return '9';
case 10:
return 'A';
case 11:
return 'B';
case 12:
return 'C';
case 13:
return 'D';
case 14:
return 'E';
case 15:
return 'F';
case 16:
return 'G';
case 17:
return 'H';
case 18:
return 'I';
case 19:
return 'J';
case 20:
return 'K';
case 21:
return 'L';
case 22:
return 'M';
case 23:
return 'N';
case 24:
return 'O';
case 25:
return 'P';
case 26:
return 'Q';
case 27:
return 'R';
case 28:
return 'S';
case 29:
return 'T';
case 30:
return 'U';
case 31:
return 'V';
case 32:
return 'W';
case 33:
return 'X';
case 34:
return 'W';
case 35:
return 'Z';
default:
return '\0';
}
}
/// @brief NM
/// @param str N
/// @param n
/// @param m
/// @return M
inline string n_ary(const string &str, const int n, const int m) {
unsigned long tmp = 0;
string ret;
for (unsigned long long i = 0; i < str.length(); i++) {
tmp += (unsigned long)ntodec(str[str.length() - 1 - i]) * pow_ll(n, i);
}
if (tmp == 0)
return "0";
while (tmp != 0) {
ret = decton(tmp % m) + ret;
tmp /= m;
}
return ret;
}
/// @brief
/// @tparam T n
/// @param n
/// @return
template <typename T>
inline map<T, T> prime_factor_map(T n) {
map<T, T> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
ret[i] = tmp;
}
if (n != 1)
ret[n] = 1;
return ret;
}
// O(sqrt(N))
vector<pair<long long, long long>> prime_factor(long long N) {
//
vector<pair<long long, long long>> res;
// √N
for (long long p = 2; p * p <= N; ++p) {
// N p
if (N % p != 0) {
continue;
}
// N p
int e = 0;
while (N % p == 0) {
// 1
++e;
// N p
N /= p;
}
//
res.emplace_back(p, e);
}
//
if (N != 1) {
res.emplace_back(N, 1);
}
return res;
}
/// @brief N
/// @tparam T N
/// @param N
/// @return N
template <typename T>
inline T divisor_num(const T N) {
map<T, T> pf = __prime_factor(N);
T ret = 1;
for (auto p : pf) {
ret *= (p.second + 1);
}
return ret;
}
/// @brief n(: O(sqrt(N)))
/// @param n
/// @return n
inline vll divisor(const ll n) {
vll ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
return ret;
}
/// @brief O(|S|)
/// @param s
/// @return
inline bool isint(const string &s) noexcept(except) {
rep(i, s.size()) {
if (!isdigit(s[i])) {
return false;
}
}
return true;
}
/// @brief 90
/// @tparam T (vector<vector<T>>)
/// @param arr
/// @return
template <typename T>
inline vector<vector<T>> rot90(const vector<vector<T>> &A) {
ll N = A.size(), M = A[0].size();
vector<vector<T>> ret(M, vector<T>(N));
ll _i = 0, _j = 0;
rep(j, M) {
for (ll i = N - 1; i >= 0; i--) {
ret[_i][_j] = A[i][j];
_j++;
}
_j = 0;
_i++;
}
return ret;
}
/// @brief
/// @param str
/// @return
inline bool ispalind(const string &str) noexcept(except) {
ull n = str.length();
for (ull i = 0; i < n / 2; i++) {
if (str[i] != str[n - i - 1]) {
return false;
}
}
return true;
}
inline bool ispalind(const string &str, ull x, ull n) {
assert(x < str.size());
assert(x + n <= str.size());
for (ull i = 0; i < n / 2; i++) {
if (str[x + i] != str[(x + n) - i - 1]) {
return false;
}
}
return true;
}
/// @brief startn
/// @param n
/// @param start
/// @return startn
inline vector<ll> range(const ll n, const ll start = 0) {
vector<ll> ret(n - start);
ll oi = 0;
for (ll i = start; i <= n; i++) {
ret[oi] = i;
oi++;
}
return ret;
}
/// @brief 10
/// @param s 10
/// @return
inline ll csum(const string &s) noexcept(except) {
ll ret = 0;
rep(i, s.size()) {
ret += ctoi(s[i]);
}
return ret;
}
/// @brief csum
/// @param n
/// @return
inline ll csum(const ll n) noexcept(except) {
return csum(to_string(n));
}
/// @brief
/// @param n n
/// @return n
inline ll fact(const ll n) noexcept(except) {
ll ret = 1;
rep(i, n) {
ret *= i + 1;
}
return ret;
}
/// @brief
/// @param N
/// @return
inline bool is_squere(const ll N) noexcept(except) {
long long r = (long long)floor(sqrt((long double)N)); //
return (r * r) == N;
}
/// @brief
/// @tparam T vector
/// @param v
/// @return ( |v|+1 )
template <typename T>
inline vector<T> cum(const vector<T> &v) noexcept(except) {
vector<T> ans(v.size() + 1);
ans[0] = 0;
for (ull i = 1; i <= v.size(); i++) {
ans[i] = ans[i - 1] + v[i - 1];
}
return ans;
}
/// @brief
/// @tparam T vector<vector<>>
/// @param v
/// @return (+1)
template <typename T>
inline vec2<T> cum(const vec2<T> &v) {
assert(v.size() > 0);
ull H = v.size(), W = v[0].size();
auto ret = make_vec2<T>(H + 1, W + 1, 0);
for (ull i = 1; i <= H; i++) {
for (ull j = 1; j <= W; j++) {
ret[i][j] = ret[i][j - 1] + v[i - 1][j - 1];
}
}
for (ull j = 1; j <= W; j++) {
for (ull i = 1; i <= H; i++) {
ret[i][j] += ret[i - 1][j];
}
}
return ret;
}
template <typename T>
inline vec3<T> cum(const vec3<T> &v) {
assert(v.size() > 0 && v[0].size() > 0);
ll x = v.size();
ll y = v[0].size();
ll z = v[0][0].size();
auto ret = make_vec3<T>(x + 1, y + 1, z + 1, 0);
for (ll i = 0; i < x; ++i) {
for (ll j = 0; j < y; ++j) {
for (ll k = 0; k < z; ++k) {
ret[i + 1][j + 1][k + 1] =
ret[i][j + 1][k + 1] + ret[i + 1][j][k + 1] +
ret[i + 1][j + 1][k] - ret[i][j][k + 1] - ret[i][j + 1][k] -
ret[i + 1][j][k] + ret[i][j][k] + v[i][j][k];
}
}
}
return ret;
}
// 0-indexed
template <typename T>
inline ll cumcnt(const vec2<T> &z, ll lx, ll ly, ll rx, ll ry) {
lx++;
ly++;
rx++;
ry++;
return z[rx][ry] + z[lx - 1][ly - 1] - z[lx - 1][ry] - z[rx][ly - 1];
}
template <typename T>
inline ll cumcnt(const vec3<T> &z, ll lx, ll ly, ll lz, ll rx, ll ry, ll rz) {
lx++;
ly++;
lz++;
rx++;
ry++;
rz++;
return z[rx][ry][rz] - z[lx - 1][ry][rz] - z[rx][ly - 1][rz] - z[rx][ry][lz - 1] + z[lx - 1][ly - 1][rz] + z[lx - 1][ry][lz - 1] + z[rx][ly -
        1][lz - 1] - z[lx - 1][ly - 1][lz - 1];
}
#ifdef cpp20
template <integral T>
#else
template <typename T>
#endif
inline vector<T> cumxor(const vector<T> &x) {
vector<T> ans(x.size() + 1);
ans[0] = 0;
irep(i, x.size()) {
ans[i] = ans[i - 1] ^ x[i - 1];
}
return ans;
}
/// @brief
/// @param l
/// @param r
/// @return
inline ll randint(const ll l, const ll r) noexcept(except) {
if (l == r)
return l;
return l + (rng() % (r - l + 1));
}
/// @brief O(log N)
/// @tparam T
/// @param v
/// @param x
/// @return
template <typename T>
inline long long bound_count(const vector<T> &v, const T &x) noexcept(except) {
auto l = lower_bound(v.begin(), v.end(), x);
auto u = upper_bound(v.begin(), v.end(), x);
if (*l != x) {
return 0;
}
if (u == v.end()) {
return v.size() - (l - v.begin());
} else {
return (u - v.begin()) - (l - v.begin());
}
}
/// @brief
/// @tparam T
/// @param v
/// @param x
/// @return x
template <typename T>
inline T recent(const vector<T> &v, const T &x) {
auto it = lower_bound(all(v), x);
if (it == v.end())
return *prev(v.end(), 1);
else {
if (it == v.begin())
return *v.begin();
else {
if (abs(*it - x) < abs(*prev(it, 1) - x))
return *it;
else
return *prev(it, 1);
}
}
}
/// @brief
/// @param str
/// @return
inline vector<pair<char, ull>> rlencode(const string &str) noexcept(except) {
ull n = (ull)str.size();
vector<pair<char, ull>> ret;
for (ull l = 0; l < n;) {
ull r = l + 1;
for (; r < n && str[l] == str[r]; r++) {
};
ret.push_back({str[l], r - l});
l = r;
}
return ret;
}
template <typename T>
inline map<T, ll> counter(const vector<T> &v) noexcept(except) {
map<T, ll> dat;
rep(i, v.size()) {
dat[v[i]]++;
}
return dat;
}
inline map<char, ll> counter(const string &s) noexcept(except) {
map<char, ll> dat;
rep(i, s.size()) {
dat[s[i]]++;
}
return dat;
}
/// @brief
/// @param x1
/// @param y1
/// @param x2
/// @param y2
/// @return
inline ld euclidean(const ld x1, const ld y1, const ld x2, const ld y2) noexcept(except) {
ld dx = x2 - x1;
ld dy = y2 - y1;
ld distance = sqrt(dx * dx + dy * dy);
return distance;
}
/// @brief ()
/// @tparam T
/// @param v
/// @param l
/// @param r
/// @return
template <typename T>
inline ll lencnt(const vector<T> &v, const T &l, const T &r) {
return upper_bound(all(v), r) - lower_bound(all(v), l);
}
using GraphKey = ll;
struct CostEdge {
GraphKey to;
ll cost;
#if __cplusplus >= 202002L
auto operator<=>(const CostEdge &e) const {
return this->cost <=> e.cost;
}
#endif
bool operator==(const CostEdge &e) const {
return this->cost == e.cost;
}
};
struct FromCostEdge : CostEdge {
GraphKey from;
};
ostream &operator<<(ostream &os, const CostEdge &cost) {
os << "{ to: " << cost.to << ", cost: " << cost.cost << " }";
return os;
}
using Edge = GraphKey;
using Graph = vector<vector<Edge>>;
using CostGraph = vector<vector<CostEdge>>;
inline CostEdge make_cost(const GraphKey to, const ll cost) noexcept {
return CostEdge{to, cost};
}
inline CostGraph to_costgraph(const Graph &g) noexcept {
CostGraph ans(g.size());
rep(i, g.size()) {
rep(j, g[i].size()) {
ans[i].emplace_back(CostEdge{g[i][j], 1});
}
}
return ans;
}
inline pair<GraphKey, ll> __tree_diamiter_dfs(const CostGraph &G, ll u, ll par) { //
pair<GraphKey, ll> ret = make_pair((GraphKey)0, u);
for (auto e : G[u]) {
if (e.to == par)
continue;
auto next = __tree_diamiter_dfs(G, e.to, u);
next.first += e.cost;
ret = max(ret, next);
}
return ret;
}
//
inline GraphKey tree_diamiter(const CostGraph &G) {
pair<GraphKey, ll> p = __tree_diamiter_dfs(G, 0LL, -1LL);
pair<GraphKey, ll> q = __tree_diamiter_dfs(G, p.second, -1LL);
return q.first;
}
//
inline GraphKey tree_diamiter(const Graph &G) {
return tree_diamiter(to_costgraph(G));
}
inline vector<ll> dijkstra(const CostGraph &G, ll start = 0, ll init = 0) {
ll n = G.size();
assert(0 <= start && start < n);
vector<bool> kakutei(n, false);
vll cur(n, INFLL);
reverse_queue<pll> q;
cur[start] = init;
q.push(make_pair(cur[start], start));
while (!q.empty()) {
ll pos = q.top().second;
q.pop();
if (kakutei[pos])
continue;
kakutei[pos] = true;
rep(i, G[pos].size()) {
ll nex = G[pos][i].to;
ll cost = G[pos][i].cost;
if (cur[nex] > cur[pos] + cost) {
cur[nex] = cur[pos] + cost;
q.push(make_pair(cur[nex], nex));
}
}
}
return cur;
}
inline vector<ll> dijkstra(const CostGraph &G, vll &prv, ll start = 0, ll init = 0) {
ll n = G.size();
assert(0 <= start && start < n);
vector<bool> kakutei(n, false);
vll cur(n, INFLL);
prv.resize(G.size(), -1);
reverse_queue<pll> q;
cur[start] = init;
q.push(make_pair(cur[start], start));
while (!q.empty()) {
ll pos = q.top().second;
q.pop();
if (kakutei[pos])
continue;
kakutei[pos] = true;
rep(i, G[pos].size()) {
ll nex = G[pos][i].to;
ll cost = G[pos][i].cost;
if (cur[nex] > cur[pos] + cost) {
cur[nex] = cur[pos] + cost;
prv[nex] = pos;
q.push(make_pair(cur[nex], nex));
}
}
}
return cur;
}
inline vector<ll> get_path(const vector<ll> &prev, ll t) {
vector<ll> path;
for (ll cur = t; cur != -1; cur = prev[cur]) {
path.push_back(cur);
}
reverse(path.begin(), path.end()); //
return path;
}
inline vector<ll> dijkstra(const Graph &G, ll start = 0, ll init = 0) {
return dijkstra(to_costgraph(G), start, init);
}
inline vector<ll> dijkstra(const Graph &G, vll &prv, ll start = 0, ll init = 0) {
return dijkstra(to_costgraph(G), prv, start, init);
}
inline vector<vector<ll>> warshall_floyd(const CostGraph &G) {
ll n = G.size();
vvll d = make_vec2<ll>(n, n, INFLL);
rep(i, n) {
d[i][i] = 0;
}
rep(i, n) {
rep(j, G[i].size()) {
d[i][G[i][j].to] = G[i][j].cost;
}
}
rep(k, n) {
rep(i, n) {
rep(j, n) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
return d;
}
inline vector<vector<ll>> warshall_floyd(const Graph &G) {
return warshall_floyd(to_costgraph(G));
}
inline vll TopologicalSort(const Graph &graph) {
vll indegrees(graph.size());
for (const auto &v : graph) {
for (const auto &to : v) {
++indegrees[to];
}
}
reverse_queue<ll> pq;
for (int i = 0; i < (int)graph.size(); ++i) {
if (indegrees[i] == 0) {
pq.push(i);
}
}
vll result;
while (!pq.empty()) {
const int from = pq.top();
pq.pop();
result.push_back(from);
for (const auto &to : graph[from]) {
if (--indegrees[to] == 0) {
pq.push(to);
}
}
}
if (result.size() != graph.size()) {
return {};
}
return result;
}
template <ull bit, ull n>
class CustomBit {
public:
explicit CustomBit(ull val = 0) {
this->__val = val;
this->__max_val = pow_ll(bit, n) - 1;
this->__reload();
}
ull to_ull() const {
return this->__val;
}
// O(1)
ull max_val() const {
return this->__max_val;
}
// O(1)
array<ull, n> get_all() const {
return this->__dat;
}
// O(1)
ull get(ull x) const {
assert(x < n);
return this->__dat[x];
}
// O(1)
constexpr ull size() const {
return n;
}
constexpr void set(ull x, ull val) {
assert(val < bit);
this->__dat[x] = val;
this->__reload_val();
}
CustomBit &operator++(int) {
this->__val++;
this->__reload();
return *this;
}
CustomBit &operator++() {
auto tmp = *this;
++this->__val;
this->__reload();
return tmp;
}
private:
ull __val;
array<ull, n> __dat;
ull __max_val;
void __reload() {
assert(0 <= this->__val && this->__val <= this->__max_val);
auto tmp = this->__val;
for (ll i = 0; i < n; ++i) {
this->__dat[i] = tmp % bit;
tmp /= bit;
}
}
void __reload_val() {
this->__val = 0;
ull a = 1;
for (ll i = 0; i < n; ++i) {
this->__val += a * this->__dat[i];
a *= bit;
}
}
};
template <ull bit, ull n>
ostream &operator<<(ostream &os, const CustomBit<bit, n> &bits) {
os << "[";
for (ll i = 0; i < n; ++i) {
os << bits.get(i) << (i != n - 1 ? ", " : "");
}
os << "](bit: " << bit << ")";
return os;
}
/// @brief Union-Find
/// @note 1.4 +
/// @see https://zenn.dev/reputeless/books/standard-cpp-for-competitive-programming/viewer/union-find
class UnionFind {
public:
UnionFind() = default;
/// @brief Union-Find
/// @param n
explicit UnionFind(size_t n)
: m_parentsOrSize(n, -1) {}
/// @brief i root
/// @param i 調
/// @return i root
ll find(ll i) {
if (m_parentsOrSize[i] < 0) {
return i;
}
//
return (m_parentsOrSize[i] = find(m_parentsOrSize[i]));
}
/// @brief a b
/// @param a
/// @param b
void merge(ll a, ll b) {
a = find(a);
b = find(b);
if (a != b) {
// union by size (
if (-m_parentsOrSize[a] < -m_parentsOrSize[b]) {
std::swap(a, b);
}
m_parentsOrSize[a] += m_parentsOrSize[b];
m_parentsOrSize[b] = a;
}
}
/// @brief a b
/// @param a
/// @param b
/// @return a b true, false
bool connected(ll a, ll b) {
return (find(a) == find(b));
}
/// @brief i
/// @param i
/// @return i
ll size(ll i) {
return -m_parentsOrSize[find(i)];
}
private:
// m_parentsOrSize[i] i ,
// root (-1 * )
std::vector<ll> m_parentsOrSize;
};
inline vector<FromCostEdge> to_fromcostedges(const CostGraph &g) {
vector<FromCostEdge> dat;
rep(i, g.size()) {
rep(j, g[i].size()) {
dat.emplace_back(FromCostEdge{{g[i][j].to, g[i][j].cost}, i});
}
}
return dat;
}
/// @brief
/// @param e ()
/// @param v
/// @return
/// @see https://x.gd/7JLRg
inline ll get_mst(const vector<FromCostEdge> &edges, ll v) {
UnionFind uf(v);
ll sum = 0;
for (const auto &edge : edges) {
if (!uf.connected(edge.from, edge.to)) {
uf.merge(edge.from, edge.to);
sum += edge.cost;
}
}
return sum;
}
#ifdef cpp20
template <number T>
#else
template <typename T>
#endif
inline T sum(const vector<T> &v) {
T ans = 0;
rep(i, v.size()) ans += v[i];
return ans;
}
#ifdef cpp20
template <number T>
#else
template <typename T>
#endif
inline vector<T> zaatsu(const vector<T> &A) {
vector<T> B = A;
// B
sort(B.begin(), B.end());
// B
B.erase(unique(B.begin(), B.end()), B.end());
//
vector<T> res(A.size());
for (ull i = 0; i < A.size(); ++i) {
res[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();
}
return res;
}
#ifdef cpp20
// https://x.gd/yonBS
class Doubling {
public:
explicit Doubling(const vll &x, ull max_k) {
k = bit_width(max_k);
n = x.size();
dp = make_vec2<ll>(k + 1, n);
this->max_k = max_k;
rep(j, n) dp[0][j] = x[j];
irep(i, k) {
rep(j, n) {
dp[i][j] = dp[i - 1][dp[i - 1][j]];
}
}
}
ull to(ull pos, ull k) const {
assert(k <= max_k);
ll now = pos;
for (ull i = 0; k > 0; ++i) {
if (k & 1) now = dp[i][now];
k >>= 1;
}
return now;
}
private:
ull n;
ull k;
ull max_k;
vvll dp;
};
inline void gmerge(Graph &g, ull a, ull b) {
assert(a < g.size());
assert(b < g.size());
g[a].emplace_back(b);
g[b].emplace_back(a);
}
inline void gmerge(CostGraph &g, ull a, ull b, ll c) {
assert(a < g.size());
assert(b < g.size());
g[a].emplace_back(make_cost(b, c));
g[b].emplace_back(make_cost(a, c));
}
// https://x.gd/a7Yhv
inline constexpr ll mmod(ll x, ll m) noexcept {
return (x % m + m) % m;
}
// Hash
constexpr ll HMOD = (1LL << 61LL) - 1LL;
ll HB = 0;
vll HPOW;
bool inited_hpow = false;
inline void fastio() noexcept {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
rng = mt19937_64(chrono::steady_clock::now().time_since_epoch().count());
HB = randint(150, HMOD - 10);
}
inline vll str_to_vec(const string &s) {
vll ans(s.size());
rep(i, s.size()) {
ans[i] = s[i];
}
return ans;
}
inline ll hmod_mul(ll x, ll y) {
int128_t t = int128_t(x) * int128_t(y);
t = (t >> 61) + (t & HMOD);
if (t >= HMOD) return t - HMOD;
return ll(t);
}
inline void init_hash(ll n) {
HPOW.resize(n + 1);
HPOW[0] = 1;
irep(i, n) HPOW[i] = hmod_mul(HPOW[i - 1], HB);
inited_hpow = true;
}
inline vll rolling_hash(const vll &a) {
assert(inited_hpow);
vll h(a.size() + 1);
h[0] = 0;
irep(i, a.size()) h[i] = (hmod_mul(h[i - 1], HB) + (a[i - 1] % HMOD)) % HMOD;
return h;
}
inline vll rolling_hash(const string &s) {
return rolling_hash(str_to_vec(s));
}
inline ll get_hash(const vll &h, ll l, ll r) {
ll val = h[r + 1] - hmod_mul(h[l], HPOW[r - l + 1]);
if (val < 0) val += HMOD;
return val;
}
#endif
/* #endregion */
/* Variables */
ll N, M, K, Q;
ll H, W;
string S = "";
string dump = "";
ll codeforces_t = -1;
/* Main Function */
int main() {
fastio();
cin >> N >> M;
ll ans = 0;
rep(i, N) {
ll R;
cin >> S >> R;
unset<char> c = {S[0], S[1], S[2], S[3]};
ans += c.contains('x') && R >= 1200;
}
co(ans);
return 0;
}
/* */
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0