QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#524379 | #4327. Šeširi | zesqwq | 0 | 16ms | 4080kb | C++23 | 7.4kb | 2024-08-19 16:45:09 | 2024-08-19 16:45:10 |
Judging History
answer
#pragma GCC optimize(3, "unroll-loops")
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T>
inline void chkmin(T &x, T y) { if (y < x) x = y; }
template<typename T>
inline void chkmax(T &x, T y) { if (y > x) x = y; }
namespace FastIO {
// ------------------------------
#define IN_HAS_NEG
#define OUT_HAS_NEG
#define CHK_EOF
#define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if (defined(LOCAL) || defined(_WIN32)) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include <sys/mman.h>
#endif
#ifdef LOCAL
inline char gc() { return getchar(); }
inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
INLINE_V constexpr int _READ_SIZE = 1 << 18;
INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr,
*_read_ptr_end = nullptr;
inline char gc() {
if (__builtin_expect(_read_ptr == _read_ptr_end, false)) {
_read_ptr = _read_buffer;
_read_ptr_end =
_read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
if (__builtin_expect(_read_ptr == _read_ptr_end, false)) return EOF;
#endif
}
return *_read_ptr++;
}
#else
INLINE_V static const char *_read_ptr =
(const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
inline char gc() { return *_read_ptr++; }
#endif
INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
inline void pc(char c) {
*_write_ptr++ = c;
if (__builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false)) {
fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
_write_ptr = _write_buffer;
}
}
INLINE_V struct _auto_flush {
~_auto_flush() {
fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
}
} _auto_flush;
#endif
#ifdef CHK_EOF
inline bool _isdigit(char c) { return (c & 16) && c != EOF; }
inline bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
inline bool _isdigit(char c) { return c & 16; }
inline bool _isgraph(char c) { return c > 32; }
#endif
template <class T>
INLINE_V constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <class T>
INLINE_V constexpr bool _is_signed = numeric_limits<T>::is_signed;
template <class T>
INLINE_V constexpr bool _is_unsigned = _is_integer<T> && !_is_signed<T>;
template <>
INLINE_V constexpr bool _is_integer<__int128> = true;
template <>
INLINE_V constexpr bool _is_integer<__uint128_t> = true;
template <>
INLINE_V constexpr bool _is_signed<__int128> = true;
template <>
INLINE_V constexpr bool _is_unsigned<__uint128_t> = true;
#undef INLINE_V
inline void read(char &c) {
do c = gc();
while (!_isgraph(c));
}
inline void read_cstr(char *s) {
char c = gc();
while (!_isgraph(c)) c = gc();
while (_isgraph(c)) *s++ = c, c = gc();
*s = 0;
}
inline void read(string &s) {
char c = gc();
s.clear();
while (!_isgraph(c)) c = gc();
while (_isgraph(c)) s.push_back(c), c = gc();
}
#ifdef IN_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void read(T &x) {
char c = gc();
bool f = true;
x = 0;
while (!_isdigit(c)) {
if (c == 45) f = false;
c = gc();
}
if (f)
while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
else
while (_isdigit(c)) x = x * 10 - (c & 15), c = gc();
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void read(T &x) {
char c = gc();
while (!_isdigit(c)) c = gc();
x = 0;
while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
}
inline void write(char c) { pc(c); }
inline void write_cstr(const char *s) {
while (*s) pc(*s++);
}
inline void write(const string &s) {
for (char c : s) pc(c);
}
#ifdef OUT_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void write(T x) {
char buffer[numeric_limits<T>::digits10 + 1];
int digits = 0;
if (x >= 0) do
buffer[digits++] = (x % 10) | 48, x /= 10;
while (x);
else {
pc(45);
do buffer[digits++] = -(x % 10) | 48, x /= 10;
while (x);
}
while (digits) pc(buffer[--digits]);
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void write(T x) {
char buffer[numeric_limits<T>::digits10 + 1];
int digits = 0;
do buffer[digits++] = (x % 10) | 48, x /= 10;
while (x);
while (digits) pc(buffer[--digits]);
}
template <int N>
struct _tuple_io_helper {
template <class... T>
static inline void _read(tuple<T...> &x) {
_tuple_io_helper<N - 1>::_read(x), read(get<N - 1>(x));
}
template <class... T>
static inline void _write(const tuple<T...> &x) {
_tuple_io_helper<N - 1>::_write(x), pc(32), write(get<N - 1>(x));
}
};
template <>
struct _tuple_io_helper<1> {
template <class... T>
static inline void _read(tuple<T...> &x) {
read(get<0>(x));
}
template <class... T>
static inline void _write(const tuple<T...> &x) {
write(get<0>(x));
}
};
template <class... T>
inline void read(tuple<T...> &x) {
_tuple_io_helper<sizeof...(T)>::_read(x);
}
template <class... T>
inline void write(const tuple<T...> &x) {
_tuple_io_helper<sizeof...(T)>::_write(x);
}
template <class T1, class T2>
inline void read(pair<T1, T2> &x) {
read(x.first), read(x.second);
}
template <class T1, class T2>
inline void write(const pair<T1, T2> &x) {
write(x.first), pc(32), write(x.second);
}
template <class T1, class... T2>
inline void read(T1 &x, T2 &...y) {
read(x), read(y...);
}
template <class... T>
inline void read_cstr(char *x, T *...y) {
read_cstr(x), read_cstr(y...);
}
template <class T1, class... T2>
inline void write(const T1 &x, const T2 &...y) {
write(x), write(y...);
}
template <class... T>
inline void write_cstr(const char *x, const T *...y) {
write_cstr(x), write_cstr(y...);
}
template <class T>
inline void print(const T &x) {
write(x);
}
inline void print_cstr(const char *x) { write_cstr(x); }
template <class T1, class... T2>
inline void print(const T1 &x, const T2 &...y) {
print(x), pc(32), print(y...);
}
template <class... T>
inline void print_cstr(const char *x, const T *...y) {
print_cstr(x), pc(32), print_cstr(y...);
}
inline void println() { pc(10); }
inline void println_cstr() { pc(10); }
template <class... T>
inline void println(const T &...x) {
print(x...), pc(10);
}
template <class... T>
inline void println_cstr(const T *...x) {
print_cstr(x...), pc(10);
}
} // namespace FastIO
using namespace FastIO;
template <typename T>
inline void clear(T &x) {
T y;
swap(x, y);
}
const int N = 19;
int n;
int main() {
read(n);
for (int i = 1; i <= n; i++) {
for (int j = 0; j < (1 << n - 1); j++) {
int p1 = __builtin_popcount(j & ((1 << i - 1) - 1));
int p2 = n - i - __builtin_popcount(j >> i);
if ((p1 ^ p2) & 1) pc('B');
else pc('C');
}
println();
}
return 0;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3484kb
input:
4
output:
BBCCCCBB CBCBBCBC BCCBBCCB CBBCBCCB
result:
wrong answer your plan fails on CCBB
Subtask #2:
score: 0
Wrong Answer
Test #2:
score: 0
Wrong Answer
time: 0ms
memory: 3844kb
input:
5
output:
CCBBBBCCBBCCCCBB BCBCCBCBCBCBBCBC CBBCCBBCBCCBBCCB BCCBCBBCBCCBCBBC CBBCBCCBBCCBCBBC
result:
wrong answer your plan fails on CCCBB
Subtask #3:
score: 0
Wrong Answer
Test #3:
score: 0
Wrong Answer
time: 0ms
memory: 3832kb
input:
6
output:
BBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBB CBCBBCBCBCBCCBCBBCBCCBCBCBCBBCBC BCCBBCCBCBBCCBBCCBBCCBBCBCCBBCCB CBBCBCCBCBBCBCCBBCCBCBBCBCCBCBBC BCCBCBBCCBBCBCCBBCCBCBBCCBBCBCCB CBBCBCCBBCCBCBBCBCCBCBBCCBBCBCCB
result:
wrong answer your plan fails on CCBBBB
Subtask #4:
score: 0
Wrong Answer
Test #4:
score: 0
Wrong Answer
time: 0ms
memory: 3600kb
input:
7
output:
CCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBB BCBCCBCBCBCBBCBCCBCBBCBCBCBCCBCBCBCBBCBCBCBCCBCBBCBCCBCBCBCBBCBC CBBCCBBCBCCBBCCBBCCBBCCBCBBCCBBCBCCBBCCBCBBCCBBCCBBCCBBCBCCBBCCB BCCBCBBCBCCBCBBCCBBCBCCBCBBCBCCBCBBCBCCBCBBCBCCBBCCBCBBCBCCBCBBC CBBCBCCBBCCBCBBCCBBCBCCBBCCBCBBCBCCBCBBC...
result:
wrong answer your plan fails on CCCBBBB
Subtask #5:
score: 0
Wrong Answer
Test #5:
score: 0
Wrong Answer
time: 0ms
memory: 3604kb
input:
8
output:
BBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBB CBCBBCBCBCBCCBCBBCBCCBCBCBCBBCBCBCBCCBCBCBCBBCBCCBCBBCBCBCBCCBCBBCBCCBCBCBCBBCBCCBCBBCBCBCBCCBCBCBCBBCBCBCBCCBCBBCBCCBCBCBCBBCBC BCCBBCCBCBBCCBBCCBBCCBBCBCCBBCCBCBBCCBBCBC...
result:
wrong answer your plan fails on CCBBBBBB
Subtask #6:
score: 0
Wrong Answer
Test #6:
score: 0
Wrong Answer
time: 0ms
memory: 3600kb
input:
9
output:
CCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBB BCBCCBCBCBCBBCBCCBCBBCBCBCBCCBCBCBCBBCBCBCB...
result:
wrong answer your plan fails on CCCBBBBBB
Subtask #7:
score: 0
Wrong Answer
Test #7:
score: 0
Wrong Answer
time: 0ms
memory: 3484kb
input:
10
output:
BBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBB...
result:
wrong answer your plan fails on CCBBBBBBBB
Subtask #8:
score: 0
Wrong Answer
Test #8:
score: 0
Wrong Answer
time: 0ms
memory: 3804kb
input:
11
output:
CCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCC...
result:
wrong answer your plan fails on CCCBBBBBBBB
Subtask #9:
score: 0
Wrong Answer
Test #9:
score: 0
Wrong Answer
time: 0ms
memory: 3536kb
input:
12
output:
BBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBB...
result:
wrong answer your plan fails on CCBBBBBBBBBB
Subtask #10:
score: 0
Wrong Answer
Test #10:
score: 0
Wrong Answer
time: 1ms
memory: 3596kb
input:
13
output:
CCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCC...
result:
wrong answer your plan fails on CCCBBBBBBBBBB
Subtask #11:
score: 0
Wrong Answer
Test #11:
score: 0
Wrong Answer
time: 1ms
memory: 3956kb
input:
14
output:
BBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBB...
result:
wrong answer your plan fails on CCBBBBBBBBBBBB
Subtask #12:
score: 0
Wrong Answer
Test #12:
score: 0
Wrong Answer
time: 2ms
memory: 3844kb
input:
15
output:
CCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCC...
result:
wrong answer your plan fails on CCCBBBBBBBBBBBB
Subtask #13:
score: 0
Wrong Answer
Test #13:
score: 0
Wrong Answer
time: 4ms
memory: 3828kb
input:
16
output:
BBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBB...
result:
wrong answer your plan fails on CCBBBBBBBBBBBBBB
Subtask #14:
score: 0
Wrong Answer
Test #14:
score: 0
Wrong Answer
time: 8ms
memory: 3856kb
input:
17
output:
CCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCC...
result:
wrong answer your plan fails on CCCBBBBBBBBBBBBBB
Subtask #15:
score: 0
Wrong Answer
Test #15:
score: 0
Wrong Answer
time: 16ms
memory: 4080kb
input:
18
output:
BBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCCCBBBBCCBBCCCCBBBBCCCCBBCCBBBBCCBBCCCCBBCCBB...
result:
wrong answer your plan fails on CCBBBBBBBBBBBBBBBB