895
This commit is contained in:
parent
94383fbaf7
commit
26f66e43d8
97 changed files with 5337 additions and 42 deletions
9
codeforces/859/.clang-format
Normal file
9
codeforces/859/.clang-format
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
BasedOnStyle: Google
|
||||
AllowShortBlocksOnASingleLine: false
|
||||
AllowShortCaseLabelsOnASingleLine: false
|
||||
AllowShortCompoundRequirementOnASingleLine: false
|
||||
AllowShortEnumsOnASingleLine: false
|
||||
AllowShortFunctionsOnASingleLine: false
|
||||
AllowShortIfStatementsOnASingleLine: false
|
||||
AllowShortLambdasOnASingleLine: false
|
||||
AllowShortLoopsOnASingleLine: false
|
||||
26
codeforces/859/.clangd
Normal file
26
codeforces/859/.clangd
Normal file
|
|
@ -0,0 +1,26 @@
|
|||
CompileFlags:
|
||||
Add:
|
||||
- -Wall
|
||||
- -Wextra
|
||||
- -Wshadow
|
||||
- -Wnon-virtual-dtor
|
||||
- -Wold-style-cast
|
||||
- -Wcast-align
|
||||
- -Wunused
|
||||
- -Woverloaded-virtual
|
||||
- -Wpedantic
|
||||
- -Wconversion
|
||||
- -Wsign-conversion
|
||||
- -Wmisleading-indentation
|
||||
- -Wduplicated-cond
|
||||
- -Wduplicated-branches
|
||||
- -Wlogical-op
|
||||
- -Wnull-dereference
|
||||
- -Wuseless-cast
|
||||
- -Wformat=2
|
||||
- -Wformat-overflow
|
||||
- -Wformat-truncation
|
||||
- -Wdouble-promotion
|
||||
- -Wundef
|
||||
- -DLOCAL
|
||||
- -Wno-unknown-pragmas
|
||||
98
codeforces/859/a.cc
Normal file
98
codeforces/859/a.cc
Normal file
|
|
@ -0,0 +1,98 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int a, b, c;
|
||||
cin >> a >> b >> c;
|
||||
prln("{}", (a + b == c) ? '+' : '-');
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
12
codeforces/859/a.in
Normal file
12
codeforces/859/a.in
Normal file
|
|
@ -0,0 +1,12 @@
|
|||
11
|
||||
1 2 3
|
||||
3 2 1
|
||||
2 9 -7
|
||||
3 4 7
|
||||
1 1 2
|
||||
1 1 0
|
||||
3 3 6
|
||||
9 9 18
|
||||
9 9 0
|
||||
1 9 -8
|
||||
1 9 10
|
||||
103
codeforces/859/b.cc
Normal file
103
codeforces/859/b.cc
Normal file
|
|
@ -0,0 +1,103 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
int mihai = 0, bianca = 0, x;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
cin >> x;
|
||||
if (x & 1) bianca += x; else mihai += x;
|
||||
}
|
||||
if (mihai > bianca) YES(); else NO();
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
7
codeforces/859/b.in
Normal file
7
codeforces/859/b.in
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
3
|
||||
4
|
||||
1 2 3 4
|
||||
4
|
||||
1 1 1 2
|
||||
3
|
||||
1 4 3
|
||||
111
codeforces/859/c.cc
Normal file
111
codeforces/859/c.cc
Normal file
|
|
@ -0,0 +1,111 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
string s;
|
||||
cin >> s;
|
||||
ve<int> last(26, -1);
|
||||
for (int i = 0; i < n; ++i) {
|
||||
int x = s[i] - 'a';
|
||||
if (last[x] != -1) {
|
||||
if ((i - last[x]) & 1) {
|
||||
NO();
|
||||
return;
|
||||
}
|
||||
}
|
||||
last[x] = i;
|
||||
}
|
||||
YES();
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
612
codeforces/859/c.debug-c.su
Normal file
612
codeforces/859/c.debug-c.su
Normal file
|
|
@ -0,0 +1,612 @@
|
|||
/usr/include/c++/14.2.1/type_traits:3832:3:constexpr bool std::is_constant_evaluated() 16 static
|
||||
/usr/include/c++/14.2.1/compare:282:5:constexpr bool std::operator==(strong_ordering, __cmp_cat::__unspec) 144 static
|
||||
/usr/include/c++/14.2.1/compare:291:5:constexpr bool std::operator<(strong_ordering, __cmp_cat::__unspec) 144 static
|
||||
/usr/include/c++/14.2.1/new:179:33:void* operator new(std::size_t, void*) 16 static
|
||||
/usr/include/c++/14.2.1/bits/predefined_ops.h:74:3:constexpr __gnu_cxx::__ops::_Iter_less_val __gnu_cxx::__ops::__iter_less_val() 16 static
|
||||
/usr/include/c++/14.2.1/bits/predefined_ops.h:103:3:constexpr __gnu_cxx::__ops::_Val_less_iter __gnu_cxx::__ops::__val_less_iter() 16 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:1042:3:constexpr long unsigned int std::__size_to_integer(long unsigned int) 16 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:343:7:static constexpr void std::char_traits<char>::assign(char_type&, const char_type&) 48 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:354:7:static constexpr bool std::char_traits<char>::eq(const char_type&, const char_type&) 48 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:358:7:static constexpr bool std::char_traits<char>::lt(const char_type&, const char_type&) 48 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:366:7:static constexpr int std::char_traits<char>::compare(const char_type*, const char_type*, std::size_t) 80 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:385:7:static constexpr std::size_t std::char_traits<char>::length(const char_type*) 32 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:395:7:static constexpr const std::char_traits<char>::char_type* std::char_traits<char>::find(const char_type*, std::size_t, const char_type&) 64 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:407:7:static constexpr std::char_traits<char>::char_type* std::char_traits<char>::move(char_type*, const char_type*, std::size_t) 48 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:419:7:static constexpr std::char_traits<char>::char_type* std::char_traits<char>::copy(char_type*, const char_type*, std::size_t) 48 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:431:7:static constexpr std::char_traits<char>::char_type* std::char_traits<char>::assign(char_type*, std::size_t, char_type) 64 static
|
||||
/usr/include/c++/14.2.1/string_view:70:3:constexpr std::size_t std::__sv_check(size_t, size_t, const char*) 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:232:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::pointer std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_local_data() [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/ptr_traits.h:134:7:static constexpr _Tp* std::__ptr_traits_ptr_to<_Tp*, _Tp, false>::pointer_to(element_type&) [with _Tp = char] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:175:5:constexpr _Tp* std::addressof(_Tp&) [with _Tp = char] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:51:5:constexpr _Tp* std::__addressof(_Tp&) [with _Tp = char] 16 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:197:2:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_Alloc_hider::_Alloc_hider(std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::pointer, _Alloc&&) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 96 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = allocator<char>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:186:14:constexpr std::__cxx11::basic_string<char>::_Alloc_hider::~_Alloc_hider() 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:527:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::basic_string() [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 208 static
|
||||
/usr/include/c++/14.2.1/bits/charconv.h:55:5:constexpr unsigned int std::__detail::__to_chars_len(_Tp, int) [with _Tp = unsigned int] 80 static
|
||||
/usr/include/c++/14.2.1/bits/charconv.h:55:5:constexpr unsigned int std::__detail::__to_chars_len(_Tp, int) [with _Tp = long unsigned int] 80 static
|
||||
/usr/include/c++/14.2.1/bits/charconv.h:55:5:constexpr unsigned int std::__detail::__to_chars_len(_Tp, int) [with _Tp = long long unsigned int] 80 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:233:5:constexpr const _Tp& std::min(const _Tp&, const _Tp&) [with _Tp = long unsigned int] 48 static
|
||||
/usr/include/c++/14.2.1/charconv:368:1:constexpr std::to_chars_result std::to_chars(char*, char*, long unsigned int, int) 48 static
|
||||
/usr/include/c++/14.2.1/bit:371:5:constexpr int std::__bit_width(_Tp) [with _Tp = unsigned int] 64 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1076:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::size_type std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::size() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/span:88:2:constexpr std::__detail::__extent_storage<18446744073709551615>::__extent_storage(std::size_t) 32 static
|
||||
/usr/include/c++/14.2.1/span:93:2:constexpr std::size_t std::__detail::__extent_storage<18446744073709551615>::_M_extent() const 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:51:3:constexpr bool std::__unicode::__is_scalar_value(char32_t) 16 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:75:5:constexpr char32_t std::__unicode::_Repl::operator()() const 16 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:603:3:constexpr int std::__unicode::__v15_1_0::__field_width(char32_t) 176 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:614:3:constexpr std::__unicode::__v15_1_0::_Gcb_property std::__unicode::__v15_1_0::__grapheme_cluster_break_property(char32_t) 208 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:624:3:constexpr bool std::__unicode::__v15_1_0::__is_incb_linker(char32_t) 176 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:633:3:constexpr std::__unicode::__v15_1_0::_InCB std::__unicode::__v15_1_0::__incb_property(char32_t) 208 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:645:3:constexpr bool std::__unicode::__v15_1_0::__is_extended_pictographic(char32_t) 176 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:664:5:constexpr void std::__unicode::__v15_1_0::_Grapheme_cluster_iterator_base::_M_reset(char32_t, std::__unicode::__v15_1_0::_Gcb_property) 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:674:5:constexpr void std::__unicode::__v15_1_0::_Grapheme_cluster_iterator_base::_M_update_xpicto_seq_state(char32_t, std::__unicode::__v15_1_0::_Gcb_property) 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:706:5:constexpr void std::__unicode::__v15_1_0::_Grapheme_cluster_iterator_base::_M_update_ri_count(std::__unicode::__v15_1_0::_Gcb_property) 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:715:5:constexpr void std::__unicode::__v15_1_0::_Grapheme_cluster_iterator_base::_M_update_incb_state(char32_t, std::__unicode::__v15_1_0::_Gcb_property) 32 static
|
||||
/usr/include/c++/14.2.1/charconv:448:5:constexpr unsigned char std::__detail::__from_chars_alnum_to_val(unsigned char) [with bool _DecOnly = false] 48 static
|
||||
/usr/include/c++/14.2.1/format:188:14:std::format_error::format_error(const char*) 48 static
|
||||
/usr/include/c++/14.2.1/format:184:9:std::format_error::~format_error() 48 static
|
||||
/usr/include/c++/14.2.1/format:184:9:virtual std::format_error::~format_error() 32 static
|
||||
/usr/include/c++/14.2.1/format:194:3:void std::__throw_format_error(const char*) 48 static
|
||||
/usr/include/c++/14.2.1/format:203:3:void std::__format::__unmatched_left_brace_in_format_string() 16 static
|
||||
/usr/include/c++/14.2.1/format:208:3:void std::__format::__unmatched_right_brace_in_format_string() 16 static
|
||||
/usr/include/c++/14.2.1/format:213:3:void std::__format::__conflicting_indexing_in_format_string() 16 static
|
||||
/usr/include/c++/14.2.1/format:218:3:void std::__format::__invalid_arg_id_in_format_string() 16 static
|
||||
/usr/include/c++/14.2.1/format:223:3:void std::__format::__failed_to_parse_format_spec() 16 static
|
||||
/usr/include/c++/14.2.1/format:392:18:constexpr bool std::__format::__is_digit(char) 32 static
|
||||
/usr/include/c++/14.2.1/format:395:18:constexpr bool std::__format::__is_xdigit(char) 32 static
|
||||
/usr/include/c++/14.2.1/format:766:5:std::__format::_Optional_locale::_Optional_locale(const std::locale&) 48 static
|
||||
/usr/include/c++/14.2.1/format:798:5:std::__format::_Optional_locale::~_Optional_locale() 48 static
|
||||
/usr/include/c++/14.2.1/format:814:5:const std::locale& std::__format::_Optional_locale::value() 48 static
|
||||
/usr/include/c++/14.2.1/format:2785:11:constexpr std::__format::_Seq_sink<std::__cxx11::basic_string<char> >::~_Seq_sink() 48 static
|
||||
/usr/include/c++/14.2.1/format:4255:3:std::string std::vformat(string_view, format_args) 848 static
|
||||
/usr/include/c++/14.2.1/span:304:7:constexpr _Type* std::span<_Type, _Extent>::data() const [with _Type = char; long unsigned int _Extent = 18446744073709551615] 32 static
|
||||
/usr/include/c++/14.2.1/span:251:7:constexpr std::span<_Type, _Extent>::size_type std::span<_Type, _Extent>::size() const [with _Type = char; long unsigned int _Extent = 18446744073709551615] 32 static
|
||||
/usr/include/c++/14.2.1/print:55:3:void std::vprint_nonunicode(FILE*, string_view, format_args) 880 static
|
||||
/usr/include/c++/14.2.1/print:65:3:void std::vprint_unicode(FILE*, string_view, format_args) 224 static
|
||||
/usr/include/c++/14.2.1/string_view:140:7:constexpr std::basic_string_view<_CharT, _Traits>::basic_string_view(const _CharT*) [with _CharT = char; _Traits = std::char_traits<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:199:5:static constexpr std::size_t __gnu_cxx::char_traits<_CharT>::length(const char_type*) [with _CharT = char] 192 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:136:7:static constexpr bool __gnu_cxx::char_traits<_CharT>::eq(const char_type&, const char_type&) [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:3906:7:constexpr std::__format::_Scanner<_CharT>::_Scanner(std::basic_string_view<_CharT>, std::size_t) [with _CharT = char] 192 static
|
||||
/usr/include/c++/14.2.1/format:244:7:constexpr std::basic_format_parse_context<_CharT>::basic_format_parse_context(std::basic_string_view<_CharT>, std::size_t) [with _CharT = char] 192 static
|
||||
/usr/include/c++/14.2.1/string_view:187:7:constexpr const std::basic_string_view<_CharT, _Traits>::value_type* std::basic_string_view<_CharT, _Traits>::begin() const [with _CharT = char; _Traits = std::char_traits<char>] 32 static
|
||||
/usr/include/c++/14.2.1/string_view:192:7:constexpr const std::basic_string_view<_CharT, _Traits>::value_type* std::basic_string_view<_CharT, _Traits>::end() const [with _CharT = char; _Traits = std::char_traits<char>] 48 static
|
||||
/usr/include/c++/14.2.1/string_view:229:7:constexpr std::basic_string_view<_CharT, _Traits>::size_type std::basic_string_view<_CharT, _Traits>::size() const [with _CharT = char; _Traits = std::char_traits<char>] 32 static
|
||||
/usr/include/c++/14.2.1/string_view:254:7:constexpr const std::basic_string_view<_CharT, _Traits>::value_type& std::basic_string_view<_CharT, _Traits>::operator[](size_type) const [with _CharT = char; _Traits = std::char_traits<char>] 48 static
|
||||
/usr/include/c++/14.2.1/format:3914:7:constexpr void std::__format::_Scanner<_CharT>::_M_scan() [with _CharT = char] 352 static
|
||||
/usr/include/c++/14.2.1/format:3977:7:constexpr std::basic_string_view<_CharT> std::__format::_Scanner<_CharT>::_M_fmt_str() const [with _CharT = char] 176 static
|
||||
/usr/include/c++/14.2.1/format:3910:26:constexpr std::__format::_Scanner<_CharT>::iterator std::__format::_Scanner<_CharT>::begin() const [with _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:252:32:constexpr std::basic_format_parse_context<_CharT>::const_iterator std::basic_format_parse_context<_CharT>::begin() const [with _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:3911:26:constexpr std::__format::_Scanner<_CharT>::iterator std::__format::_Scanner<_CharT>::end() const [with _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:253:32:constexpr std::basic_format_parse_context<_CharT>::const_iterator std::basic_format_parse_context<_CharT>::end() const [with _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/string_view:155:2:constexpr std::basic_string_view<_CharT, _Traits>::basic_string_view(_It, _End) [with _It = const char*; _End = const char*; _CharT = char; _Traits = std::char_traits<char>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/ptr_traits.h:241:5:constexpr _Tp* std::to_address(_Tp*) [with _Tp = const char] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ptr_traits.h:205:5:constexpr _Tp* std::__to_address(_Tp*) [with _Tp = const char] 16 static
|
||||
/usr/include/c++/14.2.1/bits/string_view.tcc:80:5:constexpr std::basic_string_view<_CharT, _Traits>::size_type std::basic_string_view<_CharT, _Traits>::find(_CharT, size_type) const [with _CharT = char; _Traits = std::char_traits<char>] 224 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:210:5:static constexpr const __gnu_cxx::char_traits<_CharT>::char_type* __gnu_cxx::char_traits<_CharT>::find(const char_type*, std::size_t, const char_type&) [with _CharT = char] 80 static
|
||||
/usr/include/c++/14.2.1/format:3980:30:constexpr void std::__format::_Scanner<_CharT>::_M_on_chars(iterator) [with _CharT = char] 16 static
|
||||
/usr/include/c++/14.2.1/format:256:7:constexpr void std::basic_format_parse_context<_CharT>::advance_to(const_iterator) [with _CharT = char] 32 static
|
||||
c.cc:38:20:void NO() 8 static
|
||||
c.cc:42:20:void YES() 8 static
|
||||
c.cc:79:6:void solve() 352 static
|
||||
c.cc:98:5:int main() 192 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:94:5:) [with _Tp = char; _Args = {const char&}] 48 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:222:5:static constexpr __gnu_cxx::char_traits<_CharT>::char_type* __gnu_cxx::char_traits<_CharT>::move(char_type*, const char_type*, std::size_t) [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:253:5:static constexpr __gnu_cxx::char_traits<_CharT>::char_type* __gnu_cxx::char_traits<_CharT>::copy(char_type*, const char_type*, std::size_t) [with _CharT = char] 80 static
|
||||
/usr/include/c++/14.2.1/bits/char_traits.h:273:5:static constexpr __gnu_cxx::char_traits<_CharT>::char_type* __gnu_cxx::char_traits<_CharT>::assign(char_type*, std::size_t, char_type) [with _CharT = char] 224 static
|
||||
/usr/include/c++/14.2.1/string_view:289:7:constexpr const std::basic_string_view<_CharT, _Traits>::value_type* std::basic_string_view<_CharT, _Traits>::data() const [with _CharT = char; _Traits = std::char_traits<char>] 32 static
|
||||
/usr/include/c++/14.2.1/string_view:146:7:constexpr std::basic_string_view<_CharT, _Traits>::basic_string_view(const _CharT*, size_type) [with _CharT = char; _Traits = std::char_traits<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:227:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::pointer std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_data() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:259:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_set_length(size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 176 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:808:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::~basic_string() [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/charconv.h:81:5:constexpr void std::__detail::__to_chars_10_impl(char*, unsigned int, _Tp) [with _Tp = unsigned int] 464 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:341:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::allocator_type& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_get_allocator() [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:267:7:constexpr bool std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_is_local() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1083:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::size_type std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::length() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:682:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::basic_string(std::__cxx11::basic_string<_CharT, _Traits, _Alloc>&&) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 96 static
|
||||
/usr/include/c++/14.2.1/bits/charconv.h:81:5:constexpr void std::__detail::__to_chars_10_impl(char*, unsigned int, _Tp) [with _Tp = long unsigned int] 480 static
|
||||
/usr/include/c++/14.2.1/bits/charconv.h:81:5:constexpr void std::__detail::__to_chars_10_impl(char*, unsigned int, _Tp) [with _Tp = long long unsigned int] 480 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:949:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::operator __sv_type() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 176 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:193:2:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_Alloc_hider::_Alloc_hider(std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::pointer, const _Alloc&) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 80 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = int] 32 static
|
||||
/usr/include/c++/14.2.1/charconv:319:5:constexpr std::to_chars_result std::__to_chars_i(char*, char*, _Tp, int) [with _Tp = unsigned char] 80 static
|
||||
/usr/include/c++/14.2.1/charconv:319:5:constexpr std::to_chars_result std::__to_chars_i(char*, char*, _Tp, int) [with _Tp = unsigned int] 80 static
|
||||
/usr/include/c++/14.2.1/charconv:319:5:constexpr std::to_chars_result std::__to_chars_i(char*, char*, _Tp, int) [with _Tp = long unsigned int] 80 static
|
||||
/usr/include/c++/14.2.1/charconv:319:5:constexpr std::to_chars_result std::__to_chars_i(char*, char*, _Tp, int) [with _Tp = long long unsigned int] 80 static
|
||||
/usr/include/c++/14.2.1/bit:201:5:constexpr int std::__countl_zero(_Tp) [with _Tp = unsigned int] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algo.h:2019:5:constexpr _FIter std::upper_bound(_FIter, _FIter, const _Tp&) [with _FIter = const char32_t*; _Tp = char32_t] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:1530:5:constexpr _ForwardIterator std::lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = const unsigned int*; _Tp = unsigned int] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algo.h:3842:5:constexpr _IIter std::find(_IIter, _IIter, const _Tp&) [with _IIter = const char32_t*; _Tp = char32_t] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:94:5:) [with _Tp = locale; _Args = {}] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __format::_Seq_sink<__cxx11::basic_string<char> >&] 32 static
|
||||
/usr/include/c++/14.2.1/format:2877:7:_Seq std::__format::_Seq_sink<_Seq>::get() && [with _Seq = std::__cxx11::basic_string<char>] 240 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:474:2:constexpr auto std::ranges::__access::_Data::operator()(_Tp&&) const [with _Tp = std::__cxx11::basic_string<char>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:352:2:constexpr auto std::ranges::__access::_Size::operator()(_Tp&&) const [with _Tp = std::__cxx11::basic_string<char>&] 32 static
|
||||
/usr/include/c++/14.2.1/format:2887:7:std::span<typename _Seq::value_type> std::__format::_Seq_sink<_Seq>::view() [with _Seq = std::__cxx11::basic_string<char>] 256 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:2653:7:constexpr const _CharT* std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::data() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __cxx11::basic_string<char>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1222:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::clear() [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1231:7:constexpr bool std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::empty() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:51:5:constexpr _Tp* std::__addressof(_Tp&) [with _Tp = __cxx11::basic_string<char>] 16 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:858:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::operator=(std::__cxx11::basic_string<_CharT, _Traits, _Alloc>&&) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 112 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1692:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::assign(const _CharT*) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:117:2:constexpr auto std::ranges::__access::_Begin::operator()(_Tp&&) const [with _Tp = std::ranges::subrange<const char*, const char*, std::ranges::subrange_kind::sized>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:167:2:constexpr auto std::ranges::__access::_End::operator()(_Tp&&) const [with _Tp = std::ranges::subrange<const char*, const char*, std::ranges::subrange_kind::sized>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:578:22:constexpr bool std::__unicode::_Utf_view<_ToFormat, _Range>::empty() const [with _ToFormat = char32_t; _Range = std::ranges::subrange<const char*, const char*, std::ranges::subrange_kind::sized>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:433:2:constexpr bool std::ranges::__access::_Empty::operator()(_Tp&&) const [with _Tp = const std::ranges::subrange<const char*, const char*, std::ranges::subrange_kind::sized>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_util.h:363:22:constexpr bool std::ranges::subrange<_It, _Sent, _Kind>::empty() const [with _It = const char*; _Sent = const char*; std::ranges::subrange_kind _Kind = std::ranges::subrange_kind::sized] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:546:2:constexpr auto std::__unicode::_Utf_view<_ToFormat, _Range>::_M_begin(_Iter, _Sent) [with _Iter = const char*; _Sent = const char*; _ToFormat = char32_t; _Range = std::ranges::subrange<const char*, const char*, std::ranges::subrange_kind::sized>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:572:22:constexpr auto std::__unicode::_Utf_view<_ToFormat, _Range>::begin() [with _ToFormat = char32_t; _Range = std::ranges::subrange<const char*, const char*, std::ranges::subrange_kind::sized>] 64 static
|
||||
/usr/include/c++/14.2.1/format:431:7:constexpr std::__format::_Spec<_CharT>::iterator std::__format::_Spec<_CharT>::_M_parse_fill_and_align(iterator, iterator) [with _CharT = char] 416 static
|
||||
/usr/include/c++/14.2.1/format:559:7:constexpr std::__format::_Spec<_CharT>::iterator std::__format::_Spec<_CharT>::_M_parse_width(iterator, iterator, std::basic_format_parse_context<_CharT>&) [with _CharT = char] 208 static
|
||||
/usr/include/c++/14.2.1/print:128:5:) [with _Args = {}] 160 static
|
||||
/usr/include/c++/14.2.1/format:260:7:constexpr std::size_t std::basic_format_parse_context<_CharT>::next_arg_id() [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_pair.h:1255:5:constexpr typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&& std::get(pair<_Tp1, _Tp2>&&) [with long unsigned int _Int = 0; _Tp1 = short unsigned int; _Tp2 = const char*] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = pair<short unsigned int, const char*>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_pair.h:1205:2:static constexpr _Tp1&& std::__pair_get<0>::__move_get(std::pair<_T1, _T2>&&) [with _Tp1 = short unsigned int; _Tp2 = const char*] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = short unsigned int] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_pair.h:1255:5:constexpr typename std::tuple_element<_Int, std::pair<_Tp1, _Tp2> >::type&& std::get(pair<_Tp1, _Tp2>&&) [with long unsigned int _Int = 1; _Tp1 = short unsigned int; _Tp2 = const char*] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_pair.h:1229:2:static constexpr _Tp2&& std::__pair_get<1>::__move_get(std::pair<_T1, _T2>&&) [with _Tp1 = short unsigned int; _Tp2 = const char*] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = const char*] 32 static
|
||||
/usr/include/c++/14.2.1/format:3982:22:constexpr void std::__format::_Scanner<_CharT>::_M_on_replacement_field() [with _CharT = char] 208 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:569:7:constexpr std::vector<_Tp, _Alloc>::vector(size_type, const value_type&, const allocator_type&) [with _Tp = int; _Alloc = std::allocator<int>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:733:7:constexpr std::vector<_Tp, _Alloc>::~vector() [with _Tp = int; _Alloc = std::allocator<int>] 80 static
|
||||
c.cc:26:24:T sz(auto:59&&) [with T = int; auto:59 = std::__cxx11::basic_string<char>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1265:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::reference std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::operator[](size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:1128:7:constexpr std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::operator[](size_type) [with _Tp = int; _Alloc = std::allocator<int>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = const char&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:94:5:) [with _Tp = char; _Args = {char&}] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:222:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_length(size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:285:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_dispose() [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:243:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::const_pointer std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_local_data() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:217:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_data(pointer) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:254:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_capacity(size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/charconv:115:5:constexpr unsigned int std::__detail::__to_chars_len_2(_Tp) [with _Tp = unsigned int] 32 static
|
||||
/usr/include/c++/14.2.1/charconv:161:5:constexpr std::to_chars_result std::__detail::__to_chars_16(char*, char*, _Tp) [with _Tp = unsigned int] 240 static
|
||||
/usr/include/c++/14.2.1/charconv:207:5:constexpr std::to_chars_result std::__detail::__to_chars_10(char*, char*, _Tp) [with _Tp = unsigned int] 208 static
|
||||
/usr/include/c++/14.2.1/charconv:230:5:constexpr std::to_chars_result std::__detail::__to_chars_8(char*, char*, _Tp) [with _Tp = unsigned int] 208 static
|
||||
/usr/include/c++/14.2.1/charconv:283:5:constexpr std::to_chars_result std::__detail::__to_chars_2(char*, char*, _Tp) [with _Tp = unsigned int] 208 static
|
||||
/usr/include/c++/14.2.1/charconv:121:5:constexpr std::to_chars_result std::__detail::__to_chars(char*, char*, _Tp, int) [with _Tp = unsigned int] 320 static
|
||||
/usr/include/c++/14.2.1/charconv:115:5:constexpr unsigned int std::__detail::__to_chars_len_2(_Tp) [with _Tp = long unsigned int] 32 static
|
||||
/usr/include/c++/14.2.1/charconv:161:5:constexpr std::to_chars_result std::__detail::__to_chars_16(char*, char*, _Tp) [with _Tp = long unsigned int] 256 static
|
||||
/usr/include/c++/14.2.1/charconv:207:5:constexpr std::to_chars_result std::__detail::__to_chars_10(char*, char*, _Tp) [with _Tp = long unsigned int] 208 static
|
||||
/usr/include/c++/14.2.1/charconv:230:5:constexpr std::to_chars_result std::__detail::__to_chars_8(char*, char*, _Tp) [with _Tp = long unsigned int] 224 static
|
||||
/usr/include/c++/14.2.1/charconv:283:5:constexpr std::to_chars_result std::__detail::__to_chars_2(char*, char*, _Tp) [with _Tp = long unsigned int] 224 static
|
||||
/usr/include/c++/14.2.1/charconv:121:5:constexpr std::to_chars_result std::__detail::__to_chars(char*, char*, _Tp, int) [with _Tp = long unsigned int] 336 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algo.h:1980:5:constexpr _ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = const char32_t*; _Tp = char32_t; _Compare = __gnu_cxx::__ops::_Val_less_iter] 320 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:1491:5:constexpr _ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = const unsigned int*; _Tp = unsigned int; _Compare = __gnu_cxx::__ops::_Iter_less_val] 320 static
|
||||
/usr/include/c++/14.2.1/bits/predefined_ops.h:276:5:constexpr __gnu_cxx::__ops::_Iter_equals_val<_Value> __gnu_cxx::__ops::__iter_equals_val(_Value&) [with _Value = const char32_t] 160 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:2150:5:constexpr _Iterator std::__find_if(_Iterator, _Iterator, _Predicate) [with _Iterator = const char32_t*; _Predicate = __gnu_cxx::__ops::_Iter_equals_val<const char32_t>] 208 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __format::_Sink_iter<char>&] 32 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = std::monostate] 16 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = bool] 240 static
|
||||
/usr/include/c++/14.2.1/format:2635:7:auto std::__format::_Sink_iter<_CharT>::_M_reserve(std::size_t) const [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = char] 192 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = int] 208 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = unsigned int] 192 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = long long int] 208 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = long long unsigned int] 192 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = float] 16 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = double] 16 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = long double] 16 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = const char*] 224 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = std::basic_string_view<char>] 224 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = const void*] 16 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = std::basic_format_arg<std::basic_format_context<std::__format::_Sink_iter<char>, char> >::handle] 16 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = __int128] 16 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = __int128 unsigned] 16 static
|
||||
/usr/include/c++/14.2.1/format:4127:28:std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)> [with auto:40 = _Float128] 16 static
|
||||
/usr/include/c++/14.2.1/format:3502:2:decltype(auto) std::basic_format_arg<_Context>::_M_visit(_Visitor&&, std::__format::_Arg_t) [with _Visitor = std::__format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)>; _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>] 80 static
|
||||
/usr/include/c++/14.2.1/format:3568:5:decltype(auto) std::visit_format_arg(_Visitor&&, basic_format_arg<_Context>) [with _Visitor = __format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)>; _Context = basic_format_context<__format::_Sink_iter<char>, char>] 208 static
|
||||
/usr/include/c++/14.2.1/format:3868:7:std::basic_format_context<_Out, _CharT>::~basic_format_context() [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:4110:5:_Out std::__format::__do_vformat_to(_Out, std::basic_string_view<_CharT>, const std::basic_format_args<_Context>&, const std::locale*) [with _Out = _Sink_iter<char>; _CharT = char; _Context = std::basic_format_context<_Sink_iter<char>, char>] 1136 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/span:261:7:constexpr bool std::span<_Type, _Extent>::empty() const [with _Type = char; long unsigned int _Extent = 18446744073709551615] 32 static
|
||||
/usr/include/c++/14.2.1/format:2793:7:void std::__format::_Seq_sink<_Seq>::_M_overflow() [with _Seq = std::__cxx11::basic_string<char>] 256 static
|
||||
/usr/include/c++/14.2.1/bits/ptr_traits.h:205:5:constexpr _Tp* std::__to_address(_Tp*) [with _Tp = char] 16 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:2665:7:constexpr _CharT* std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::data() [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/span:213:2:constexpr std::span<_Type, _Extent>::span(_Range&&) [with _Range = std::__cxx11::basic_string<char>&; _Type = char; long unsigned int _Extent = 18446744073709551615] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:51:5:constexpr _Tp* std::__addressof(_Tp&) [with _Tp = int] 16 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:293:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_destroy(size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 112 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:430:7:static constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_S_copy(_CharT*, const _CharT*, size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1180:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::size_type std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::capacity() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:51:5:constexpr _Tp* std::__addressof(_Tp&) [with _Tp = const __cxx11::basic_string<char>] 16 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:277:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_assign(const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>&) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 192 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:304:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::reserve(size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 192 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1397:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::operator+=(_CharT) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:391:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::size_type std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_check(size_type, const char*) const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:511:5:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Allocator>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_replace(size_type, size_type, const _CharT*, size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 144 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_util.h:354:7:constexpr _It std::ranges::subrange<_It, _Sent, _Kind>::begin() const requires copyable<_It> [with _It = const char*; _Sent = const char*; std::ranges::subrange_kind _Kind = std::ranges::subrange_kind::sized] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_util.h:361:23:constexpr _Sent std::ranges::subrange<_It, _Sent, _Kind>::end() const [with _It = const char*; _Sent = const char*; std::ranges::subrange_kind _Kind = std::ranges::subrange_kind::sized] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_util.h:298:7:constexpr std::ranges::subrange<_It, _Sent, _Kind>::subrange(auto:1, _Sent) requires ! std::ranges::subrange<_It, _Sent, _Kind>::_S_store_size [with auto:1 = const char*; _It = const char*; _Sent = const char*; std::ranges::subrange_kind _Kind = std::ranges::subrange_kind::sized] 192 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:570:7:constexpr std::__unicode::_Utf_view<_ToFormat, _Range>::_Utf_view(_Range&&) [with _ToFormat = char32_t; _Range = std::ranges::subrange<const char*, const char*, std::ranges::subrange_kind::sized>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:480:7:constexpr _Iter& std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_M_curr() [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:108:7:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_Utf_iterator(_Iter, _Iter, _Sent) requires bidirectional_iterator<_Iter> [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 192 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:175:7:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler> std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::operator++(int) [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 64 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:155:7:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::value_type std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::operator*() const [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:150:7:constexpr _Iter std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::base() const requires forward_iterator<_Iter> [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 32 static
|
||||
/usr/include/c++/14.2.1/format:418:7:static constexpr std::__format::_Align std::__format::_Spec<_CharT>::_S_align(_CharT) [with _CharT = char] 16 static
|
||||
/usr/include/c++/14.2.1/format:522:7:static constexpr std::__format::_Spec<_CharT>::iterator std::__format::_Spec<_CharT>::_S_parse_width_or_precision(iterator, iterator, short unsigned int&, bool&, std::basic_format_parse_context<_CharT>&) [with _CharT = char] 272 static
|
||||
/usr/include/c++/14.2.1/format:851:20:std::__format::__formatter_str<char>::parse(std::basic_format_parse_context<char>&)::<lambda()> 48 static
|
||||
/usr/include/c++/14.2.1/format:855:20:std::__format::__formatter_str<char>::parse(std::basic_format_parse_context<char>&)::<lambda()> 48 static
|
||||
/usr/include/c++/14.2.1/format:845:7:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_str<_CharT>::parse(std::basic_format_parse_context<_CharT>&) [with _CharT = char] 336 static
|
||||
/usr/include/c++/14.2.1/print:120:5:) [with _Args = {}] 272 static
|
||||
/usr/include/c++/14.2.1/format:336:5:constexpr std::pair<short unsigned int, const _CharT*> std::__format::__parse_arg_id(const _CharT*, const _CharT*) [with _CharT = char] 416 static
|
||||
/usr/include/c++/14.2.1/format:275:7:constexpr void std::basic_format_parse_context<_CharT>::check_arg_id(std::size_t) [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:1917:7:static constexpr std::vector<_Tp, _Alloc>::size_type std::vector<_Tp, _Alloc>::_S_check_init_len(size_type, const allocator_type&) [with _Tp = int; _Alloc = std::allocator<int>] 192 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:145:2:constexpr std::_Vector_base<_Tp, _Alloc>::_Vector_impl::_Vector_impl(const std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type&) [with _Tp = int; _Alloc = std::allocator<int>] 80 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:98:2:constexpr std::_Vector_base<_Tp, _Alloc>::_Vector_impl_data::_Vector_impl_data() [with _Tp = int; _Alloc = std::allocator<int>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:132:14:constexpr std::_Vector_base<int, std::allocator<int> >::_Vector_impl::~_Vector_impl() 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:332:7:constexpr std::_Vector_base<_Tp, _Alloc>::_Vector_base(std::size_t, const allocator_type&) [with _Tp = int; _Alloc = std::allocator<int>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:366:7:constexpr std::_Vector_base<_Tp, _Alloc>::~_Vector_base() [with _Tp = int; _Alloc = std::allocator<int>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:1706:7:constexpr void std::vector<_Tp, _Alloc>::_M_fill_initialize(size_type, const value_type&) [with _Tp = int; _Alloc = std::allocator<int>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:300:7:constexpr std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type& std::_Vector_base<_Tp, _Alloc>::_M_get_Tp_allocator() [with _Tp = int; _Alloc = std::allocator<int>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = char&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ptr_traits.h:134:7:static constexpr _Tp* std::__ptr_traits_ptr_to<_Tp*, _Tp, false>::pointer_to(element_type&) [with _Tp = const char] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:138:5:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::pointer std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_create(size_type&, size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 64 static
|
||||
/usr/include/c++/14.2.1/bit:371:5:constexpr int std::__bit_width(_Tp) [with _Tp = long unsigned int] 64 static
|
||||
/usr/include/c++/14.2.1/bits/predefined_ops.h:97:7:constexpr bool __gnu_cxx::__ops::_Val_less_iter::operator()(_Value&, _Iterator) const [with _Value = const char32_t; _Iterator = const char32_t*] 64 static
|
||||
/usr/include/c++/14.2.1/bits/predefined_ops.h:68:7:constexpr bool __gnu_cxx::__ops::_Iter_less_val::operator()(_Iterator, _Value&) const [with _Iterator = const unsigned int*; _Value = const unsigned int] 64 static
|
||||
/usr/include/c++/14.2.1/bits/predefined_ops.h:262:7:constexpr __gnu_cxx::__ops::_Iter_equals_val<_Value>::_Iter_equals_val(_Value&) [with _Value = const char32_t] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:2099:5:constexpr _RandomAccessIterator std::__find_if(_RandomAccessIterator, _RandomAccessIterator, _Predicate, random_access_iterator_tag) [with _RandomAccessIterator = const char32_t*; _Predicate = __gnu_cxx::__ops::_Iter_equals_val<const char32_t>] 208 static
|
||||
/usr/include/c++/14.2.1/span:187:2:constexpr std::span<_Type, _Extent>::span(std::type_identity_t<_Type> (&)[_ArrayExtent]) [with long unsigned int _ArrayExtent = 256; _Type = char; long unsigned int _Extent = 18446744073709551615] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:175:5:constexpr _Tp* std::addressof(_Tp&) [with _Tp = __format::_Sink<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = __format::__do_vformat_to<_Sink_iter<char>, char, std::basic_format_context<_Sink_iter<char>, char> >(_Sink_iter<char>, std::basic_string_view<char>, const std::basic_format_args<std::basic_format_context<_Sink_iter<char>, char> >&, const std::locale*)::<lambda(auto:40&)>] 32 static
|
||||
/usr/include/c++/14.2.1/format:2736:7:std::__format::_Sink<_CharT>::_Reservation std::__format::_Sink<_CharT>::_M_reserve(std::size_t) [with _CharT = char] 304 static
|
||||
/usr/include/c++/14.2.1/format:2723:11:std::__format::_Sink<_CharT>::_Reservation::operator bool() const [with _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:2725:10:_CharT* std::__format::_Sink<_CharT>::_Reservation::get() const [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2727:7:void std::__format::_Sink<_CharT>::_Reservation::_M_bump(std::size_t) [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:3845:7:std::basic_format_context<_Out, _CharT>::basic_format_context(std::basic_format_args<std::basic_format_context<_Out, _CharT> >, _Out) [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 224 static
|
||||
/usr/include/c++/14.2.1/format:3850:7:std::basic_format_context<_Out, _CharT>::basic_format_context(std::basic_format_args<std::basic_format_context<_Out, _CharT> >, _Out, const std::locale&) [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 224 static
|
||||
/usr/include/c++/14.2.1/format:4021:7:std::__format::_Formatting_scanner<_Out, _CharT>::_Formatting_scanner(std::basic_format_context<_Out, _CharT>&, std::basic_string_view<_CharT>) [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 192 static
|
||||
/usr/include/c++/14.2.1/format:3884:16:std::basic_format_context<_Out, _CharT>::iterator std::basic_format_context<_Out, _CharT>::out() [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/span:311:7:constexpr std::span<_Type, _Extent>::iterator std::span<_Type, _Extent>::begin() const [with _Type = char; long unsigned int _Extent = 18446744073709551615] 160 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:1325:5:constexpr typename __gnu_cxx::__normal_iterator<_Iterator, _Container>::difference_type __gnu_cxx::operator-(const __normal_iterator<_Iterator, _Container>&, const __normal_iterator<_Iterator, _Container>&) [with _Iterator = char*; _Container = std::span<char, 18446744073709551615>] 48 static
|
||||
/usr/include/c++/14.2.1/span:368:7:constexpr std::span<_Type, 18446744073709551615> std::span<_Type, _Extent>::first(size_type) const [with _Type = char; long unsigned int _Extent = 18446744073709551615] 160 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1466:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::append(const _CharT*, size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/string_view:334:7:constexpr std::basic_string_view<_CharT, _Traits> std::basic_string_view<_CharT, _Traits>::substr(size_type, size_type) const [with _CharT = char; _Traits = std::char_traits<char>] 272 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:450:5:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Allocator>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_replace_aux(size_type, size_type, size_type, _CharT) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 112 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1572:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::push_back(_CharT) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 192 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1541:9:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_If_sv<_Tp, std::__cxx11::basic_string<_CharT, _Traits, _Alloc>&> std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::append(const _Tp&) [with _Tp = std::basic_string_view<char>; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 176 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1089:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::size_type std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::max_size() const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 16 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:402:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_check_length(size_type, size_type, const char*) const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:129:7:static constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::pointer std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_S_allocate(_Char_alloc_type&, size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 192 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:420:7:bool std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_disjunct(const _CharT*) const [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 224 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:440:7:static constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_S_move(_CharT*, const _CharT*, size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:325:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_mutate(size_type, size_type, const _CharT*, size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 224 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = const char*&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = ranges::subrange<const char*, const char*, std::ranges::subrange_kind::sized>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:509:4:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_First_and_curr<_It>::_First_and_curr(_It, _It) [with _It = const char*; _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:231:7:constexpr void std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_M_read() [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:158:7:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>& std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::operator++() [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 80 static
|
||||
/usr/include/c++/14.2.1/array:214:7:constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = char32_t; long unsigned int _Nm = 1] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:483:7:constexpr _Iter std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_M_curr() const [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 32 static
|
||||
/usr/include/c++/14.2.1/format:307:5:constexpr std::pair<short unsigned int, const _CharT*> std::__format::__parse_integer(const _CharT*, const _CharT*) [with _CharT = char] 336 static
|
||||
/usr/include/c++/14.2.1/format:4296:5:) [with _Args = {}] 256 static
|
||||
/usr/include/c++/14.2.1/print:104:5:) [with _Args = {__cxx11::basic_string<char, char_traits<char>, allocator<char> >}] 352 static
|
||||
/usr/include/c++/14.2.1/format:575:7:constexpr std::__format::_Spec<_CharT>::iterator std::__format::_Spec<_CharT>::_M_parse_precision(iterator, iterator, std::basic_format_parse_context<_CharT>&) [with _CharT = char] 208 static
|
||||
/usr/include/c++/14.2.1/bits/stl_pair.h:442:2:constexpr std::pair<_T1, _T2>::pair(_U1&&, _U2&&) [with _U1 = int; _U2 = const char*; _T1 = short unsigned int; _T2 = const char*] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_pair.h:428:7:constexpr std::pair<_T1, _T2>::pair(const _T1&, const _T2&) requires _S_constructible<const _T1&, const _T2&>() [with _T1 = short unsigned int; _T2 = const char*] 64 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = std::nullptr_t] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_pair.h:442:2:constexpr std::pair<_T1, _T2>::pair(_U1&&, _U2&&) [with _U1 = int; _U2 = std::nullptr_t; _T1 = short unsigned int; _T2 = const char*] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:1926:7:static constexpr std::vector<_Tp, _Alloc>::size_type std::vector<_Tp, _Alloc>::_S_max_size(const _Tp_alloc_type&) [with _Tp = int; _Alloc = std::allocator<int>] 192 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:396:7:constexpr void std::_Vector_base<_Tp, _Alloc>::_M_create_storage(std::size_t) [with _Tp = int; _Alloc = std::allocator<int>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:385:7:constexpr void std::_Vector_base<_Tp, _Alloc>::_M_deallocate(pointer, std::size_t) [with _Tp = int; _Alloc = std::allocator<int>] 112 static
|
||||
/usr/include/c++/14.2.1/bits/stl_uninitialized.h:465:5:constexpr _ForwardIterator std::__uninitialized_fill_n_a(_ForwardIterator, _Size, const _Tp&, allocator<_Tp2>&) [with _ForwardIterator = int*; _Size = long unsigned int; _Tp = int; _Tp2 = int] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:182:5:constexpr void std::_Destroy(_ForwardIterator, _ForwardIterator) [with _ForwardIterator = int*] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:175:5:constexpr _Tp* std::addressof(_Tp&) [with _Tp = const char] 32 static
|
||||
/usr/include/c++/14.2.1/bit:201:5:constexpr int std::__countl_zero(_Tp) [with _Tp = long unsigned int] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator_base_funcs.h:184:5:constexpr void std::__advance(_RandomAccessIterator&, _Distance, random_access_iterator_tag) [with _RandomAccessIterator = const char32_t*; _Distance = long int] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator_base_funcs.h:184:5:constexpr void std::__advance(_RandomAccessIterator&, _Distance, random_access_iterator_tag) [with _RandomAccessIterator = const unsigned int*; _Distance = long int] 48 static
|
||||
/usr/include/c++/14.2.1/bits/predefined_ops.h:269:2:constexpr bool __gnu_cxx::__ops::_Iter_equals_val<_Value>::operator()(_Iterator) [with _Iterator = const char32_t*; _Value = const char32_t] 48 static
|
||||
/usr/include/c++/14.2.1/string_view:303:7:constexpr void std::basic_string_view<_CharT, _Traits>::remove_suffix(size_type) [with _CharT = char; _Traits = std::char_traits<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:51:5:constexpr _Tp* std::__addressof(_Tp&) [with _Tp = __format::_Sink<char>] 16 static
|
||||
/usr/include/c++/14.2.1/format:3656:7:std::__format::_Arg_t std::basic_format_args<_Context>::_M_type(std::size_t) const [with _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:1067:7:constexpr __gnu_cxx::__normal_iterator<_Iterator, _Container>::__normal_iterator(const _Iterator&) [with _Iterator = char*; _Container = std::span<char, 18446744073709551615>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:1095:7:constexpr __gnu_cxx::__normal_iterator<_Iterator, _Container>::pointer __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator->() const [with _Iterator = char*; _Container = std::span<char, 18446744073709551615>] 32 static
|
||||
/usr/include/c++/14.2.1/format:2753:7:void std::__format::_Sink<_CharT>::_M_bump(std::size_t) [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:1153:7:constexpr const _Iterator& __gnu_cxx::__normal_iterator<_Iterator, _Container>::base() const [with _Iterator = char*; _Container = std::span<char, 18446744073709551615>] 32 static
|
||||
/usr/include/c++/14.2.1/span:157:2:constexpr std::span<_Type, _Extent>::span(_It, size_type) [with _It = char*; _Type = char; long unsigned int _Extent = 18446744073709551615] 64 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:413:5:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Allocator>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_append(const _CharT*, size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 80 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:450:7:static constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_S_assign(_CharT*, size_type, _CharT) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 192 static
|
||||
/usr/include/c++/14.2.1/bits/new_allocator.h:156:7:void std::__new_allocator<_Tp>::deallocate(_Tp*, size_type) [with _Tp = char] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_function.h:448:7:constexpr bool std::less<_Tp*>::operator()(_Tp*, _Tp*) const [with _Tp = const char] 16 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:269:16:std::__unicode::_Utf_iterator<char, char32_t, const char*, const char*, std::__unicode::_Repl>::_M_read_utf8()::<lambda()> 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:262:7:constexpr void std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_M_read_utf8() [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 272 static
|
||||
/usr/include/c++/14.2.1/charconv:448:5:constexpr unsigned char std::__detail::__from_chars_alnum_to_val(unsigned char) [with bool _DecOnly = true] 16 static
|
||||
/usr/include/c++/14.2.1/charconv:517:5:constexpr bool std::__detail::__from_chars_alnum(const char*&, const char*, _Tp&, int) [with bool _DecOnly = true; _Tp = short unsigned int] 80 static
|
||||
/usr/include/c++/14.2.1/bits/stl_pair.h:442:2:constexpr std::pair<_T1, _T2>::pair(_U1&&, _U2&&) [with _U1 = short unsigned int&; _U2 = const char*&; _T1 = short unsigned int; _T2 = const char*] 64 static
|
||||
/usr/include/c++/14.2.1/format:3766:7:>&) [with _Args = {}; _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:257:7:constexpr std::reverse_iterator<_Iterator>::reference std::reverse_iterator<_Iterator>::operator*() const [with _Iterator = const std::__format::_Arg_t*] 64 static
|
||||
/usr/include/c++/14.2.1/array:167:7:constexpr std::array<_Tp, _Nm>::const_reverse_iterator std::array<_Tp, _Nm>::rend() const [with _Tp = std::__format::_Arg_t; long unsigned int _Nm = 1] 32 static
|
||||
/usr/include/c++/14.2.1/array:137:7:constexpr const std::array<_Tp, _Nm>::value_type* std::array<_Tp, _Nm>::begin() const [with _Tp = std::__format::_Arg_t; long unsigned int _Nm = 1] 32 static
|
||||
/usr/include/c++/14.2.1/array:287:7:constexpr const std::array<_Tp, _Nm>::value_type* std::array<_Tp, _Nm>::data() const [with _Tp = std::__format::_Arg_t; long unsigned int _Nm = 1] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:188:7:constexpr std::reverse_iterator<_Iterator>::reverse_iterator(iterator_type) [with _Iterator = const std::__format::_Arg_t*] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:241:7:constexpr std::reverse_iterator<_Iterator>::iterator_type std::reverse_iterator<_Iterator>::base() const [with _Iterator = const std::__format::_Arg_t*] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:586:5:constexpr bool std::operator==(const reverse_iterator<_IteratorL>&, const reverse_iterator<_IteratorL>&) requires requires{{std::operator==::__x->base() == std::operator==::__y->base()} -> decltype(auto) [requires std::convertible_to<<placeholder>, bool>];} [with _Iterator = const __format::_Arg_t*] 48 static
|
||||
/usr/include/c++/14.2.1/format:3610:5:constexpr auto std::__format::__pack_arg_types(const std::array<_Arg_t, _Nm>&) [with int _Bits = 5; long unsigned int _Nm = 1] 240 static
|
||||
/usr/include/c++/14.2.1/array:157:7:constexpr std::array<_Tp, _Nm>::const_reverse_iterator std::array<_Tp, _Nm>::rbegin() const [with _Tp = std::__format::_Arg_t; long unsigned int _Nm = 1] 32 static
|
||||
/usr/include/c++/14.2.1/array:147:7:constexpr const std::array<_Tp, _Nm>::value_type* std::array<_Tp, _Nm>::end() const [with _Tp = std::__format::_Arg_t; long unsigned int _Nm = 1] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:289:7:constexpr std::reverse_iterator<_Iterator>& std::reverse_iterator<_Iterator>::operator++() [with _Iterator = const std::__format::_Arg_t*] 48 static
|
||||
/usr/include/c++/14.2.1/format:3766:7:>&) [with _Args = {std::basic_string_view<char, std::char_traits<char> >}; _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>] 176 static
|
||||
/usr/include/c++/14.2.1/bits/stl_vector.h:377:7:constexpr std::_Vector_base<_Tp, _Alloc>::pointer std::_Vector_base<_Tp, _Alloc>::_M_allocate(std::size_t) [with _Tp = int; _Alloc = std::allocator<int>] 208 static
|
||||
/usr/include/c++/14.2.1/bits/stl_uninitialized.h:261:5:constexpr _ForwardIterator std::__do_uninit_fill_n(_ForwardIterator, _Size, const _Tp&) [with _ForwardIterator = int*; _Size = long unsigned int; _Tp = int] 80 static
|
||||
/usr/include/c++/14.2.1/bits/stl_uninitialized.h:312:5:_ForwardIterator std::uninitialized_fill_n(_ForwardIterator, _Size, const _Tp&) [with _ForwardIterator = int*; _Size = long unsigned int; _Tp = int] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:160:2:static constexpr void std::_Destroy_aux<<anonymous> >::__destroy(_ForwardIterator, _ForwardIterator) [with _ForwardIterator = int*; bool <anonymous> = false] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:172:9:static void std::_Destroy_aux<true>::__destroy(_ForwardIterator, _ForwardIterator) [with _ForwardIterator = int*] 16 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:51:5:constexpr _Tp* std::__addressof(_Tp&) [with _Tp = const char] 16 static
|
||||
/usr/include/c++/14.2.1/span:430:7:constexpr std::span<_Type, 18446744073709551615> std::span<_Type, _Extent>::subspan(size_type, size_type) const [with _Type = char; long unsigned int _Extent = 18446744073709551615] 192 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:1133:7:constexpr __gnu_cxx::__normal_iterator<_Iterator, _Container>& __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+=(difference_type) [with _Iterator = char*; _Container = std::span<char, 18446744073709551615>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/ptr_traits.h:241:5:constexpr _Tp* std::to_address(_Tp*) [with _Tp = char] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:256:14:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_Guard<_It>::~_Guard() [with _It = const char*; _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:468:7:constexpr char32_t std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_S_error() [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 176 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:403:7:constexpr void std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_M_update(char32_t, uint8_t) [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator_base_funcs.h:184:5:constexpr void std::__advance(_RandomAccessIterator&, _Distance, random_access_iterator_tag) [with _RandomAccessIterator = const char*; _Distance = long int] 48 static
|
||||
/usr/include/c++/14.2.1/charconv:397:5:constexpr bool std::__detail::__raise_and_add(_Tp&, int, unsigned char) [with _Tp = short unsigned int] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = short unsigned int&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = const char*&] 32 static
|
||||
/usr/include/c++/14.2.1/format:3729:2:static std::__format::_Arg_store<_Context, _Args>::_Element_t std::__format::_Arg_store<_Context, _Args>::_S_make_elt(_Tp&) [with _Tp = std::__cxx11::basic_string<char>; _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>; _Args = {std::basic_string_view<char, std::char_traits<char> >}] 224 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:109:5:) [with _Tp = int; _Args = {const int&}] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_uninitialized.h:292:9:static _ForwardIterator std::__uninitialized_fill_n<true>::__uninit_fill_n(_ForwardIterator, _Size, const _Tp&) [with _ForwardIterator = int*; _Size = long unsigned int; _Tp = int] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:146:5:constexpr void std::_Destroy(_Tp*) [with _Tp = int] 32 static
|
||||
/usr/include/c++/14.2.1/bits/new_allocator.h:126:7:_Tp* std::__new_allocator<_Tp>::allocate(size_type, const void*) [with _Tp = char] 64 static
|
||||
/usr/include/c++/14.2.1/array:206:7:constexpr std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) [with _Tp = char32_t; long unsigned int _Nm = 1] 48 static
|
||||
/usr/include/c++/14.2.1/format:3480:2:std::basic_format_arg<_Context>::basic_format_arg(_Tp&) [with _Tp = std::__cxx11::basic_string<char>; _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>] 192 static
|
||||
/usr/include/c++/14.2.1/bits/new_allocator.h:156:7:void std::__new_allocator<_Tp>::deallocate(_Tp*, size_type) [with _Tp = int] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = const int&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:94:5:) [with _Tp = int; _Args = {const int&}] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:1178:5:constexpr _OI std::fill_n(_OI, _Size, const _Tp&) [with _OI = int*; _Size = long unsigned int; _Tp = int] 176 static
|
||||
/usr/include/c++/14.2.1/bits/stl_construct.h:80:5:constexpr void std::destroy_at(_Tp*) [with _Tp = int] 16 static
|
||||
/usr/include/c++/14.2.1/format:3471:2:void std::basic_format_arg<_Context>::_M_set(_Tp) [with _Tp = std::basic_string_view<char>; _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>] 240 static
|
||||
/usr/include/c++/14.2.1/bits/new_allocator.h:126:7:_Tp* std::__new_allocator<_Tp>::allocate(size_type, const void*) [with _Tp = int] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:1143:5:constexpr _OutputIterator std::__fill_n_a(_OutputIterator, _Size, const _Tp&, random_access_iterator_tag) [with _OutputIterator = int*; _Size = long unsigned int; _Tp = int] 64 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:997:5:constexpr void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int] 48 static
|
||||
/usr/include/c++/14.2.1/bits/stl_algobase.h:947:5:constexpr typename __gnu_cxx::__enable_if<std::__is_scalar<_Tp>::__value, void>::__type std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int] 64 static
|
||||
/usr/include/c++/14.2.1/format:4032:7:constexpr void std::__format::_Formatting_scanner<_Out, _CharT>::_M_on_chars(iterator) [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 192 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = std::monostate] 32 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = bool] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = char] 192 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = int] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = unsigned int] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = long long int] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = long long unsigned int] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = float] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = double] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = long double] 224 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = const char*] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = std::basic_string_view<char>] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = const void*] 192 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = std::basic_format_arg<std::basic_format_context<std::__format::_Sink_iter<char>, char> >::handle] 80 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = __int128] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = __int128 unsigned] 208 static
|
||||
/usr/include/c++/14.2.1/format:4044:24:std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)> [with auto:39 = _Float128] 208 static
|
||||
/usr/include/c++/14.2.1/format:3502:2:decltype(auto) std::basic_format_arg<_Context>::_M_visit(_Visitor&&, std::__format::_Arg_t) [with _Visitor = std::__format::_Formatting_scanner<std::__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)>; _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>] 80 static
|
||||
/usr/include/c++/14.2.1/format:3568:5:decltype(auto) std::visit_format_arg(_Visitor&&, basic_format_arg<_Context>) [with _Visitor = __format::_Formatting_scanner<__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)>; _Context = basic_format_context<__format::_Sink_iter<char>, char>] 208 static
|
||||
/usr/include/c++/14.2.1/format:4039:7:constexpr void std::__format::_Formatting_scanner<_Out, _CharT>::_M_format_arg(std::size_t) [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 272 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:117:2:constexpr auto std::ranges::__access::_Begin::operator()(_Tp&&) const [with _Tp = std::span<char, 18446744073709551615>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:167:2:constexpr auto std::ranges::__access::_End::operator()(_Tp&&) const [with _Tp = std::span<char, 18446744073709551615>&] 32 static
|
||||
/usr/include/c++/14.2.1/format:2920:7:void std::__format::_Iter_sink<_CharT, _OutIter>::_M_overflow() [with _CharT = char; _OutIter = std::__format::_Sink_iter<char>] 400 static
|
||||
/usr/include/c++/14.2.1/format:2812:7:typename std::__format::_Sink<typename _Seq::value_type>::_Reservation std::__format::_Seq_sink<_Seq>::_M_reserve(std::size_t) [with _Seq = std::__cxx11::basic_string<char>] 320 static
|
||||
/usr/include/c++/14.2.1/format:2848:7:void std::__format::_Seq_sink<_Seq>::_M_bump(std::size_t) [with _Seq = std::__cxx11::basic_string<char>] 272 static
|
||||
/usr/include/c++/14.2.1/format:649:5:_Out std::__format::__write(_Out, std::basic_string_view<_CharT>) [with _Out = _Sink_iter<char>; _CharT = char] 256 static
|
||||
/usr/include/c++/14.2.1/format:3886:12:void std::basic_format_context<_Out, _CharT>::advance_to(iterator) [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 160 static
|
||||
/usr/include/c++/14.2.1/format:3877:7:std::basic_format_arg<std::basic_format_context<_Out, _CharT> > std::basic_format_context<_Out, _CharT>::arg(std::size_t) const [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 96 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = __format::_Formatting_scanner<__format::_Sink_iter<char>, char>::_M_format_arg(std::size_t)::<lambda(auto:39&)>] 32 static
|
||||
/usr/include/c++/14.2.1/format:2147:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = bool; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:1859:7:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::formatter<_CharT, _CharT>::parse(std::basic_format_parse_context<_CharT>&) [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:1866:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_CharT, _CharT>::format(_CharT, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2147:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = int; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2147:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = unsigned int; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2147:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = long long int; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2147:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = long long unsigned int; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2168:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = float; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2168:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = double; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2168:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = long double; _CharT = char] 48 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/format:1970:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<const _CharT*, _CharT>::format(const _CharT*, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 192 static
|
||||
/usr/include/c++/14.2.1/format:2068:2:typename std::basic_format_context<_Out, char>::iterator std::formatter<std::basic_string_view<char, _Traits>, char>::format(std::basic_string_view<char, _Traits>, std::basic_format_context<_Out, char>&) const [with _Out = std::__format::_Sink_iter<char>; _Traits = std::char_traits<char>] 176 static
|
||||
/usr/include/c++/14.2.1/format:2324:20:std::formatter<const void*, char>::parse(std::basic_format_parse_context<char>&)::<lambda()> 48 static
|
||||
/usr/include/c++/14.2.1/format:2328:20:std::formatter<const void*, char>::parse(std::basic_format_parse_context<char>&)::<lambda()> 48 static
|
||||
/usr/include/c++/14.2.1/format:2318:7:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::formatter<const void*, _CharT>::parse(std::basic_format_parse_context<_CharT>&) [with _CharT = char] 336 static
|
||||
/usr/include/c++/14.2.1/string_view:132:7:constexpr std::basic_string_view<_CharT, _Traits>::basic_string_view() [with _CharT = char; _Traits = std::char_traits<char>] 32 static
|
||||
/usr/include/c++/14.2.1/format:2383:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<const void*, _CharT>::format(const void*, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 320 static
|
||||
/usr/include/c++/14.2.1/format:2147:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = __int128; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2147:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = __int128 unsigned; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:2168:2:typename std::basic_format_context<_Out, _CharT>::iterator std::formatter<_Tp, _CharT>::format(_Tp, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _Tp = _Float128; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/span:316:7:constexpr std::span<_Type, _Extent>::iterator std::span<_Type, _Extent>::end() const [with _Type = char; long unsigned int _Extent = 18446744073709551615] 208 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_algobase.h:318:7:constexpr std::ranges::copy_result<std::ranges::borrowed_iterator_t<_Range>, _Out> std::ranges::__copy_fn::operator()(_Range&&, _Out) const [with _Range = std::span<char, 18446744073709551615>&; _Out = std::__format::_Sink_iter<char>] 192 static
|
||||
/usr/include/c++/14.2.1/format:2684:7:void std::__format::_Sink<_CharT>::_M_reset(std::span<_Type, 18446744073709551615>, std::size_t) [with _CharT = char] 272 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1118:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize(size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/format:1059:2:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_int<_CharT>::_M_parse(std::basic_format_parse_context<_CharT>&) [with _Tp = bool; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:1159:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::format(bool, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 336 static
|
||||
/usr/include/c++/14.2.1/format:1059:2:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_int<_CharT>::_M_parse(std::basic_format_parse_context<_CharT>&) [with _Tp = char; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:1189:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::_M_format_character(_CharT, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 224 static
|
||||
/usr/include/c++/14.2.1/format:1088:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::format(_Int, std::basic_format_context<_Out, _CharT>&) const [with _Int = unsigned char; _Out = std::__format::_Sink_iter<char>; _CharT = char] 560 static
|
||||
/usr/include/c++/14.2.1/format:1059:2:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_int<_CharT>::_M_parse(std::basic_format_parse_context<_CharT>&) [with _Tp = int; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1088:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::format(_Int, std::basic_format_context<_Out, _CharT>&) const [with _Int = int; _Out = std::__format::_Sink_iter<char>; _CharT = char] 624 static
|
||||
/usr/include/c++/14.2.1/format:1059:2:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_int<_CharT>::_M_parse(std::basic_format_parse_context<_CharT>&) [with _Tp = unsigned int; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1088:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::format(_Int, std::basic_format_context<_Out, _CharT>&) const [with _Int = unsigned int; _Out = std::__format::_Sink_iter<char>; _CharT = char] 624 static
|
||||
/usr/include/c++/14.2.1/format:1059:2:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_int<_CharT>::_M_parse(std::basic_format_parse_context<_CharT>&) [with _Tp = long long int; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1088:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::format(_Int, std::basic_format_context<_Out, _CharT>&) const [with _Int = long long int; _Out = std::__format::_Sink_iter<char>; _CharT = char] 656 static
|
||||
/usr/include/c++/14.2.1/format:1059:2:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_int<_CharT>::_M_parse(std::basic_format_parse_context<_CharT>&) [with _Tp = long long unsigned int; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1088:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::format(_Int, std::basic_format_context<_Out, _CharT>&) const [with _Int = long long unsigned int; _Out = std::__format::_Sink_iter<char>; _CharT = char] 656 static
|
||||
/usr/include/c++/14.2.1/format:1411:20:std::__format::__formatter_fp<char>::parse(std::basic_format_parse_context<char>&)::<lambda()> 48 static
|
||||
/usr/include/c++/14.2.1/format:1415:20:std::__format::__formatter_fp<char>::parse(std::basic_format_parse_context<char>&)::<lambda()> 48 static
|
||||
/usr/include/c++/14.2.1/format:1405:7:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_fp<_CharT>::parse(std::basic_format_parse_context<_CharT>&) [with _CharT = char] 336 static
|
||||
/usr/include/c++/14.2.1/format:1565:22:std::__format::__formatter_fp<char>::format<float, std::__format::_Sink_iter<char> >(float, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, char*)> 80 static
|
||||
/usr/include/c++/14.2.1/format:1608:24:std::__format::__formatter_fp<char>::format<float, std::__format::_Sink_iter<char> >(float, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)> 192 static
|
||||
/usr/include/c++/14.2.1/format:1502:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_fp<_CharT>::format(_Fp, std::basic_format_context<_Out, _CharT>&) const [with _Fp = float; _Out = std::__format::_Sink_iter<char>; _CharT = char] 1312 static
|
||||
/usr/include/c++/14.2.1/format:1565:22:std::__format::__formatter_fp<char>::format<double, std::__format::_Sink_iter<char> >(double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, char*)> 80 static
|
||||
/usr/include/c++/14.2.1/format:1608:24:std::__format::__formatter_fp<char>::format<double, std::__format::_Sink_iter<char> >(double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)> 192 static
|
||||
/usr/include/c++/14.2.1/format:1502:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_fp<_CharT>::format(_Fp, std::basic_format_context<_Out, _CharT>&) const [with _Fp = double; _Out = std::__format::_Sink_iter<char>; _CharT = char] 1344 static
|
||||
/usr/include/c++/14.2.1/format:1565:22:std::__format::__formatter_fp<char>::format<long double, std::__format::_Sink_iter<char> >(long double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, char*)> 96 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/format:1608:24:std::__format::__formatter_fp<char>::format<long double, std::__format::_Sink_iter<char> >(long double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)> 192 static
|
||||
/usr/include/c++/14.2.1/format:1502:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_fp<_CharT>::format(_Fp, std::basic_format_context<_Out, _CharT>&) const [with _Fp = long double; _Out = std::__format::_Sink_iter<char>; _CharT = char] 1344 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/format:897:2:_Out std::__format::__formatter_str<_CharT>::format(std::basic_string_view<_CharT>, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 192 static
|
||||
/usr/include/c++/14.2.1/format:740:5:_Out std::__format::__write_padded_as_spec(std::basic_string_view<typename std::type_identity<_Tp>::type>, std::size_t, std::basic_format_context<_Out, _CharT>&, const _Spec<_CharT>&, _Align) [with _CharT = char; _Out = _Sink_iter<char>] 224 static
|
||||
/usr/include/c++/14.2.1/format:1059:2:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_int<_CharT>::_M_parse(std::basic_format_parse_context<_CharT>&) [with _Tp = __int128; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1088:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::format(_Int, std::basic_format_context<_Out, _CharT>&) const [with _Int = __int128; _Out = std::__format::_Sink_iter<char>; _CharT = char] 768 static
|
||||
/usr/include/c++/14.2.1/format:1059:2:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_int<_CharT>::_M_parse(std::basic_format_parse_context<_CharT>&) [with _Tp = __int128 unsigned; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1088:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::format(_Int, std::basic_format_context<_Out, _CharT>&) const [with _Int = __int128 unsigned; _Out = std::__format::_Sink_iter<char>; _CharT = char] 768 static
|
||||
/usr/include/c++/14.2.1/format:1565:22:std::__format::__formatter_fp<char>::format<_Float128, std::__format::_Sink_iter<char> >(_Float128, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, char*)> 80 static
|
||||
/usr/include/c++/14.2.1/format:1608:24:std::__format::__formatter_fp<char>::format<_Float128, std::__format::_Sink_iter<char> >(_Float128, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)> 192 static
|
||||
/usr/include/c++/14.2.1/format:1502:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_fp<_CharT>::format(_Fp, std::basic_format_context<_Out, _CharT>&) const [with _Fp = _Float128; _Out = std::__format::_Sink_iter<char>; _CharT = char] 1328 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_algobase.h:308:7:constexpr std::ranges::copy_result<_Iter, _Out> std::ranges::__copy_fn::operator()(_Iter, _Sent, _Out) const [with _Iter = __gnu_cxx::__normal_iterator<char*, std::span<char, 18446744073709551615> >; _Sent = __gnu_cxx::__normal_iterator<char*, std::span<char, 18446744073709551615> >; _Out = std::__format::_Sink_iter<char>] 272 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:597:23:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation)::_Terminator::~_Terminator() [with _Operation = std::__format::_Seq_sink<std::__cxx11::basic_string<char> >::_M_reserve(std::size_t)::<lambda(auto:37, auto:38)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/format:2832:10:std::__format::_Seq_sink<std::__cxx11::basic_string<char> >::_M_reserve(std::size_t)::<lambda(auto:37, auto:38)> [with auto:37 = char*; auto:38 = long unsigned int] 160 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:583:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation) [with _Operation = std::__format::_Seq_sink<std::__cxx11::basic_string<char> >::_M_reserve(std::size_t)::<lambda(auto:37, auto:38)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 208 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:1138:7:constexpr __gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = char*; _Container = std::span<char, 18446744073709551615>] 224 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:400:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize(size_type, _CharT) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 64 static
|
||||
/usr/include/c++/14.2.1/format:632:5:char* std::__format::__put_sign(_Int, _Sign, char*) [with _Int = unsigned int] 32 static
|
||||
/usr/include/c++/14.2.1/format:632:5:char* std::__format::__put_sign(_Int, _Sign, char*) [with _Int = int] 32 static
|
||||
/usr/include/c++/14.2.1/format:632:5:char* std::__format::__put_sign(_Int, _Sign, char*) [with _Int = long long int] 48 static
|
||||
/usr/include/c++/14.2.1/format:632:5:char* std::__format::__put_sign(_Int, _Sign, char*) [with _Int = long long unsigned int] 48 static
|
||||
/usr/include/c++/14.2.1/bits/string_view.tcc:185:5:constexpr std::basic_string_view<_CharT, _Traits>::size_type std::basic_string_view<_CharT, _Traits>::find_first_not_of(_CharT, size_type) const [with _CharT = char; _Traits = std::char_traits<char>] 192 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:941:8:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_If_sv<_Tp, std::__cxx11::basic_string<_CharT, _Traits, _Alloc>&> std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::operator=(const _Tp&) [with _Tp = std::basic_string_view<char>; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1498:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::append(size_type, _CharT) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:2032:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::insert(size_type, size_type, _CharT) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 64 static
|
||||
/usr/include/c++/14.2.1/format:632:5:char* std::__format::__put_sign(_Int, _Sign, char*) [with _Int = __int128] 48 static
|
||||
/usr/include/c++/14.2.1/format:632:5:char* std::__format::__put_sign(_Int, _Sign, char*) [with _Int = __int128 unsigned] 48 static
|
||||
/usr/include/c++/14.2.1/format:2700:7:constexpr void std::__format::_Sink<_CharT>::_M_write(std::basic_string_view<_CharT>) [with _CharT = char] 336 static
|
||||
/usr/include/c++/14.2.1/format:958:20:std::__format::__formatter_int<char>::_M_do_parse(std::basic_format_parse_context<char>&, std::__format::_Pres_type)::<lambda()> 48 static
|
||||
/usr/include/c++/14.2.1/format:962:20:std::__format::__formatter_int<char>::_M_do_parse(std::basic_format_parse_context<char>&, std::__format::_Pres_type)::<lambda()> 48 static
|
||||
/usr/include/c++/14.2.1/format:950:7:constexpr typename std::basic_format_parse_context<_CharT>::iterator std::__format::__formatter_int<_CharT>::_M_do_parse(std::basic_format_parse_context<_CharT>&, std::__format::_Pres_type) [with _CharT = char] 352 static
|
||||
/usr/include/c++/14.2.1/format:3881:19:std::locale std::basic_format_context<_Out, _CharT>::locale() [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:828:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::operator=(const _CharT*) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/format:1197:2:static _CharT std::__format::__formatter_int<_CharT>::_S_to_character(_Int) [with _Int = unsigned char; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1301:2:static std::to_chars_result std::__format::__formatter_int<_CharT>::to_chars(char*, char*, _Int, int) [with _Int = unsigned char; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:632:5:char* std::__format::__put_sign(_Int, _Sign, char*) [with _Int = unsigned char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1218:2:typename std::basic_format_context<_Out, _CharT>::iterator std::__format::__formatter_int<_CharT>::_M_format_int(std::string_view, std::size_t, std::basic_format_context<_Out, _CharT>&) const [with _Out = std::__format::_Sink_iter<char>; _CharT = char] 640 dynamic
|
||||
/usr/include/c++/14.2.1/format:1197:2:static _CharT std::__format::__formatter_int<_CharT>::_S_to_character(_Int) [with _Int = int; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1301:2:static std::to_chars_result std::__format::__formatter_int<_CharT>::to_chars(char*, char*, _Int, int) [with _Int = unsigned int; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:1197:2:static _CharT std::__format::__formatter_int<_CharT>::_S_to_character(_Int) [with _Int = unsigned int; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1197:2:static _CharT std::__format::__formatter_int<_CharT>::_S_to_character(_Int) [with _Int = long long int; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1301:2:static std::to_chars_result std::__format::__formatter_int<_CharT>::to_chars(char*, char*, _Int, int) [with _Int = long long unsigned int; _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:1197:2:static _CharT std::__format::__formatter_int<_CharT>::_S_to_character(_Int) [with _Int = long long unsigned int; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:486:7:constexpr std::__format::_Spec<_CharT>::iterator std::__format::_Spec<_CharT>::_M_parse_sign(iterator, iterator) [with _CharT = char] 80 static
|
||||
/usr/include/c++/14.2.1/format:498:7:constexpr std::__format::_Spec<_CharT>::iterator std::__format::_Spec<_CharT>::_M_parse_alternate_form(iterator, iterator) [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:510:7:constexpr std::__format::_Spec<_CharT>::iterator std::__format::_Spec<_CharT>::_M_parse_zero_fill(iterator, iterator) [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:595:7:constexpr std::__format::_Spec<_CharT>::iterator std::__format::_Spec<_CharT>::_M_parse_locale(iterator, iterator) [with _CharT = char] 48 static
|
||||
/usr/include/c++/14.2.1/format:619:2:std::size_t std::__format::_Spec<_CharT>::_M_get_precision(_Context&) const [with _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>; _CharT = char] 208 static
|
||||
/usr/include/c++/14.2.1/format:1825:21:std::__format::__formatter_fp<char>::_M_localize(std::basic_string_view<char>, char, const std::locale&) const::<lambda(char*, std::size_t)> 112 static
|
||||
/usr/include/c++/14.2.1/format:1777:7:std::__cxx11::basic_string<_CharT> std::__format::__formatter_fp<_CharT>::_M_localize(std::basic_string_view<_CharT>, char, const std::locale&) const [with _CharT = char] 656 static
|
||||
/usr/include/c++/14.2.1/format:607:2:std::size_t std::__format::_Spec<_CharT>::_M_get_width(_Context&) const [with _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>; _CharT = char] 208 static
|
||||
/usr/include/c++/14.2.1/string_view:295:7:constexpr void std::basic_string_view<_CharT, _Traits>::remove_prefix(size_type) [with _CharT = char; _Traits = std::char_traits<char>] 48 static
|
||||
/usr/include/c++/14.2.1/format:674:20:std::__format::__write_padded<_Sink_iter<char>, char>(_Sink_iter<char>, std::basic_string_view<char>, _Align, std::size_t, char32_t)::<lambda(std::size_t, std::__format::_Sink_iter<char>&)> 240 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:117:2:constexpr auto std::ranges::__access::_Begin::operator()(_Tp&&) const [with _Tp = const char32_t (&)[1]] 16 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:167:2:constexpr auto std::ranges::__access::_End::operator()(_Tp&&) const [with _Tp = const char32_t (&)[1]] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:570:7:constexpr std::__unicode::_Utf_view<_ToFormat, _Range>::_Utf_view(_Range&&) [with _ToFormat = char; _Range = const char32_t (&)[1]] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = const char32_t (&)[1]] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:546:2:constexpr auto std::__unicode::_Utf_view<_ToFormat, _Range>::_M_begin(_Iter, _Sent) [with _Iter = const char32_t*; _Sent = const char32_t*; _ToFormat = char; _Range = const char32_t (&)[1]] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:572:22:constexpr auto std::__unicode::_Utf_view<_ToFormat, _Range>::begin() [with _ToFormat = char; _Range = const char32_t (&)[1]] 64 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:556:2:constexpr auto std::__unicode::_Utf_view<_ToFormat, _Range>::_M_end(_Iter, _Sent) [with _Iter = const char32_t*; _Sent = const char32_t*; _ToFormat = char; _Range = const char32_t (&)[1]] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:575:22:constexpr auto std::__unicode::_Utf_view<_ToFormat, _Range>::end() [with _ToFormat = char; _Range = const char32_t (&)[1]] 64 static
|
||||
/usr/include/c++/14.2.1/format:666:5:_Out std::__format::__write_padded(_Out, std::basic_string_view<_CharT>, _Align, std::size_t, char32_t) [with _Out = _Sink_iter<char>; _CharT = char] 944 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/string_view:247:7:constexpr bool std::basic_string_view<_CharT, _Traits>::empty() const [with _CharT = char; _Traits = std::char_traits<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:117:2:constexpr auto std::ranges::__access::_Begin::operator()(_Tp&&) const [with _Tp = std::basic_string_view<char>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_base.h:167:2:constexpr auto std::ranges::__access::_End::operator()(_Tp&&) const [with _Tp = std::basic_string_view<char>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:546:2:constexpr auto std::__unicode::_Utf_view<_ToFormat, _Range>::_M_begin(_Iter, _Sent) [with _Iter = const char*; _Sent = const char*; _ToFormat = char32_t; _Range = std::basic_string_view<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:572:22:constexpr auto std::__unicode::_Utf_view<_ToFormat, _Range>::begin() [with _ToFormat = char32_t; _Range = std::basic_string_view<char>] 64 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:734:22:constexpr auto std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::begin() const [with _View = std::basic_string_view<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:824:17:constexpr auto std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::_Iterator::end() const [with _View = std::basic_string_view<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:735:22:constexpr auto std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::end() const [with _View = std::basic_string_view<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:828:2:constexpr int std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::_Iterator::width() const [with _View = std::basic_string_view<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:821:17:constexpr auto std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::_Iterator::base() const [with _View = std::basic_string_view<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:968:5:constexpr std::size_t std::__unicode::__truncate(std::basic_string_view<_CharT>&, std::size_t) [with _CharT = char] 448 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:951:5:constexpr std::size_t std::__unicode::__field_width(std::basic_string_view<_CharT>) [with _CharT = char] 416 static
|
||||
/usr/include/c++/14.2.1/format:1197:2:static _CharT std::__format::__formatter_int<_CharT>::_S_to_character(_Int) [with _Int = __int128; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:1301:2:static std::to_chars_result std::__format::__formatter_int<_CharT>::to_chars(char*, char*, _Int, int) [with _Int = __int128 unsigned; _CharT = char] 64 static
|
||||
/usr/include/c++/14.2.1/format:1197:2:static _CharT std::__format::__formatter_int<_CharT>::_S_to_character(_Int) [with _Int = __int128 unsigned; _CharT = char] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __gnu_cxx::__normal_iterator<char*, span<char, 18446744073709551615> >&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_algobase.h:220:5:constexpr std::__conditional_t<_IsMove, std::ranges::in_out_result<_Iter, _Out>, std::ranges::in_out_result<_Iter, _Out> > std::ranges::__copy_or_move(_Iter, _Sent, _Out) [with bool _IsMove = false; _Iter = __gnu_cxx::__normal_iterator<char*, std::span<char, 18446744073709551615> >; _Sent = __gnu_cxx::__normal_iterator<char*, std::span<char, 18446744073709551615> >; _Out = std::__format::_Sink_iter<char>] 336 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __format::_Seq_sink<__cxx11::basic_string<char> >::_M_reserve(std::size_t)::<lambda(auto:37, auto:38)>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:3772:5:constexpr bool std::operator==(const __cxx11::basic_string<_CharT, _Traits, _Allocator>&, const _CharT*) [with _CharT = char; _Traits = char_traits<char>; _Alloc = allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1787:2:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_If_sv<_Tp, std::__cxx11::basic_string<_CharT, _Traits, _Alloc>&> std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::assign(const _Tp&) [with _Tp = std::basic_string_view<char>; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 176 static
|
||||
/usr/include/c++/14.2.1/charconv:319:5:constexpr std::to_chars_result std::__to_chars_i(char*, char*, _Tp, int) [with _Tp = __int128 unsigned] 96 static
|
||||
/usr/include/c++/14.2.1/string_view:321:7:constexpr std::basic_string_view<_CharT, _Traits>::size_type std::basic_string_view<_CharT, _Traits>::copy(_CharT*, size_type, size_type) const [with _CharT = char; _Traits = std::char_traits<char>] 240 static
|
||||
/usr/include/c++/14.2.1/bits/locale_facets.tcc:1290:5:_CharT* std::__add_grouping(_CharT*, _CharT, const char*, size_t, const _CharT*, const _CharT*) [with _CharT = char] 112 static
|
||||
/usr/include/c++/14.2.1/format:473:7:static constexpr std::__format::_Sign std::__format::_Spec<_CharT>::_S_sign(_CharT) [with _CharT = char] 16 static
|
||||
/usr/include/c++/14.2.1/format:3502:2:decltype(auto) std::basic_format_arg<_Context>::_M_visit(_Visitor&&, std::__format::_Arg_t) [with _Visitor = std::__format::_WidthPrecVisitor; _Context = std::basic_format_context<std::__format::_Sink_iter<char>, char>] 80 static
|
||||
/usr/include/c++/14.2.1/format:3568:5:decltype(auto) std::visit_format_arg(_Visitor&&, basic_format_arg<_Context>) [with _Visitor = __format::_WidthPrecVisitor; _Context = basic_format_context<__format::_Sink_iter<char>, char>] 208 static
|
||||
/usr/include/c++/14.2.1/format:3604:5:std::size_t std::__format::__int_from_arg(const std::basic_format_arg<_Context>&) [with _Context = std::basic_format_context<_Sink_iter<char>, char>] 192 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:597:23:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation)::_Terminator::~_Terminator() [with _Operation = std::__format::__formatter_fp<char>::format<float, std::__format::_Sink_iter<char> >(float, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:583:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation) [with _Operation = std::__format::__formatter_fp<char>::format<float, std::__format::_Sink_iter<char> >(float, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 208 static
|
||||
/usr/include/c++/14.2.1/format:2692:7:constexpr void std::__format::_Sink<_CharT>::_M_write(_CharT) [with _CharT = char] 240 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:61:5:constexpr bool std::__unicode::__is_single_code_unit(char32_t) [with _CharT = char] 16 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:480:7:constexpr _Iter& std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_M_curr() [with _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:108:7:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_Utf_iterator(_Iter, _Iter, _Sent) requires bidirectional_iterator<_Iter> [with _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 64 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:765:9:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::basic_string(_InputIterator, _InputIterator, const _Alloc&) [with _InputIterator = std::__unicode::_Utf_iterator<char32_t, char, const char32_t*, const char32_t*, std::__unicode::_Repl>; <template-parameter-2-2> = void; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 384 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:597:23:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation)::_Terminator::~_Terminator() [with _Operation = std::__format::__formatter_fp<char>::format<double, std::__format::_Sink_iter<char> >(double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:583:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation) [with _Operation = std::__format::__formatter_fp<char>::format<double, std::__format::_Sink_iter<char> >(double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 208 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:597:23:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation)::_Terminator::~_Terminator() [with _Operation = std::__format::__formatter_fp<char>::format<long double, std::__format::_Sink_iter<char> >(long double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:583:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation) [with _Operation = std::__format::__formatter_fp<char>::format<long double, std::__format::_Sink_iter<char> >(long double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 208 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = basic_string_view<char>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:570:7:constexpr std::__unicode::_Utf_view<_ToFormat, _Range>::_Utf_view(_Range&&) [with _ToFormat = char32_t; _Range = std::basic_string_view<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = basic_string_view<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:730:7:constexpr std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::_Grapheme_cluster_view(_View) [with _View = std::basic_string_view<char>] 368 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:146:7:constexpr _Sent std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::end() const [with _FromFmt = char; _ToFmt = char32_t; _Iter = const char*; _Sent = const char*; _ErrorHandler = std::__unicode::_Repl] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:776:2:constexpr std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::_Iterator& std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::_Iterator::operator++() [with _View = std::basic_string_view<char>] 320 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:817:2:constexpr bool std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::_Iterator::operator==(std::ranges::sentinel_t<_Range>&) const [with _View = std::basic_string_view<char>] 96 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:597:23:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation)::_Terminator::~_Terminator() [with _Operation = std::__format::__formatter_fp<char>::format<_Float128, std::__format::_Sink_iter<char> >(_Float128, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:583:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation) [with _Operation = std::__format::__formatter_fp<char>::format<_Float128, std::__format::_Sink_iter<char> >(_Float128, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 208 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = char*&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/ranges_algobase.h:220:5:constexpr std::__conditional_t<_IsMove, std::ranges::in_out_result<_Iter, _Out>, std::ranges::in_out_result<_Iter, _Out> > std::ranges::__copy_or_move(_Iter, _Sent, _Out) [with bool _IsMove = false; _Iter = char*; _Sent = char*; _Out = std::__format::_Sink_iter<char>] 272 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:71:5:constexpr _Tp&& std::forward(typename remove_reference<_Functor>::type&) [with _Tp = __format::_WidthPrecVisitor] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = std::monostate] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = bool] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = int] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = unsigned int] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = long long int] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = long long unsigned int] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = float] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = double] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = long double] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = const void*] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = __int128] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = __int128 unsigned] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = _Float128] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.h:1675:7:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>& std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::assign(const _CharT*, size_type) [with _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/charconv:115:5:constexpr unsigned int std::__detail::__to_chars_len_2(_Tp) [with _Tp = __int128 unsigned] 32 static
|
||||
/usr/include/c++/14.2.1/charconv:161:5:constexpr std::to_chars_result std::__detail::__to_chars_16(char*, char*, _Tp) [with _Tp = __int128 unsigned] 448 static
|
||||
/usr/include/c++/14.2.1/bits/charconv.h:55:5:constexpr unsigned int std::__detail::__to_chars_len(_Tp, int) [with _Tp = __int128 unsigned] 256 static
|
||||
/usr/include/c++/14.2.1/charconv:207:5:constexpr std::to_chars_result std::__detail::__to_chars_10(char*, char*, _Tp) [with _Tp = __int128 unsigned] 208 static
|
||||
/usr/include/c++/14.2.1/charconv:230:5:constexpr std::to_chars_result std::__detail::__to_chars_8(char*, char*, _Tp) [with _Tp = __int128 unsigned] 272 static
|
||||
/usr/include/c++/14.2.1/charconv:283:5:constexpr std::to_chars_result std::__detail::__to_chars_2(char*, char*, _Tp) [with _Tp = __int128 unsigned] 224 static
|
||||
/usr/include/c++/14.2.1/charconv:121:5:constexpr std::to_chars_result std::__detail::__to_chars(char*, char*, _Tp, int) [with _Tp = __int128 unsigned] 576 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = char] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = const char*] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = std::basic_string_view<char>] 32 static
|
||||
/usr/include/c++/14.2.1/format:3580:7:std::size_t std::__format::_WidthPrecVisitor::operator()(_Tp&) const [with _Tp = std::basic_format_arg<std::basic_format_context<std::__format::_Sink_iter<char>, char> >::handle] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __format::__formatter_fp<char>::format<float, std::__format::_Sink_iter<char> >(float, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, size_t)>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:597:23:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation)::_Terminator::~_Terminator() [with _Operation = std::__format::__formatter_fp<char>::_M_localize(std::basic_string_view<char>, char, const std::locale&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:583:5:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::resize_and_overwrite(size_type, _Operation) [with _Operation = std::__format::__formatter_fp<char>::_M_localize(std::basic_string_view<char>, char, const std::locale&) const::<lambda(char*, std::size_t)>&; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 208 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:1108:7:constexpr __gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator++(int) [with _Iterator = char*; _Container = std::span<char, 18446744073709551615>] 224 static
|
||||
/usr/include/c++/14.2.1/bits/stl_iterator.h:1090:7:constexpr __gnu_cxx::__normal_iterator<_Iterator, _Container>::reference __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator*() const [with _Iterator = char*; _Container = std::span<char, 18446744073709551615>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:509:4:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_First_and_curr<_It>::_First_and_curr(_It, _It) [with _It = const char32_t*; _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:231:7:constexpr void std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_M_read() [with _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:188:13:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_construct(_InIterator, _InIterator, std::input_iterator_tag)::_Guard::_Guard(std::__cxx11::basic_string<_CharT, _Traits, _Alloc>*) [with _InIterator = std::__unicode::_Utf_iterator<char32_t, char, const char32_t*, const char32_t*, std::__unicode::_Repl>; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 32 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:191:4:constexpr std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_construct(_InIterator, _InIterator, std::input_iterator_tag)::_Guard::~_Guard() [with _InIterator = std::__unicode::_Utf_iterator<char32_t, char, const char32_t*, const char32_t*, std::__unicode::_Repl>; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 48 static
|
||||
/usr/include/c++/14.2.1/bits/basic_string.tcc:170:7:constexpr void std::__cxx11::basic_string<_CharT, _Traits, _Alloc>::_M_construct(_InIterator, _InIterator, std::input_iterator_tag) [with _InIterator = std::__unicode::_Utf_iterator<char32_t, char, const char32_t*, const char32_t*, std::__unicode::_Repl>; _CharT = char; _Traits = std::char_traits<char>; _Alloc = std::allocator<char>] 512 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __format::__formatter_fp<char>::format<double, std::__format::_Sink_iter<char> >(double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, size_t)>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __format::__formatter_fp<char>::format<long double, std::__format::_Sink_iter<char> >(long double, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, size_t)>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:654:10:constexpr std::__unicode::__v15_1_0::_Grapheme_cluster_iterator_base::_Grapheme_cluster_iterator_base() 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:755:2:constexpr std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::_Iterator::_Iterator(_U32_iterator) [with _View = std::basic_string_view<char>] 288 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:220:7:constexpr bool std::__unicode::operator==(_Utf_iterator<char, char32_t, const char*, const char*, _Repl>, const char*) 224 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:840:2:constexpr bool std::__unicode::__v15_1_0::_Grapheme_cluster_view<_View>::_Iterator::_M_is_break(std::__unicode::__v15_1_0::_Gcb_property, std::__unicode::__v15_1_0::_Gcb_property, _U32_iterator) const [with _View = std::basic_string_view<char>] 416 dynamic,bounded
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __format::__formatter_fp<char>::format<_Float128, std::__format::_Sink_iter<char> >(_Float128, std::basic_format_context<std::__format::_Sink_iter<char>, char>&) const::<lambda(char*, size_t)>&] 32 static
|
||||
/usr/include/c++/14.2.1/bit:371:5:constexpr int std::__bit_width(_Tp) [with _Tp = __int128 unsigned] 64 static
|
||||
/usr/include/c++/14.2.1/bits/charconv.h:81:5:constexpr void std::__detail::__to_chars_10_impl(char*, unsigned int, _Tp) [with _Tp = __int128 unsigned] 640 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = __format::__formatter_fp<char>::_M_localize(std::basic_string_view<char>, char, const std::locale&) const::<lambda(char*, size_t)>&] 32 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:392:7:constexpr void std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_M_read_utf32() [with _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 208 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:202:7:constexpr bool std::__unicode::operator==(_Utf_iterator<char32_t, char, const char32_t*, const char32_t*, _Repl>, _Utf_iterator<char32_t, char, const char32_t*, const char32_t*, _Repl>) requires (forward_iterator<_Iter>) || requires(_Iter __i) {__i != __i;} 304 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:155:7:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::value_type std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::operator*() const [with _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:158:7:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>& std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::operator++() [with _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 80 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:202:7:constexpr bool std::__unicode::operator==(_Utf_iterator<char, char32_t, const char*, const char*, _Repl>, _Utf_iterator<char, char32_t, const char*, const char*, _Repl>) requires (forward_iterator<_Iter>) || requires(_Iter __i) {__i != __i;} 304 static
|
||||
/usr/include/c++/14.2.1/bit:201:5:constexpr int std::__countl_zero(_Tp) [with _Tp = __int128 unsigned] 96 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:256:14:constexpr std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_Guard<_It>::~_Guard() [with _It = const char32_t*; _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 48 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:468:7:constexpr char32_t std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_S_error() [with _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 176 static
|
||||
/usr/include/c++/14.2.1/bits/unicode.h:403:7:constexpr void std::__unicode::_Utf_iterator<_FromFmt, _ToFmt, _Iter, _Sent, _ErrorHandler>::_M_update(char32_t, uint8_t) [with _FromFmt = char32_t; _ToFmt = char; _Iter = const char32_t*; _Sent = const char32_t*; _ErrorHandler = std::__unicode::_Repl] 64 static
|
||||
/usr/include/c++/14.2.1/array:214:7:constexpr const std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) const [with _Tp = char; long unsigned int _Nm = 4] 32 static
|
||||
/usr/include/c++/14.2.1/bits/move.h:137:5:constexpr typename std::remove_reference<_Tp>::type&& std::move(_Tp&&) [with _Tp = const char32_t*&] 32 static
|
||||
/usr/include/c++/14.2.1/bit:459:5:constexpr int std::bit_width(_Tp) [with _Tp = unsigned int] 32 static
|
||||
/usr/include/c++/14.2.1/array:206:7:constexpr std::array<_Tp, _Nm>::value_type& std::array<_Tp, _Nm>::operator[](size_type) [with _Tp = char; long unsigned int _Nm = 4] 48 static
|
||||
c.cc:110:1:_sub_D_00099_0 16 static
|
||||
c.cc:110:1:_sub_I_00099_1 16 static
|
||||
17
codeforces/859/c.in
Normal file
17
codeforces/859/c.in
Normal file
|
|
@ -0,0 +1,17 @@
|
|||
8
|
||||
7
|
||||
abacaba
|
||||
2
|
||||
aa
|
||||
1
|
||||
y
|
||||
4
|
||||
bkpt
|
||||
6
|
||||
ninfia
|
||||
6
|
||||
banana
|
||||
10
|
||||
codeforces
|
||||
8
|
||||
testcase
|
||||
22
codeforces/859/compile_flags.txt
Normal file
22
codeforces/859/compile_flags.txt
Normal file
|
|
@ -0,0 +1,22 @@
|
|||
-Wall
|
||||
-Wextra
|
||||
-Wshadow
|
||||
-Wnon-virtual-dtor
|
||||
-Wold-style-cast
|
||||
-Wcast-align
|
||||
-Wunused
|
||||
-Woverloaded-virtual
|
||||
-Wpedantic
|
||||
-Wmisleading-indentation
|
||||
-Wduplicated-cond
|
||||
-Wduplicated-branches
|
||||
-Wlogical-op
|
||||
-Wnull-dereference
|
||||
-Wuseless-cast
|
||||
-Wformat=2
|
||||
-Wformat-overflow
|
||||
-Wformat-truncation
|
||||
-Wdouble-promotion
|
||||
-Wundef
|
||||
-DLOCAL
|
||||
-std=c++23
|
||||
116
codeforces/859/d.cc
Normal file
116
codeforces/859/d.cc
Normal file
|
|
@ -0,0 +1,116 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n, q;
|
||||
cin >> n >> q;
|
||||
ve<ll> a(sc<int>(n));
|
||||
ve<ll> prefix(n + 1, 0);
|
||||
ll total = 0;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
cin >> a[i];
|
||||
total += a[i];
|
||||
prefix[i + 1] = prefix[i] + a[i];
|
||||
}
|
||||
for (int i = 0; i < q; ++i) {
|
||||
ll l, r, k;
|
||||
cin >> l >> r >> k;
|
||||
|
||||
ll new_sum = total - (prefix[r] - prefix[l - 1]) + k * (r - l + 1);
|
||||
if (new_sum & 1) {
|
||||
YES();
|
||||
} else {
|
||||
NO();
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
15
codeforces/859/d.in
Normal file
15
codeforces/859/d.in
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
2
|
||||
5 5
|
||||
2 2 1 3 2
|
||||
2 3 3
|
||||
2 3 4
|
||||
1 5 5
|
||||
1 4 9
|
||||
2 4 3
|
||||
10 5
|
||||
1 1 1 1 1 1 1 1 1 1
|
||||
3 8 13
|
||||
2 5 10
|
||||
3 8 10
|
||||
1 10 2
|
||||
1 9 100
|
||||
118
codeforces/859/e.cc
Normal file
118
codeforces/859/e.cc
Normal file
|
|
@ -0,0 +1,118 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
ve<ll> a(n);
|
||||
ve<ll> prefix(n + 1, 0);
|
||||
for (int i = 0; i < n; ++i) {
|
||||
cin >> a[i];
|
||||
prefix[i + 1] = prefix[i] + a[i];
|
||||
}
|
||||
|
||||
int l = 0, r = n - 1;
|
||||
while (l <= r) {
|
||||
int m = l + (r - l) / 2;
|
||||
ll weight = prefix[m + 1] - prefix[l];
|
||||
cout << "? " << m - l + 1 << '\n';
|
||||
for (int x = l; x <= m; ++x)
|
||||
cout << ' ' << x + 1;
|
||||
ll x;
|
||||
cin >> x;
|
||||
if (weight == x) {
|
||||
l = m + 1;
|
||||
} else {
|
||||
r = m - 1;
|
||||
}
|
||||
}
|
||||
|
||||
cout << "! " << l + 1 << '\n';
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
16
codeforces/859/e.in
Normal file
16
codeforces/859/e.in
Normal file
|
|
@ -0,0 +1,16 @@
|
|||
2
|
||||
5
|
||||
1 2 3 4 5
|
||||
|
||||
11
|
||||
|
||||
6
|
||||
|
||||
3
|
||||
|
||||
7
|
||||
1 2 3 5 3 4 2
|
||||
|
||||
12
|
||||
|
||||
6
|
||||
263
codeforces/859/f.cc
Normal file
263
codeforces/859/f.cc
Normal file
|
|
@ -0,0 +1,263 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto &&x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto &&x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
#include <ext/pb_ds/assoc_container.hpp>
|
||||
#include <ext/pb_ds/tree_policy.hpp>
|
||||
|
||||
using namespace __gnu_pbds;
|
||||
|
||||
// https://mirror.codeforces.com/blog/entry/124683
|
||||
|
||||
namespace hashing {
|
||||
using i64 = std::int64_t;
|
||||
using u64 = std::uint64_t;
|
||||
static const u64 FIXED_RANDOM =
|
||||
std::chrono::steady_clock::now().time_since_epoch().count();
|
||||
|
||||
#if USE_AES
|
||||
std::mt19937 rd(FIXED_RANDOM);
|
||||
const __m128i KEY1{(i64)rd(), (i64)rd()};
|
||||
const __m128i KEY2{(i64)rd(), (i64)rd()};
|
||||
#endif
|
||||
|
||||
template <class T, class D = void>
|
||||
struct custom_hash {};
|
||||
|
||||
template <class T>
|
||||
inline void hash_combine(u64 &seed, T const &v) {
|
||||
custom_hash<T> hasher;
|
||||
seed ^= hasher(v) + 0x9e3779b97f4a7c15 + (seed << 12) + (seed >> 4);
|
||||
};
|
||||
|
||||
template <class T>
|
||||
struct custom_hash<T,
|
||||
typename std::enable_if<std::is_integral<T>::value>::type> {
|
||||
u64 operator()(T _x) const {
|
||||
u64 x = _x;
|
||||
#if USE_AES
|
||||
__m128i m{i64(u64(x) * 0xbf58476d1ce4e5b9u64), (i64)FIXED_RANDOM};
|
||||
__m128i y = _mm_aesenc_si128(m, KEY1);
|
||||
__m128i z = _mm_aesenc_si128(y, KEY2);
|
||||
return z[0];
|
||||
#else
|
||||
x += 0x9e3779b97f4a7c15 + FIXED_RANDOM;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
#endif
|
||||
}
|
||||
};
|
||||
|
||||
template <class T>
|
||||
struct custom_hash<T, std::void_t<decltype(std::begin(std::declval<T>()))>> {
|
||||
u64 operator()(T const &a) const {
|
||||
u64 value = FIXED_RANDOM;
|
||||
for (auto &x : a)
|
||||
hash_combine(value, x);
|
||||
return value;
|
||||
}
|
||||
};
|
||||
|
||||
template <class... T>
|
||||
struct custom_hash<std::tuple<T...>> {
|
||||
u64 operator()(const std::tuple<T...> &a) const {
|
||||
u64 value = FIXED_RANDOM;
|
||||
std::apply(
|
||||
[&value](T const &...args) {
|
||||
(hash_combine(value, args), ...);
|
||||
},
|
||||
a);
|
||||
return value;
|
||||
}
|
||||
};
|
||||
|
||||
template <class T, class U>
|
||||
struct custom_hash<std::pair<T, U>> {
|
||||
u64 operator()(std::pair<T, U> const &a) const {
|
||||
u64 value = FIXED_RANDOM;
|
||||
hash_combine(value, a.first);
|
||||
hash_combine(value, a.second);
|
||||
return value;
|
||||
}
|
||||
};
|
||||
}; // namespace hashing
|
||||
|
||||
#ifdef PB_DS_ASSOC_CNTNR_HPP
|
||||
template <class Key, class Value = null_type>
|
||||
using hashtable = gp_hash_table<
|
||||
Key, Value, hashing::custom_hash<Key>, std::equal_to<Key>,
|
||||
direct_mask_range_hashing<>, linear_probe_fn<>,
|
||||
hash_standard_resize_policy<hash_exponential_size_policy<>,
|
||||
hash_load_check_resize_trigger<>, true>>;
|
||||
|
||||
#endif
|
||||
#ifdef PB_DS_TREE_POLICY_HPP
|
||||
template <typename T>
|
||||
using multitree = tree<T, null_type, std::less_equal<T>, rb_tree_tag,
|
||||
tree_order_statistics_node_update>;
|
||||
template <class Key, class Value = null_type>
|
||||
using rbtree = tree<Key, Value, std::less<Key>, rb_tree_tag,
|
||||
tree_order_statistics_node_update>;
|
||||
#endif
|
||||
|
||||
unordered_map<string, pa<int, int>> DIR;
|
||||
|
||||
void solve() {
|
||||
// NOTE: locked out, stopped thikning. missed key idea that b/c there
|
||||
// are 2 * n * m states, you can manually walk the simulation
|
||||
// extra step for simplicity
|
||||
// continue making conclusions after key insight found
|
||||
int n, m, sr, sc, er, ec;
|
||||
string d;
|
||||
cin >> n >> m >> sr >> sc >> er >> ec >> d;
|
||||
|
||||
auto [dr, dc] = DIR[d];
|
||||
set<tuple<int, int, int, int>> seen;
|
||||
ll ans = 0;
|
||||
|
||||
while (true) {
|
||||
if (sr == er && sc == ec) {
|
||||
prln("{}", ans);
|
||||
return;
|
||||
}
|
||||
|
||||
auto state = make_tuple(sr, sc, dr, dc);
|
||||
if (seen.count(state)) {
|
||||
prln("-1");
|
||||
return;
|
||||
}
|
||||
seen.insert(state);
|
||||
|
||||
int steps = MAX<int>();
|
||||
if (dr > 0)
|
||||
steps = min(steps, n - sr);
|
||||
else if (dr < 0)
|
||||
steps = min(steps, sr - 1);
|
||||
if (dc > 0)
|
||||
steps = min(steps, m - sc);
|
||||
else if (dc < 0)
|
||||
steps = min(steps, sc - 1);
|
||||
|
||||
int dt_r = er - sr;
|
||||
int dt_c = ec - sc;
|
||||
if (dt_r * dc == dt_c * dr) {
|
||||
int k_r = (dr != 0) ? (dt_r / dr) : MAX<int>();
|
||||
int k_c = (dc != 0) ? (dt_c / dc) : MAX<int>();
|
||||
if (k_r == k_c && k_r >= 0 && k_r <= steps) {
|
||||
ans += k_r;
|
||||
prln("{}", ans);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
ans += steps;
|
||||
sr += dr * steps;
|
||||
sc += dc * steps;
|
||||
|
||||
bool is_corner = (sr == 1 || sr == n) && (sc == 1 || sc == m);
|
||||
if (is_corner) {
|
||||
dr *= -1;
|
||||
dc *= -1;
|
||||
} else {
|
||||
if (sr == 1 || sr == n)
|
||||
dr *= -1;
|
||||
if (sc == 1 || sc == m)
|
||||
dc *= -1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
DIR["DR"] = {1, 1};
|
||||
DIR["DL"] = {1, -1};
|
||||
DIR["UR"] = {-1, 1};
|
||||
DIR["UL"] = {-1, -1};
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
7
codeforces/859/f.in
Normal file
7
codeforces/859/f.in
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
6
|
||||
5 7 1 7 2 4 DL
|
||||
5 7 1 7 3 2 DL
|
||||
3 3 1 3 2 2 UR
|
||||
2 4 2 1 2 2 DR
|
||||
4 3 1 1 1 3 UL
|
||||
6 4 1 2 3 4 DR
|
||||
252
codeforces/859/g.cc
Normal file
252
codeforces/859/g.cc
Normal file
|
|
@ -0,0 +1,252 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto &&x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto &&x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
#include <ext/pb_ds/assoc_container.hpp>
|
||||
#include <ext/pb_ds/tree_policy.hpp>
|
||||
|
||||
using namespace __gnu_pbds;
|
||||
|
||||
// https://mirror.codeforces.com/blog/entry/124683
|
||||
|
||||
namespace hashing {
|
||||
using i64 = std::int64_t;
|
||||
using u64 = std::uint64_t;
|
||||
static const u64 FIXED_RANDOM =
|
||||
std::chrono::steady_clock::now().time_since_epoch().count();
|
||||
|
||||
#if USE_AES
|
||||
std::mt19937 rd(FIXED_RANDOM);
|
||||
const __m128i KEY1{(i64)rd(), (i64)rd()};
|
||||
const __m128i KEY2{(i64)rd(), (i64)rd()};
|
||||
#endif
|
||||
|
||||
template <class T, class D = void>
|
||||
struct custom_hash {};
|
||||
|
||||
template <class T>
|
||||
inline void hash_combine(u64 &seed, T const &v) {
|
||||
custom_hash<T> hasher;
|
||||
seed ^= hasher(v) + 0x9e3779b97f4a7c15 + (seed << 12) + (seed >> 4);
|
||||
};
|
||||
|
||||
template <class T>
|
||||
struct custom_hash<T,
|
||||
typename std::enable_if<std::is_integral<T>::value>::type> {
|
||||
u64 operator()(T _x) const {
|
||||
u64 x = _x;
|
||||
#if USE_AES
|
||||
__m128i m{i64(u64(x) * 0xbf58476d1ce4e5b9u64), (i64)FIXED_RANDOM};
|
||||
__m128i y = _mm_aesenc_si128(m, KEY1);
|
||||
__m128i z = _mm_aesenc_si128(y, KEY2);
|
||||
return z[0];
|
||||
#else
|
||||
x += 0x9e3779b97f4a7c15 + FIXED_RANDOM;
|
||||
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
|
||||
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
|
||||
return x ^ (x >> 31);
|
||||
#endif
|
||||
}
|
||||
};
|
||||
|
||||
template <class T>
|
||||
struct custom_hash<T, std::void_t<decltype(std::begin(std::declval<T>()))>> {
|
||||
u64 operator()(T const &a) const {
|
||||
u64 value = FIXED_RANDOM;
|
||||
for (auto &x : a)
|
||||
hash_combine(value, x);
|
||||
return value;
|
||||
}
|
||||
};
|
||||
|
||||
template <class... T>
|
||||
struct custom_hash<std::tuple<T...>> {
|
||||
u64 operator()(const std::tuple<T...> &a) const {
|
||||
u64 value = FIXED_RANDOM;
|
||||
std::apply(
|
||||
[&value](T const &...args) {
|
||||
(hash_combine(value, args), ...);
|
||||
},
|
||||
a);
|
||||
return value;
|
||||
}
|
||||
};
|
||||
|
||||
template <class T, class U>
|
||||
struct custom_hash<std::pair<T, U>> {
|
||||
u64 operator()(std::pair<T, U> const &a) const {
|
||||
u64 value = FIXED_RANDOM;
|
||||
hash_combine(value, a.first);
|
||||
hash_combine(value, a.second);
|
||||
return value;
|
||||
}
|
||||
};
|
||||
}; // namespace hashing
|
||||
|
||||
#ifdef PB_DS_ASSOC_CNTNR_HPP
|
||||
template <class Key, class Value = null_type>
|
||||
using hashtable = gp_hash_table<
|
||||
Key, Value, hashing::custom_hash<Key>, std::equal_to<Key>,
|
||||
direct_mask_range_hashing<>, linear_probe_fn<>,
|
||||
hash_standard_resize_policy<hash_exponential_size_policy<>,
|
||||
hash_load_check_resize_trigger<>, true>>;
|
||||
|
||||
#endif
|
||||
#ifdef PB_DS_TREE_POLICY_HPP
|
||||
template <typename T>
|
||||
using multitree = tree<T, null_type, std::less_equal<T>, rb_tree_tag,
|
||||
tree_order_statistics_node_update>;
|
||||
template <class Key, class Value = null_type>
|
||||
using rbtree = tree<Key, Value, std::less<Key>, rb_tree_tag,
|
||||
tree_order_statistics_node_update>;
|
||||
#endif
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
ve<ll> c(n);
|
||||
for (auto &e : c)
|
||||
cin >> e;
|
||||
|
||||
/*
|
||||
can c be obtained by "building up" [1]?
|
||||
|
||||
"duplicate" numbers -> check
|
||||
which can we make and how?
|
||||
|
||||
obs: adding 1 increases size
|
||||
can always make, but maybe too long
|
||||
|
||||
sequences only strictly increases -> sort?
|
||||
|
||||
[1, 1, 2, 5, 7] -> make 7 from [1, 1, 2, 5] -> yes; make 5 from [2, 1, 1] -> NO
|
||||
|
||||
[1, 1, 2, 3, 5] -> 5 fomr -> yes,
|
||||
|
||||
[1, 1, 2, 4, 5, 7]
|
||||
|
||||
[1] -> [1, 2] ->
|
||||
|
||||
[1, 2, 3, 4, 5, 6, 7, 8]
|
||||
|
||||
[1, 2, 3, 4]
|
||||
*/
|
||||
|
||||
sort(all(c));
|
||||
|
||||
if (c[0] != 1) {
|
||||
NO();
|
||||
return;
|
||||
}
|
||||
|
||||
// NOTE: take notes here
|
||||
ve<bool> dp(5001);
|
||||
dp[1] = 1;
|
||||
|
||||
for (int i = 0; i < n; ++i) {
|
||||
if (!dp[c[i]]) {
|
||||
NO();
|
||||
return;
|
||||
}
|
||||
for (int j = 5000; j >= c[i]; --j) {
|
||||
if (c[i] + c[j] <= 5000)
|
||||
dp[j] = dp[j] || dp[c[i] - j];
|
||||
}
|
||||
// 1 1 2 4
|
||||
// dp[i] = any(i - dp[j] for all j < i)
|
||||
}
|
||||
|
||||
if (dp[c[n - 1]])
|
||||
YES();
|
||||
else
|
||||
NO();
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
13
codeforces/859/g.in
Normal file
13
codeforces/859/g.in
Normal file
|
|
@ -0,0 +1,13 @@
|
|||
6
|
||||
1
|
||||
1
|
||||
1
|
||||
2
|
||||
5
|
||||
5 1 3 2 1
|
||||
5
|
||||
7 1 5 2 1
|
||||
3
|
||||
1 1 1
|
||||
5
|
||||
1 1 4 2 1
|
||||
116
codeforces/859/h.cc
Normal file
116
codeforces/859/h.cc
Normal file
|
|
@ -0,0 +1,116 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
ve<ll> a(n);
|
||||
for (auto& e : a)
|
||||
cin >> e;
|
||||
sort(all(a));
|
||||
if (a[0] != 1) {
|
||||
NO();
|
||||
return;
|
||||
}
|
||||
|
||||
ll total = 1;
|
||||
for (int i = 1; i < n; ++i) {
|
||||
if (a[i] > total) {
|
||||
NO();
|
||||
return;
|
||||
}
|
||||
total += a[i];
|
||||
}
|
||||
|
||||
YES();
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
13
codeforces/859/h.in
Normal file
13
codeforces/859/h.in
Normal file
|
|
@ -0,0 +1,13 @@
|
|||
6
|
||||
1
|
||||
1
|
||||
1
|
||||
2
|
||||
5
|
||||
5 1 3 2 1
|
||||
5
|
||||
7 1 5 2 1
|
||||
3
|
||||
1 1 1
|
||||
5
|
||||
1 1 4 2 1
|
||||
9
codeforces/871/.clang-format
Normal file
9
codeforces/871/.clang-format
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
BasedOnStyle: Google
|
||||
AllowShortBlocksOnASingleLine: false
|
||||
AllowShortCaseLabelsOnASingleLine: false
|
||||
AllowShortCompoundRequirementOnASingleLine: false
|
||||
AllowShortEnumsOnASingleLine: false
|
||||
AllowShortFunctionsOnASingleLine: false
|
||||
AllowShortIfStatementsOnASingleLine: false
|
||||
AllowShortLambdasOnASingleLine: false
|
||||
AllowShortLoopsOnASingleLine: false
|
||||
8
codeforces/871/.clangd
Normal file
8
codeforces/871/.clangd
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
CompileFlags:
|
||||
Add:
|
||||
- -Wall
|
||||
- -Wextra
|
||||
- -Wpedantic
|
||||
- -Wshadow
|
||||
- -DLOCAL
|
||||
- -Wno-unknown-pragmas
|
||||
103
codeforces/871/a.cc
Normal file
103
codeforces/871/a.cc
Normal file
|
|
@ -0,0 +1,103 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
string codeforces = "codeforces";
|
||||
int ans = 0;
|
||||
char c;
|
||||
for (int i = 0; i < sz<int>(codeforces); ++i) {
|
||||
cin >> c;
|
||||
ans += c != codeforces[i];
|
||||
}
|
||||
prln("{}", ans);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
6
codeforces/871/a.in
Normal file
6
codeforces/871/a.in
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
5
|
||||
coolforsez
|
||||
cadafurcie
|
||||
codeforces
|
||||
paiuforces
|
||||
forcescode
|
||||
10
codeforces/871/a.out
Normal file
10
codeforces/871/a.out
Normal file
|
|
@ -0,0 +1,10 @@
|
|||
4
|
||||
5
|
||||
0
|
||||
4
|
||||
9
|
||||
|
||||
[code]: 0
|
||||
[code]: 0
|
||||
|
||||
[time]: 11.1115 ms[time]: 11.1079 ms
|
||||
110
codeforces/871/b.cc
Normal file
110
codeforces/871/b.cc
Normal file
|
|
@ -0,0 +1,110 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n, x;
|
||||
cin >> n;
|
||||
int cur = 0;
|
||||
int ans = 0;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
cin >> x;
|
||||
if (x == 1) {
|
||||
ans = max(ans, cur);
|
||||
cur = 0;
|
||||
} else
|
||||
++cur;
|
||||
}
|
||||
|
||||
ans = max(ans, cur);
|
||||
prln("{}", ans);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
11
codeforces/871/b.in
Normal file
11
codeforces/871/b.in
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
5
|
||||
5
|
||||
1 0 0 1 0
|
||||
4
|
||||
0 1 1 1
|
||||
1
|
||||
0
|
||||
3
|
||||
1 1 1
|
||||
9
|
||||
1 0 0 0 1 0 0 0 1
|
||||
8
codeforces/871/b.out
Normal file
8
codeforces/871/b.out
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
2
|
||||
1
|
||||
1
|
||||
0
|
||||
3
|
||||
|
||||
[code]: 0
|
||||
[time]: 13.2267 ms
|
||||
116
codeforces/871/c.cc
Normal file
116
codeforces/871/c.cc
Normal file
|
|
@ -0,0 +1,116 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
int m;
|
||||
int s;
|
||||
int best_both = 1e6, best_first = 1e6, best_second = 1e6;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
cin >> m >> s;
|
||||
if (s == 11) {
|
||||
best_both = min(best_both, m);
|
||||
}
|
||||
if (s & 1) {
|
||||
best_first = min(best_first, m);
|
||||
}
|
||||
if (s > 9) {
|
||||
best_second = min(best_second, m);
|
||||
}
|
||||
}
|
||||
|
||||
int ans = min(best_both, best_first + best_second);
|
||||
|
||||
prln("{}", ans >= 1e6 ? -1 : ans);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
30
codeforces/871/c.in
Normal file
30
codeforces/871/c.in
Normal file
|
|
@ -0,0 +1,30 @@
|
|||
6
|
||||
4
|
||||
2 00
|
||||
3 10
|
||||
4 01
|
||||
4 00
|
||||
5
|
||||
3 01
|
||||
3 01
|
||||
5 01
|
||||
2 10
|
||||
9 10
|
||||
1
|
||||
5 11
|
||||
3
|
||||
9 11
|
||||
8 01
|
||||
7 10
|
||||
6
|
||||
4 01
|
||||
6 01
|
||||
7 01
|
||||
8 00
|
||||
9 01
|
||||
1 00
|
||||
4
|
||||
8 00
|
||||
9 10
|
||||
9 11
|
||||
8 11
|
||||
9
codeforces/871/c.out
Normal file
9
codeforces/871/c.out
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
7
|
||||
5
|
||||
5
|
||||
9
|
||||
-1
|
||||
8
|
||||
|
||||
[code]: 0
|
||||
[time]: 15.1625 ms
|
||||
6
codeforces/871/compile_flags.txt
Normal file
6
codeforces/871/compile_flags.txt
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
-Wall
|
||||
-Wextra
|
||||
-Wpedantic
|
||||
-Wshadow
|
||||
-DLOCAL
|
||||
-std=c++23
|
||||
112
codeforces/871/d.cc
Normal file
112
codeforces/871/d.cc
Normal file
|
|
@ -0,0 +1,112 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
bool recurse(int N, int M) {
|
||||
if (M == N)
|
||||
return true;
|
||||
if (M > N || N % 3)
|
||||
return false;
|
||||
return recurse(N / 3, M) || recurse(N / 3 * 2, M);
|
||||
// NOTE: recurrence relation knowledge weak, wasn't convinced
|
||||
// + mathematical derivation completely broke
|
||||
}
|
||||
|
||||
void solve() {
|
||||
int n, m;
|
||||
cin >> n >> m;
|
||||
|
||||
if (recurse(n, m)) {
|
||||
YES();
|
||||
} else
|
||||
NO();
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
12
codeforces/871/d.in
Normal file
12
codeforces/871/d.in
Normal file
|
|
@ -0,0 +1,12 @@
|
|||
11
|
||||
6 4
|
||||
9 4
|
||||
4 2
|
||||
18 27
|
||||
27 4
|
||||
27 2
|
||||
27 10
|
||||
1 1
|
||||
3 1
|
||||
5 1
|
||||
746001 2984004
|
||||
14
codeforces/871/d.out
Normal file
14
codeforces/871/d.out
Normal file
|
|
@ -0,0 +1,14 @@
|
|||
YES
|
||||
YES
|
||||
NO
|
||||
NO
|
||||
YES
|
||||
YES
|
||||
NO
|
||||
YES
|
||||
YES
|
||||
NO
|
||||
NO
|
||||
|
||||
[code]: 0
|
||||
[time]: 12.9371 ms
|
||||
164
codeforces/871/e.cc
Normal file
164
codeforces/871/e.cc
Normal file
|
|
@ -0,0 +1,164 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
ve<pa<int, int>> dxdy = {{-1, 0}, {0, 1}, {0, -1}, {1, 0}};
|
||||
|
||||
template <typename T>
|
||||
struct union_find {
|
||||
public:
|
||||
explicit union_find(size_t capacity)
|
||||
: par(capacity, 0), rank(capacity, 0), sums(capacity, 0) {
|
||||
std::iota(par.begin(), par.end(), 0);
|
||||
};
|
||||
|
||||
void join(T u, T v) noexcept {
|
||||
u = find(u), v = find(v);
|
||||
|
||||
if (u == v)
|
||||
return;
|
||||
|
||||
if (rank[u] < rank[v])
|
||||
std::swap(u, v);
|
||||
|
||||
if (rank[u] == rank[v])
|
||||
++rank[u];
|
||||
|
||||
// NOTE the double counting + joining before collecting value in the union find
|
||||
sums[u] += sums[v];
|
||||
|
||||
par[v] = u;
|
||||
}
|
||||
|
||||
void insert(T const& u, T const& val) {
|
||||
sums[u] = val;
|
||||
}
|
||||
|
||||
[[nodiscard]] T find(T const& u) noexcept {
|
||||
if (u != par[u])
|
||||
par[u] = find(par[u]);
|
||||
return par[u];
|
||||
}
|
||||
|
||||
std::vector<T> par;
|
||||
std::vector<int> rank;
|
||||
std::vector<int> sums;
|
||||
};
|
||||
|
||||
void solve() {
|
||||
int n, m;
|
||||
cin >> n >> m;
|
||||
union_find<int> uf(n * m);
|
||||
ve<ve<int>> grid(n, ve<int>(m));
|
||||
auto index = [&](int r, int c) {
|
||||
return r * m + c;
|
||||
};
|
||||
for (int r = 0; r < n; ++r) {
|
||||
for (int c = 0; c < m; ++c) {
|
||||
cin >> grid[r][c];
|
||||
uf.insert(index(r, c), grid[r][c]);
|
||||
}
|
||||
}
|
||||
for (int r = 0; r < n; ++r) {
|
||||
for (int c = 0; c < m; ++c) {
|
||||
if (grid[r][c]) {
|
||||
for (auto& [dr, dc] : dxdy) {
|
||||
auto nr = r + dr, nc = c + dc;
|
||||
if (min(nr, nc) >= 0 && nr < n && nc < m && grid[nr][nc]) {
|
||||
uf.join(index(r, c), index(nr, nc));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
prln("{}", *max_element(all(uf.sums)));
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
23
codeforces/871/e.in
Normal file
23
codeforces/871/e.in
Normal file
|
|
@ -0,0 +1,23 @@
|
|||
5
|
||||
3 3
|
||||
1 2 0
|
||||
3 4 0
|
||||
0 0 5
|
||||
1 1
|
||||
0
|
||||
3 3
|
||||
0 1 1
|
||||
1 0 1
|
||||
1 1 1
|
||||
5 5
|
||||
1 1 1 1 1
|
||||
1 0 0 0 1
|
||||
1 0 5 0 1
|
||||
1 0 0 0 1
|
||||
1 1 1 1 1
|
||||
5 5
|
||||
1 1 1 1 1
|
||||
1 0 0 0 1
|
||||
1 1 4 0 1
|
||||
1 0 0 0 1
|
||||
1 1 1 1 1
|
||||
8
codeforces/871/e.out
Normal file
8
codeforces/871/e.out
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
10
|
||||
0
|
||||
7
|
||||
16
|
||||
21
|
||||
|
||||
[code]: 0
|
||||
[time]: 12.769 ms
|
||||
121
codeforces/871/f.cc
Normal file
121
codeforces/871/f.cc
Normal file
|
|
@ -0,0 +1,121 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n, m;
|
||||
cin >> n >> m;
|
||||
ve<int> out(n + 1, 0);
|
||||
ve<ve<int>> G(n + 1);
|
||||
while (m--) {
|
||||
int u, v;
|
||||
cin >> u >> v;
|
||||
++out[u];
|
||||
++out[v];
|
||||
G[u].eb(v);
|
||||
G[v].eb(u);
|
||||
}
|
||||
|
||||
for (int u = 1; u <= n; ++u) {
|
||||
if (out[u] == 1) {
|
||||
int v = G[u][0];
|
||||
int y = out[v] - 1;
|
||||
for (auto w : G[v]) {
|
||||
if (out[w] > 1) {
|
||||
int x = out[w];
|
||||
prln("{} {}", x, y);
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
38
codeforces/871/f.in
Normal file
38
codeforces/871/f.in
Normal file
|
|
@ -0,0 +1,38 @@
|
|||
3
|
||||
21 20
|
||||
21 20
|
||||
5 20
|
||||
13 20
|
||||
1 3
|
||||
11 3
|
||||
10 3
|
||||
4 8
|
||||
19 8
|
||||
14 8
|
||||
9 7
|
||||
12 7
|
||||
17 7
|
||||
18 6
|
||||
16 6
|
||||
2 6
|
||||
6 15
|
||||
7 15
|
||||
8 15
|
||||
20 15
|
||||
3 15
|
||||
7 6
|
||||
1 2
|
||||
1 3
|
||||
2 4
|
||||
2 5
|
||||
3 6
|
||||
3 7
|
||||
9 8
|
||||
9 3
|
||||
3 6
|
||||
6 2
|
||||
2 1
|
||||
5 2
|
||||
2 7
|
||||
4 3
|
||||
3 8
|
||||
6
codeforces/871/f.out
Normal file
6
codeforces/871/f.out
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
5 3
|
||||
2 2
|
||||
2 3
|
||||
|
||||
[code]: 0
|
||||
[time]: 12.9485 ms
|
||||
124
codeforces/871/g.cc
Normal file
124
codeforces/871/g.cc
Normal file
|
|
@ -0,0 +1,124 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
ll l = 1, r = 1e6;
|
||||
while (l <= r) {
|
||||
ll m = l + (r - l) / 2;
|
||||
if (m * (m + 1) / 2 >= n) {
|
||||
r = m - 1;
|
||||
} else {
|
||||
l = m + 1;
|
||||
}
|
||||
}
|
||||
auto sumsq = [](ll x) {
|
||||
return x * (x + 1) * (2 * x + 1) / 6;
|
||||
};
|
||||
ll level = l;
|
||||
ll ans = 0;
|
||||
l = r = level - (level * (level + 1) / 2 - n) - 1;
|
||||
while (level > 0) {
|
||||
l = max(0LL, l);
|
||||
r = min(r, level - 1);
|
||||
|
||||
auto left = level * (level + 1) / 2 - level + 1;
|
||||
ans -= sumsq(left + l - 1);
|
||||
ans += sumsq(left + r);
|
||||
|
||||
--l;
|
||||
--level;
|
||||
}
|
||||
prln("{}", ans);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
11
codeforces/871/g.in
Normal file
11
codeforces/871/g.in
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
10
|
||||
9
|
||||
1
|
||||
2
|
||||
3
|
||||
4
|
||||
5
|
||||
6
|
||||
10
|
||||
1434
|
||||
1000000
|
||||
13
codeforces/871/g.out
Normal file
13
codeforces/871/g.out
Normal file
|
|
@ -0,0 +1,13 @@
|
|||
156
|
||||
1
|
||||
5
|
||||
10
|
||||
21
|
||||
39
|
||||
46
|
||||
146
|
||||
63145186
|
||||
58116199242129511
|
||||
|
||||
[code]: 0
|
||||
[time]: 15.1484 ms
|
||||
9
codeforces/888/.clang-format
Normal file
9
codeforces/888/.clang-format
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
BasedOnStyle: Google
|
||||
AllowShortBlocksOnASingleLine: false
|
||||
AllowShortCaseLabelsOnASingleLine: false
|
||||
AllowShortCompoundRequirementOnASingleLine: false
|
||||
AllowShortEnumsOnASingleLine: false
|
||||
AllowShortFunctionsOnASingleLine: false
|
||||
AllowShortIfStatementsOnASingleLine: false
|
||||
AllowShortLambdasOnASingleLine: false
|
||||
AllowShortLoopsOnASingleLine: false
|
||||
8
codeforces/888/.clangd
Normal file
8
codeforces/888/.clangd
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
CompileFlags:
|
||||
Add:
|
||||
- -Wall
|
||||
- -Wextra
|
||||
- -Wpedantic
|
||||
- -Wshadow
|
||||
- -DLOCAL
|
||||
- -Wno-unknown-pragmas
|
||||
110
codeforces/888/a.cc
Normal file
110
codeforces/888/a.cc
Normal file
|
|
@ -0,0 +1,110 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n, m, k, H;
|
||||
cin >> n >> m >> k >> H;
|
||||
|
||||
int ans = 0;
|
||||
int h;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
cin >> h;
|
||||
|
||||
auto diff = abs(h - H);
|
||||
if (diff % k == 0 && diff / k < m && diff / k > 0) {
|
||||
++ans;
|
||||
}
|
||||
}
|
||||
prln("{}", ans);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
15
codeforces/888/a.in
Normal file
15
codeforces/888/a.in
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
7
|
||||
5 3 3 11
|
||||
5 4 14 18 2
|
||||
2 9 5 6
|
||||
11 9
|
||||
10 50 3 11
|
||||
43 44 74 98 62 60 99 4 11 73
|
||||
4 8 8 49
|
||||
68 58 82 73
|
||||
7 1 4 66
|
||||
18 66 39 83 48 99 79
|
||||
9 1 1 13
|
||||
26 23 84 6 60 87 40 41 25
|
||||
6 13 3 28
|
||||
30 70 85 13 1 55
|
||||
10
codeforces/888/a.out
Normal file
10
codeforces/888/a.out
Normal file
|
|
@ -0,0 +1,10 @@
|
|||
2
|
||||
1
|
||||
4
|
||||
1
|
||||
0
|
||||
0
|
||||
3
|
||||
|
||||
[code]: 0
|
||||
[time]: 15.1486 ms
|
||||
137
codeforces/888/b.cc
Normal file
137
codeforces/888/b.cc
Normal file
|
|
@ -0,0 +1,137 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
ve<int> odds, evens, odd_is, even_is;
|
||||
|
||||
int x;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
cin >> x;
|
||||
if (x & 1) {
|
||||
odds.eb(x);
|
||||
odd_is.eb(i);
|
||||
} else {
|
||||
evens.eb(x);
|
||||
even_is.eb(i);
|
||||
}
|
||||
}
|
||||
|
||||
sort(all(evens));
|
||||
sort(all(even_is));
|
||||
sort(all(odds));
|
||||
sort(all(odd_is));
|
||||
|
||||
int e = 0, o = 0;
|
||||
int last = 0;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
if (e < sz<int>(even_is) && even_is[e] == i) {
|
||||
if (i && evens[e] < last) {
|
||||
NO();
|
||||
return;
|
||||
}
|
||||
last = evens[e];
|
||||
++e;
|
||||
} else {
|
||||
if (i && odds[o] < last) {
|
||||
NO();
|
||||
return;
|
||||
}
|
||||
last = odds[o];
|
||||
++o;
|
||||
}
|
||||
}
|
||||
|
||||
YES();
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
13
codeforces/888/b.in
Normal file
13
codeforces/888/b.in
Normal file
|
|
@ -0,0 +1,13 @@
|
|||
6
|
||||
5
|
||||
7 10 1 3 2
|
||||
4
|
||||
11 9 3 5
|
||||
5
|
||||
11 3 15 3 2
|
||||
6
|
||||
10 7 8 1 2 3
|
||||
1
|
||||
10
|
||||
5
|
||||
6 6 4 1 6
|
||||
11
codeforces/888/b.out
Normal file
11
codeforces/888/b.out
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
YES
|
||||
YES
|
||||
NO
|
||||
NO
|
||||
YES
|
||||
NO
|
||||
|
||||
[code]: 0
|
||||
[code]: 0
|
||||
|
||||
[time]: 5.26595 ms[time]: 11.1866 ms
|
||||
146
codeforces/888/c.cc
Normal file
146
codeforces/888/c.cc
Normal file
|
|
@ -0,0 +1,146 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n, k;
|
||||
cin >> n >> k;
|
||||
ve<int> colors(n);
|
||||
for (auto& e : colors) {
|
||||
cin >> e;
|
||||
}
|
||||
|
||||
// have to start on tile 1, greedily take first k
|
||||
// then, greedily take (backwards) from n - 1 until when you stopped
|
||||
// note divisibility
|
||||
|
||||
int seen = 0;
|
||||
int i;
|
||||
for (i = 0; i < n && seen < k; ++i) {
|
||||
if (colors[i] == colors[0])
|
||||
++seen;
|
||||
}
|
||||
|
||||
if (colors[0] == colors[n - 1]) {
|
||||
int x = 0;
|
||||
for (int j = 0; j < n; ++j)
|
||||
if (colors[j] == colors[0])
|
||||
++x;
|
||||
if (x >= k) {
|
||||
YES();
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
// dbgln("found first {} elems {}, ending at {}", seen, colors[0], i);
|
||||
|
||||
if (i == n) {
|
||||
if (seen % k == 0) {
|
||||
YES();
|
||||
} else {
|
||||
NO();
|
||||
}
|
||||
return;
|
||||
}
|
||||
|
||||
seen = 0;
|
||||
for (int j = n - 1; j >= i && seen < k; --j) {
|
||||
if (colors[j] == colors[n - 1])
|
||||
++seen;
|
||||
}
|
||||
|
||||
if (seen % k == 0) {
|
||||
YES();
|
||||
} else {
|
||||
NO();
|
||||
}
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
21
codeforces/888/c.in
Normal file
21
codeforces/888/c.in
Normal file
|
|
@ -0,0 +1,21 @@
|
|||
10
|
||||
4 2
|
||||
1 1 1 1
|
||||
14 3
|
||||
1 2 1 1 7 5 3 3 1 3 4 4 2 4
|
||||
3 3
|
||||
3 1 3
|
||||
10 4
|
||||
1 2 1 2 1 2 1 2 1 2
|
||||
6 2
|
||||
1 3 4 1 6 6
|
||||
2 2
|
||||
1 1
|
||||
4 2
|
||||
2 1 1 1
|
||||
2 1
|
||||
1 2
|
||||
3 2
|
||||
2 2 2
|
||||
4 1
|
||||
1 1 2 2
|
||||
13
codeforces/888/c.out
Normal file
13
codeforces/888/c.out
Normal file
|
|
@ -0,0 +1,13 @@
|
|||
YES
|
||||
YES
|
||||
NO
|
||||
NO
|
||||
YES
|
||||
YES
|
||||
NO
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
|
||||
[code]: 0
|
||||
[time]: 15.0125 ms
|
||||
6
codeforces/888/compile_flags.txt
Normal file
6
codeforces/888/compile_flags.txt
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
-Wall
|
||||
-Wextra
|
||||
-Wpedantic
|
||||
-Wshadow
|
||||
-DLOCAL
|
||||
-std=c++23
|
||||
112
codeforces/888/d.cc
Normal file
112
codeforces/888/d.cc
Normal file
|
|
@ -0,0 +1,112 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
ve<ll> perm(n - 1);
|
||||
int j = -1;
|
||||
unoredered_set<int> seen;
|
||||
set<int> seen;
|
||||
for (int i = 0; i < n - 1; ++i) {
|
||||
cin >> perm[i];
|
||||
if (i) {
|
||||
int diff = abs(perm[i] - perm[i - 1]);
|
||||
if (diff >= n) {
|
||||
j = i;
|
||||
} else {
|
||||
seen.insert(diff);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
25
codeforces/888/d.in
Normal file
25
codeforces/888/d.in
Normal file
|
|
@ -0,0 +1,25 @@
|
|||
12
|
||||
5
|
||||
6 8 12 15
|
||||
5
|
||||
1 6 8 15
|
||||
4
|
||||
1 2 100
|
||||
4
|
||||
1 3 6
|
||||
2
|
||||
2
|
||||
3
|
||||
1 2
|
||||
4
|
||||
3 7 10
|
||||
5
|
||||
5 44 46 50
|
||||
4
|
||||
1 9 10
|
||||
5
|
||||
13 21 36 42
|
||||
5
|
||||
1 2 3 1000000000000000000
|
||||
9
|
||||
9 11 12 20 25 28 30 33
|
||||
15
codeforces/888/d.out
Normal file
15
codeforces/888/d.out
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
YES
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
YES
|
||||
|
||||
[code]: 0
|
||||
[time]: 6.00839 ms
|
||||
137
codeforces/888/e.cc
Normal file
137
codeforces/888/e.cc
Normal file
|
|
@ -0,0 +1,137 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
bitset<2 * 100000 + 1> seen;
|
||||
|
||||
void solve() {
|
||||
int n, k;
|
||||
cin >> n >> k;
|
||||
seen.reset();
|
||||
ve<ll> c(n + 1);
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
cin >> c[i];
|
||||
}
|
||||
int p;
|
||||
for (int i = 1; i <= k; ++i) {
|
||||
cin >> p;
|
||||
c[p] = 0;
|
||||
seen[p] = true;
|
||||
}
|
||||
int m;
|
||||
ve<ve<ll>> recipes(n + 1);
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
cin >> m;
|
||||
recipes[i].resize(m);
|
||||
for (int j = 0; j < m; ++j) {
|
||||
cin >> recipes[i][j];
|
||||
}
|
||||
}
|
||||
|
||||
int x = 3;
|
||||
|
||||
auto dfs = [&](auto&& self, int u) {
|
||||
if (seen[u] || recipes[u].empty())
|
||||
return c[u];
|
||||
seen[u] = true;
|
||||
ll total = 0;
|
||||
for (auto& v : recipes[u])
|
||||
total += self(self, v);
|
||||
c[u] = min(c[u], total);
|
||||
return c[u];
|
||||
};
|
||||
|
||||
for (int i = 1; i <= n; ++i) {
|
||||
pr("{} ", dfs(dfs, i));
|
||||
}
|
||||
prln();
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
30
codeforces/888/e.in
Normal file
30
codeforces/888/e.in
Normal file
|
|
@ -0,0 +1,30 @@
|
|||
4
|
||||
5 1
|
||||
30 8 3 5 10
|
||||
3
|
||||
3 2 4 5
|
||||
0
|
||||
0
|
||||
2 3 5
|
||||
0
|
||||
3 2
|
||||
5 143 3
|
||||
1 3
|
||||
1 2
|
||||
0
|
||||
2 1 2
|
||||
5 1
|
||||
5 4 1 3 4
|
||||
2
|
||||
2 4 5
|
||||
3 3 5 4
|
||||
2 1 4
|
||||
1 5
|
||||
0
|
||||
4 2
|
||||
1 1 5 4
|
||||
2 4
|
||||
3 2 4 3
|
||||
0
|
||||
2 2 4
|
||||
1 2
|
||||
7
codeforces/888/e.out
Normal file
7
codeforces/888/e.out
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
23 8 0 5 10
|
||||
0 143 0
|
||||
5 0 1 3 4
|
||||
0 0 0 0
|
||||
|
||||
[code]: 0
|
||||
[time]: 14.1129 ms
|
||||
174
codeforces/888/g.cc
Normal file
174
codeforces/888/g.cc
Normal file
|
|
@ -0,0 +1,174 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
template <typename T>
|
||||
struct union_find {
|
||||
public:
|
||||
explicit union_find(size_t capacity)
|
||||
: par(capacity + 1, 0), rank(capacity + 1, 0) {
|
||||
std::iota(par.begin(), par.end(), 0);
|
||||
};
|
||||
|
||||
void join(T u, T v) noexcept {
|
||||
u = find(u), v = find(v);
|
||||
|
||||
if (u == v)
|
||||
return;
|
||||
|
||||
if (rank[u] < rank[v])
|
||||
std::swap(u, v);
|
||||
|
||||
if (rank[u] == rank[v])
|
||||
++rank[u];
|
||||
|
||||
par[v] = u;
|
||||
}
|
||||
|
||||
[[nodiscard]] T find(T const& u) noexcept {
|
||||
if (u != par[u])
|
||||
par[u] = find(par[u]);
|
||||
return par[u];
|
||||
}
|
||||
|
||||
std::vector<T> par;
|
||||
std::vector<int> rank;
|
||||
};
|
||||
|
||||
void solve() {
|
||||
int n, m;
|
||||
cin >> n >> m;
|
||||
|
||||
ve<ll> heights(n + 1);
|
||||
for (int i = 1; i <= n; ++i)
|
||||
cin >> heights[i];
|
||||
|
||||
ve<ar<ll, 3>> roads(m);
|
||||
for (int i = 0; i < m; ++i) {
|
||||
int u, v;
|
||||
cin >> u >> v;
|
||||
if (heights[u] > heights[v]) {
|
||||
roads.pb({heights[u] - heights[v], u, v});
|
||||
} else {
|
||||
roads.pb({heights[v] - heights[v], v, u});
|
||||
}
|
||||
}
|
||||
|
||||
sort(all(roads));
|
||||
union_find<int> uf(n);
|
||||
|
||||
int q;
|
||||
cin >> q;
|
||||
ve<ar<ll, 5>> queries(q);
|
||||
for (int i = 0; i < q; ++i) {
|
||||
ll a, b, e;
|
||||
cin >> a >> b >> e;
|
||||
queries[i] = {heights[a] + e, a, b, e, i};
|
||||
}
|
||||
sort(all(queries));
|
||||
|
||||
ve<bool> ans(n, false);
|
||||
|
||||
for (auto& [hab, a, b, e, i] : queries) {
|
||||
while (i < m && roads[i][0] <= hab && roads[i][1] <= hab) {
|
||||
uf.join(a, roads[0][1]);
|
||||
uf.join(a, roads[0][2]);
|
||||
++i;
|
||||
}
|
||||
|
||||
ans[i] = uf.find(a) == uf.find(b);
|
||||
}
|
||||
|
||||
for (auto e : ans) {
|
||||
e ? YES() : NO();
|
||||
}
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
29
codeforces/888/g.in
Normal file
29
codeforces/888/g.in
Normal file
|
|
@ -0,0 +1,29 @@
|
|||
2
|
||||
7 7
|
||||
1 5 3 4 2 4 1
|
||||
1 4
|
||||
4 3
|
||||
3 6
|
||||
3 2
|
||||
2 5
|
||||
5 6
|
||||
5 7
|
||||
5
|
||||
1 1 3
|
||||
6 2 0
|
||||
4 7 0
|
||||
1 7 4
|
||||
1 7 2
|
||||
6 5
|
||||
4 7 6 2 5 1
|
||||
1 3
|
||||
5 3
|
||||
1 5
|
||||
2 4
|
||||
6 2
|
||||
5
|
||||
1 5 1
|
||||
1 3 1
|
||||
1 2 1000
|
||||
6 2 6
|
||||
6 2 5
|
||||
16
codeforces/888/g.out
Normal file
16
codeforces/888/g.out
Normal file
|
|
@ -0,0 +1,16 @@
|
|||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
NO
|
||||
|
||||
[code]: 0
|
||||
[time]: 13.5758 ms
|
||||
|
|
@ -1,4 +1,4 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
|
|
@ -7,19 +7,23 @@
|
|||
|
||||
using namespace std;
|
||||
|
||||
template <typename T> [[nodiscard]] static T MIN() {
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T> [[nodiscard]] static T MAX() {
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T> [[nodiscard]] static T sc(auto &&x) {
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto &&x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T> [[nodiscard]] static T sz(auto &&x) {
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto &&x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
|
|
@ -31,22 +35,38 @@ template <typename T> [[nodiscard]] static T sz(auto &&x) {
|
|||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() { prln("NO"); }
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() { prln("YES"); }
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T> using ve = std::vector<T>;
|
||||
template <typename T, size_t N> using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2> using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts> using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts> using dq = std::deque<Ts...>;
|
||||
template <typename... Ts> using qu = std::queue<Ts...>;
|
||||
template <typename... Ts> using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts> using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) { return std::lower_bound(args...); };
|
||||
auto ub = [](auto... args) { return std::upper_bound(args...); };
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
|
|
@ -63,7 +83,7 @@ void solve() {
|
|||
prln("{}", ceill(abs((b - a) / 2) / c));
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
|
|
|
|||
|
|
@ -1,9 +1,9 @@
|
|||
1
|
||||
3
|
||||
0
|
||||
1
|
||||
50
|
||||
16
|
||||
wit
|
||||
wit
|
||||
wit
|
||||
wit
|
||||
wit
|
||||
wit
|
||||
|
||||
[code]: 0
|
||||
[time]: 13.0444 ms
|
||||
[time]: 13.4819 ms
|
||||
|
|
@ -7,4 +7,4 @@
|
|||
1
|
||||
|
||||
[code]: 0
|
||||
[time]: 13.6361 ms
|
||||
[time]: 12.7835 ms
|
||||
|
|
@ -11,4 +11,4 @@
|
|||
3137 9837632
|
||||
|
||||
[code]: 0
|
||||
[time]: 13.5865 ms
|
||||
[time]: 6.83761 ms
|
||||
|
|
@ -76,20 +76,106 @@ auto ub = [](auto... args) {
|
|||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
#include <stdexcept>
|
||||
#include <vector>
|
||||
|
||||
template <typename T>
|
||||
class segment_tree {
|
||||
public:
|
||||
explicit segment_tree(std::vector<T> const& data)
|
||||
: n(data.size()), tree(2 * n, sentinel()), lazy(n, sentinel()) {
|
||||
for (size_t i = 0; i < n; ++i)
|
||||
tree[i + n] = data[i];
|
||||
for (int i = n - 1; i > 0; --i)
|
||||
tree[i] = merge(tree[i * 2], tree[i * 2 + 1]);
|
||||
}
|
||||
|
||||
void update(int l, int r, T const& t) noexcept {
|
||||
l += n, r += n + 1;
|
||||
push(l);
|
||||
push(r - 1);
|
||||
for (int L = l, R = r; L < R; L /= 2, R /= 2) {
|
||||
if (L & 1)
|
||||
apply(L++, t);
|
||||
if (R & 1)
|
||||
apply(--R, t);
|
||||
}
|
||||
for (l /= 2; l; l /= 2)
|
||||
tree[l] = merge(tree[l * 2], tree[l * 2 + 1]);
|
||||
for (r = (r - 1) / 2; r; r /= 2)
|
||||
tree[r] = merge(tree[r * 2], tree[r * 2 + 1]);
|
||||
}
|
||||
|
||||
[[nodiscard]] T query(int l, int r) noexcept {
|
||||
l += n, r += n + 1;
|
||||
push(l);
|
||||
push(r - 1);
|
||||
T left = sentinel(), right = sentinel();
|
||||
for (; l < r; l /= 2, r /= 2) {
|
||||
if (l & 1)
|
||||
left = merge(left, tree[l++]);
|
||||
if (r & 1)
|
||||
right = merge(tree[--r], right);
|
||||
}
|
||||
return merge(left, right);
|
||||
}
|
||||
|
||||
private:
|
||||
int n;
|
||||
std::vector<T> tree, lazy;
|
||||
|
||||
[[nodiscard]] T merge(T const& a, T const& b) const {
|
||||
return a ^ b;
|
||||
}
|
||||
|
||||
[[nodiscard]] inline T do_apply(T const& a, T const& b) const {
|
||||
return a & b;
|
||||
}
|
||||
|
||||
[[nodiscard]] T sentinel() const {
|
||||
return 0;
|
||||
}
|
||||
|
||||
void push(int i) {
|
||||
for (int h = __builtin_clz(n) - __builtin_clz(i); h > 0; --h) {
|
||||
int p = i >> h;
|
||||
if (lazy[p] != sentinel()) {
|
||||
apply(p * 2, lazy[p]);
|
||||
apply(p * 2 + 1, lazy[p]);
|
||||
lazy[p] = sentinel();
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void apply(int i, T const& t) {
|
||||
tree[i] = do_apply(tree[i], t);
|
||||
if (i < n)
|
||||
lazy[i] = do_apply(lazy[i], t);
|
||||
}
|
||||
};
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
ve<ll> a(n), prefix(n);
|
||||
ve<ll> a(n); //, prefix(n);
|
||||
for (auto& e : a)
|
||||
cin >> e;
|
||||
string s;
|
||||
cin >> s;
|
||||
int zeroes = 0;
|
||||
// int zeroes = 0;
|
||||
ve<ll> zero(n), one(n);
|
||||
for (int i = 0; i < n; ++i) {
|
||||
prefix[i] = a[i] ^ (i ? prefix[i - 1] : 0);
|
||||
if (s[i] == '0')
|
||||
zeroes ^= a[i];
|
||||
// prefix[i] = a[i] ^ (i ? prefix[i - 1] : 0);
|
||||
if (s[i] == '0') {
|
||||
zero[i] = a[i];
|
||||
one[i] = 0;
|
||||
} else {
|
||||
one[i] = a[i];
|
||||
zero[i] = 0;
|
||||
}
|
||||
// zeroes ^= a[i];
|
||||
}
|
||||
segment_tree<ll> zeroes(zero), ones(one);
|
||||
int q;
|
||||
cin >> q;
|
||||
int cmd, l, r, g;
|
||||
|
|
@ -99,13 +185,17 @@ void solve() {
|
|||
cin >> l >> r;
|
||||
--l;
|
||||
--r;
|
||||
zeroes ^= prefix[r] ^ (l ? prefix[l - 1] : 0);
|
||||
zeroes.update(l, r);
|
||||
// zeroes ^= prefix[r] ^ (l ? prefix[l - 1] : 0);
|
||||
} else {
|
||||
cin >> g;
|
||||
if (g == 0)
|
||||
pr("{} ", zeroes);
|
||||
else
|
||||
pr("{} ", prefix.back() ^ zeroes);
|
||||
if (g == 1) {
|
||||
pr("{} ", (g == 1 ? ones : zeroes).query(0, n - 1));
|
||||
}
|
||||
// if (g == 0)
|
||||
// pr("{} ", zeroes);
|
||||
// else
|
||||
// pr("{} ", prefix.back() ^ zeroes);
|
||||
}
|
||||
}
|
||||
prln();
|
||||
|
|
|
|||
|
|
@ -1,8 +1,8 @@
|
|||
3 2 6 7 7
|
||||
11 7
|
||||
0 0
|
||||
2 2 2
|
||||
11 11
|
||||
|
||||
16430827
|
||||
47
|
||||
|
||||
|
||||
[code]: 0
|
||||
[time]: 13.0174 ms
|
||||
[time]: 6.14762 ms
|
||||
9
codeforces/898/.clang-format
Normal file
9
codeforces/898/.clang-format
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
BasedOnStyle: Google
|
||||
AllowShortBlocksOnASingleLine: false
|
||||
AllowShortCaseLabelsOnASingleLine: false
|
||||
AllowShortCompoundRequirementOnASingleLine: false
|
||||
AllowShortEnumsOnASingleLine: false
|
||||
AllowShortFunctionsOnASingleLine: false
|
||||
AllowShortIfStatementsOnASingleLine: false
|
||||
AllowShortLambdasOnASingleLine: false
|
||||
AllowShortLoopsOnASingleLine: false
|
||||
8
codeforces/898/.clangd
Normal file
8
codeforces/898/.clangd
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
CompileFlags:
|
||||
Add:
|
||||
- -Wall
|
||||
- -Wextra
|
||||
- -Wpedantic
|
||||
- -Wshadow
|
||||
- -DLOCAL
|
||||
- -Wno-unknown-pragmas
|
||||
102
codeforces/898/a.cc
Normal file
102
codeforces/898/a.cc
Normal file
|
|
@ -0,0 +1,102 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto &&x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto &&x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
string s;
|
||||
cin >> s;
|
||||
|
||||
if (s == "abc" || s == "cba" || s == "acb" || s == "bac")
|
||||
YES();
|
||||
else
|
||||
NO();
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
7
codeforces/898/a.in
Normal file
7
codeforces/898/a.in
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
6
|
||||
abc
|
||||
acb
|
||||
bac
|
||||
bca
|
||||
cab
|
||||
cba
|
||||
109
codeforces/898/b.cc
Normal file
109
codeforces/898/b.cc
Normal file
|
|
@ -0,0 +1,109 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n;
|
||||
cin >> n;
|
||||
|
||||
ve<int> a(n);
|
||||
ll ans = 1;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
cin >> a[i];
|
||||
ans *= a[i];
|
||||
}
|
||||
sort(all(a));
|
||||
ll a2 = 1;
|
||||
for (int i = 1; i < n; ++i)
|
||||
a2 *= a[i];
|
||||
prln("{}", a2 + ans);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
9
codeforces/898/b.in
Normal file
9
codeforces/898/b.in
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
4
|
||||
4
|
||||
2 2 1 2
|
||||
3
|
||||
0 1 2
|
||||
5
|
||||
4 3 2 3 4
|
||||
9
|
||||
9 9 9 9 9 9 9 9 9
|
||||
7
codeforces/898/b.out
Normal file
7
codeforces/898/b.out
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
16
|
||||
2
|
||||
432
|
||||
430467210
|
||||
|
||||
[code]: 0
|
||||
[time]: 12.507 ms
|
||||
111
codeforces/898/c.cc
Normal file
111
codeforces/898/c.cc
Normal file
|
|
@ -0,0 +1,111 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
char C;
|
||||
ll ans = 0;
|
||||
for (int r = 0; r < 10; ++r) {
|
||||
for (int c = 0; c < 10; ++c) {
|
||||
cin >> C;
|
||||
if (C == 'X') {
|
||||
int row = min(r, c), col = max(r, c);
|
||||
if (col > 4)
|
||||
col = 4 - (col - 5);
|
||||
if (row > 4)
|
||||
row = 4 - (row - 5);
|
||||
ans += min(row, col) + 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
prln("{}", ans);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
41
codeforces/898/c.in
Normal file
41
codeforces/898/c.in
Normal file
|
|
@ -0,0 +1,41 @@
|
|||
4
|
||||
X.........
|
||||
..........
|
||||
.......X..
|
||||
.....X....
|
||||
......X...
|
||||
..........
|
||||
.........X
|
||||
..X.......
|
||||
..........
|
||||
.........X
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
....X.....
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
..........
|
||||
XXXXXXXXXX
|
||||
XXXXXXXXXX
|
||||
XXXXXXXXXX
|
||||
XXXXXXXXXX
|
||||
XXXXXXXXXX
|
||||
XXXXXXXXXX
|
||||
XXXXXXXXXX
|
||||
XXXXXXXXXX
|
||||
XXXXXXXXXX
|
||||
XXXXXXXXXX
|
||||
7
codeforces/898/c.out
Normal file
7
codeforces/898/c.out
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
17
|
||||
0
|
||||
5
|
||||
220
|
||||
|
||||
[code]: 0
|
||||
[time]: 5.24926 ms
|
||||
6
codeforces/898/compile_flags.txt
Normal file
6
codeforces/898/compile_flags.txt
Normal file
|
|
@ -0,0 +1,6 @@
|
|||
-Wall
|
||||
-Wextra
|
||||
-Wpedantic
|
||||
-Wshadow
|
||||
-DLOCAL
|
||||
-std=c++23
|
||||
109
codeforces/898/d.cc
Normal file
109
codeforces/898/d.cc
Normal file
|
|
@ -0,0 +1,109 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n, k;
|
||||
cin >> n >> k;
|
||||
string s;
|
||||
cin >> s;
|
||||
int i = 0;
|
||||
int ans = 0;
|
||||
while (i < n) {
|
||||
if (s[i] == 'B') {
|
||||
++ans;
|
||||
i = min(n, i + k);
|
||||
} else
|
||||
++i;
|
||||
}
|
||||
prln("{}", ans);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
17
codeforces/898/d.in
Normal file
17
codeforces/898/d.in
Normal file
|
|
@ -0,0 +1,17 @@
|
|||
8
|
||||
6 3
|
||||
WBWWWB
|
||||
7 3
|
||||
WWBWBWW
|
||||
5 4
|
||||
BWBWB
|
||||
5 5
|
||||
BBBBB
|
||||
8 2
|
||||
BWBWBBBB
|
||||
10 2
|
||||
WBBWBBWBBW
|
||||
4 1
|
||||
BBBB
|
||||
3 2
|
||||
WWW
|
||||
11
codeforces/898/d.out
Normal file
11
codeforces/898/d.out
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
2
|
||||
1
|
||||
2
|
||||
1
|
||||
4
|
||||
3
|
||||
4
|
||||
0
|
||||
|
||||
[code]: 0
|
||||
[time]: 13.9532 ms
|
||||
122
codeforces/898/e.cc
Normal file
122
codeforces/898/e.cc
Normal file
|
|
@ -0,0 +1,122 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n, x;
|
||||
cin >> n >> x;
|
||||
ve<ll> a(n);
|
||||
for (auto& e : a)
|
||||
cin >> e;
|
||||
|
||||
ll l = 1, r = 2'000'000'007;
|
||||
|
||||
auto can = [&](int A) {
|
||||
ll total = 0;
|
||||
for (int i = 0; i < n; ++i) {
|
||||
total += max(0LL, A - a[i]);
|
||||
}
|
||||
return total <= x;
|
||||
};
|
||||
|
||||
while (l <= r) {
|
||||
ll m = l + (r - l) / 2;
|
||||
|
||||
if (can(m)) {
|
||||
l = m + 1;
|
||||
} else {
|
||||
r = m - 1;
|
||||
}
|
||||
}
|
||||
|
||||
prln("{}", r);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
11
codeforces/898/e.in
Normal file
11
codeforces/898/e.in
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
5
|
||||
7 9
|
||||
3 1 2 4 6 2 5
|
||||
3 10
|
||||
1 1 1
|
||||
4 1
|
||||
1 4 3 4
|
||||
6 1984
|
||||
2 6 5 9 1 8
|
||||
1 1000000000
|
||||
1
|
||||
8
codeforces/898/e.out
Normal file
8
codeforces/898/e.out
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
4
|
||||
4
|
||||
2
|
||||
335
|
||||
1000000001
|
||||
|
||||
[code]: 0
|
||||
[time]: 13.1681 ms
|
||||
115
codeforces/898/f.cc
Normal file
115
codeforces/898/f.cc
Normal file
|
|
@ -0,0 +1,115 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
int n, k;
|
||||
cin >> n >> k;
|
||||
ve<ll> a(n), h(n);
|
||||
for (auto& e : a)
|
||||
cin >> e;
|
||||
for (auto& e : h)
|
||||
cin >> e;
|
||||
|
||||
int ans = 0;
|
||||
int l = 0, fruits = 0;
|
||||
for (int r = 0; r < n; ++r) {
|
||||
fruits += a[r];
|
||||
while (l <= r &&
|
||||
(fruits > k || (l < r && (h[l] % h[l + 1] || h[r - 1] % h[r])))) {
|
||||
fruits -= a[l];
|
||||
++l;
|
||||
}
|
||||
ans = max(ans, r - l + 1);
|
||||
}
|
||||
prln("{}", ans);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
16
codeforces/898/f.in
Normal file
16
codeforces/898/f.in
Normal file
|
|
@ -0,0 +1,16 @@
|
|||
5
|
||||
5 12
|
||||
3 2 4 1 8
|
||||
4 4 2 4 1
|
||||
4 8
|
||||
5 4 1 2
|
||||
6 2 3 1
|
||||
3 12
|
||||
7 9 10
|
||||
2 2 4
|
||||
1 10
|
||||
11
|
||||
1
|
||||
7 10
|
||||
2 6 3 1 5 10 6
|
||||
72 24 24 12 4 4 2
|
||||
8
codeforces/898/f.out
Normal file
8
codeforces/898/f.out
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
3
|
||||
2
|
||||
1
|
||||
0
|
||||
3
|
||||
|
||||
[code]: 0
|
||||
[time]: 11.9457 ms
|
||||
118
codeforces/898/g.cc
Normal file
118
codeforces/898/g.cc
Normal file
|
|
@ -0,0 +1,118 @@
|
|||
#include <bits/stdc++.h> // {{{
|
||||
|
||||
// https://codeforces.com/blog/entry/96344
|
||||
|
||||
#pragma GCC optimize("O2,unroll-loops")
|
||||
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
|
||||
|
||||
using namespace std;
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MIN() {
|
||||
return std::numeric_limits<T>::min();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T MAX() {
|
||||
return std::numeric_limits<T>::max();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sc(auto&& x) {
|
||||
return static_cast<T>(x);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
[[nodiscard]] static T sz(auto&& x) {
|
||||
return static_cast<T>(x.size());
|
||||
}
|
||||
|
||||
#define prln(...) std::println(__VA_ARGS__)
|
||||
#define pr(...) std::print(__VA_ARGS__)
|
||||
|
||||
#ifdef LOCAL
|
||||
#define dbgln(...) std::println(__VA_ARGS__)
|
||||
#define dbg(...) std::print(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
inline static void NO() {
|
||||
prln("NO");
|
||||
}
|
||||
|
||||
inline static void YES() {
|
||||
prln("YES");
|
||||
}
|
||||
|
||||
using ll = long long;
|
||||
using ld = long double;
|
||||
template <typename T>
|
||||
using ve = std::vector<T>;
|
||||
template <typename T, size_t N>
|
||||
using ar = std::array<T, N>;
|
||||
template <typename T1, typename T2>
|
||||
using pa = std::pair<T1, T2>;
|
||||
template <typename... Ts>
|
||||
using tu = std::tuple<Ts...>;
|
||||
template <typename... Ts>
|
||||
using dq = std::deque<Ts...>;
|
||||
template <typename... Ts>
|
||||
using qu = std::queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using pq = std::priority_queue<Ts...>;
|
||||
template <typename... Ts>
|
||||
using st = std::stack<Ts...>;
|
||||
auto lb = [](auto... args) {
|
||||
return std::lower_bound(args...);
|
||||
};
|
||||
auto ub = [](auto... args) {
|
||||
return std::upper_bound(args...);
|
||||
};
|
||||
|
||||
#define ff first
|
||||
#define ss second
|
||||
#define eb emplace_back
|
||||
#define pb push_back
|
||||
#define all(x) (x).begin(), (x).end()
|
||||
#define rall(x) (x).rbegin(), (x).rend()
|
||||
// }}}
|
||||
|
||||
void solve() {
|
||||
string s;
|
||||
cin >> s;
|
||||
|
||||
int ans = 0;
|
||||
int as = s[0] == 'A', bs = s[0] == 'B';
|
||||
for (int i = 1; i < sz<int>(s); ++i) {
|
||||
if (s[i] == 'B') {
|
||||
ans += as;
|
||||
if (s[i - 1] != 'B')
|
||||
bs = 0;
|
||||
for (int j = i - as; j <= i; ++j)
|
||||
s[j] = 'C';
|
||||
as = 0;
|
||||
}
|
||||
|
||||
as += s[i] == 'A';
|
||||
bs += s[i] == 'B';
|
||||
}
|
||||
|
||||
for (int i = 1; i < sz<int>(s); ++i) {
|
||||
ans += s[i] == 'A' && s[i - 1] == 'B';
|
||||
}
|
||||
prln("{}, {}", ans, s);
|
||||
}
|
||||
|
||||
int main() { // {{{
|
||||
cin.tie(nullptr)->sync_with_stdio(false);
|
||||
cin.exceptions(cin.failbit);
|
||||
|
||||
int t = 1;
|
||||
cin >> t;
|
||||
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
// }}}
|
||||
9
codeforces/898/g.in
Normal file
9
codeforces/898/g.in
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
8
|
||||
ABBA
|
||||
ABA
|
||||
BAABA
|
||||
ABB
|
||||
AAAAAAB
|
||||
BABA
|
||||
B
|
||||
AAA
|
||||
11
codeforces/898/g.out
Normal file
11
codeforces/898/g.out
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
1, CCCA
|
||||
1, CCA
|
||||
2, BCCCA
|
||||
1, CCC
|
||||
6, CCCCCCC
|
||||
1, BCCA
|
||||
0, B
|
||||
0, AAA
|
||||
|
||||
[code]: 0
|
||||
[time]: 13.6178 ms
|
||||
100
codeforces/898/h.cc
Normal file
100
codeforces/898/h.cc
Normal file
|
|
@ -0,0 +1,100 @@
|
|||
#include <bits/stdc++.h>
|
||||
using namespace std;
|
||||
|
||||
void YES() {
|
||||
cout << "YES\n";
|
||||
}
|
||||
void NO() {
|
||||
cout << "NO\n";
|
||||
}
|
||||
|
||||
void solve() {
|
||||
int n, a, b;
|
||||
cin >> n >> a >> b;
|
||||
vector<vector<int>> graph(n + 1);
|
||||
for (int i = 0; i < n; ++i) {
|
||||
int u, v;
|
||||
cin >> u >> v;
|
||||
graph[u].push_back(v);
|
||||
graph[v].push_back(u);
|
||||
}
|
||||
|
||||
vector<int> parent(n + 1, -1);
|
||||
vector<int> visited(n + 1, 0);
|
||||
int cycle_start = -1, cycle_end = -1;
|
||||
function<bool(int, int)> dfs_cycle = [&](int u, int par) {
|
||||
visited[u] = 1;
|
||||
for (int v : graph[u]) {
|
||||
if (v == par)
|
||||
continue;
|
||||
if (visited[v] == 1) {
|
||||
cycle_start = v;
|
||||
cycle_end = u;
|
||||
return true;
|
||||
}
|
||||
parent[v] = u;
|
||||
if (dfs_cycle(v, u))
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
};
|
||||
|
||||
dfs_cycle(1, -1);
|
||||
|
||||
vector<int> cycle_nodes;
|
||||
if (cycle_start != -1) {
|
||||
for (int u = cycle_end; u != cycle_start; u = parent[u]) {
|
||||
cycle_nodes.push_back(u);
|
||||
}
|
||||
cycle_nodes.push_back(cycle_start);
|
||||
}
|
||||
|
||||
unordered_set<int> cycle(cycle_nodes.begin(), cycle_nodes.end());
|
||||
|
||||
auto bfs_dist = [&](int start) -> vector<int> {
|
||||
vector<int> dist(n + 1, -1);
|
||||
queue<int> q;
|
||||
dist[start] = 0;
|
||||
q.push(start);
|
||||
while (!q.empty()) {
|
||||
int u = q.front();
|
||||
q.pop();
|
||||
for (int v : graph[u]) {
|
||||
if (dist[v] == -1) {
|
||||
dist[v] = dist[u] + 1;
|
||||
q.push(v);
|
||||
}
|
||||
}
|
||||
}
|
||||
return dist;
|
||||
};
|
||||
|
||||
vector<int> dist_a = bfs_dist(a);
|
||||
vector<int> dist_b = bfs_dist(b);
|
||||
|
||||
bool can_avoid = false;
|
||||
for (int node : cycle_nodes) {
|
||||
if (dist_b[node] < dist_a[node]) {
|
||||
can_avoid = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (can_avoid) {
|
||||
YES();
|
||||
} else {
|
||||
NO();
|
||||
}
|
||||
}
|
||||
|
||||
int main() {
|
||||
ios_base::sync_with_stdio(false);
|
||||
cin.tie(nullptr);
|
||||
|
||||
int t;
|
||||
cin >> t;
|
||||
while (t--) {
|
||||
solve();
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
43
codeforces/898/h.in
Normal file
43
codeforces/898/h.in
Normal file
|
|
@ -0,0 +1,43 @@
|
|||
6
|
||||
3 2 1
|
||||
2 1
|
||||
3 2
|
||||
1 3
|
||||
4 1 4
|
||||
1 4
|
||||
1 2
|
||||
1 3
|
||||
2 3
|
||||
4 1 2
|
||||
1 2
|
||||
2 3
|
||||
2 4
|
||||
3 4
|
||||
7 1 1
|
||||
4 1
|
||||
2 1
|
||||
5 3
|
||||
4 6
|
||||
4 2
|
||||
7 5
|
||||
3 4
|
||||
8 5 3
|
||||
8 3
|
||||
5 1
|
||||
2 6
|
||||
6 8
|
||||
1 2
|
||||
4 8
|
||||
5 7
|
||||
6 7
|
||||
10 6 1
|
||||
1 2
|
||||
4 3
|
||||
5 8
|
||||
7 8
|
||||
10 4
|
||||
1 9
|
||||
2 4
|
||||
8 1
|
||||
6 2
|
||||
3 1
|
||||
9
codeforces/898/h.out
Normal file
9
codeforces/898/h.out
Normal file
|
|
@ -0,0 +1,9 @@
|
|||
YES
|
||||
NO
|
||||
YES
|
||||
NO
|
||||
NO
|
||||
YES
|
||||
|
||||
[code]: 0
|
||||
[time]: 14.8737 ms
|
||||
Loading…
Add table
Add a link
Reference in a new issue