QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#434006#8784. Dwarfs' Bedtimeucup-team896#AC ✓19ms3836kbC++237.5kb2024-06-08 14:10:582024-06-08 14:11:00

Judging History

你现在查看的是最新测评结果

  • [2024-06-08 14:11:00]
  • 评测
  • 测评结果:AC
  • 用时:19ms
  • 内存:3836kb
  • [2024-06-08 14:10:58]
  • 提交

answer

/*  _              _     _                                             _       __      __      __   
   / \     _   _  | |_  | |__     ___    _ __   _    ___   _ __ ___   | | __  / /_    / /_    / /_  
  / _ \   | | | | | __| | '_ \   / _ \  | '__| (_)  / __| | '_ ` _ \  | |/ / | '_ \  | '_ \  | '_ \ 
 / ___ \  | |_| | | |_  | | | | | (_) | | |     _  | (__  | | | | | | |   <  | (_) | | (_) | | (_) |
/_/   \_\  \__,_|  \__| |_| |_|  \___/  |_|    (_)  \___| |_| |_| |_| |_|\_\  \___/   \___/   \___/ 
[Created Time:       2024-06-08 13:48:23]
[Last Modified Time: 2024-06-08 14:10:39] */
#pragma GCC optimize("Ofast", "unroll-loops")
#include<bits/stdc++.h>
#ifdef LOCAL
#include"debug.h"
#else
#define D(...) ((void)0)
#endif
using namespace std; using ll = long long;
#define For(i, j, k) for ( int i = (j) ; i <= (k) ; i++ )
#define Fol(i, j, k) for ( int i = (j) ; i >= (k) ; i-- )
namespace FastIO
{
// ------------------------------
// #define DISABLE_MMAP
// ------------------------------
#if ( defined(LOCAL) || defined(_WIN32) ) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifdef LOCAL
	inline char gc() { return getchar(); }
	inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
	inline constexpr int _READ_SIZE = 1 << 18;
	inline 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);
			if ( __builtin_expect(_read_ptr == _read_ptr_end, false) ) return EOF;
		}
		return *_read_ptr++;
	}
#else
#include<sys/mman.h>
	inline static const char *_read_ptr = (const char *)mmap(nullptr, 0x7fffffff, 1, 2, 0, 0);
	inline char gc() { return *_read_ptr++; }
#endif
	inline constexpr int _WRITE_SIZE = 1 << 18;
	inline 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 struct _auto_flush
	{
		inline ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); }
	}	_auto_flush;
#endif
	template < class T > inline constexpr bool _is_signed = numeric_limits < T >::is_signed;
	template < class T > inline constexpr bool _is_unsigned = numeric_limits < T >::is_integer && !_is_signed < T >;
#if __SIZEOF_LONG__ == 64
	template <> inline constexpr bool _is_signed < __int128 > = true;
	template <> inline constexpr bool _is_unsigned < __uint128_t > = true;
#endif
	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();
	}
	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 >
	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); }
	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 >
	inline void write(T x)
	{
		char buffer[numeric_limits < T >::digits10]; 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) { write(x), pc(32), print(y...); }
	template < class ...T > inline void print_cstr(const char *x, const T *...y) { write_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); }
}	using FastIO::read, FastIO::read_cstr, FastIO::write, FastIO::write_cstr, FastIO::println, FastIO::println_cstr;
int n, ans[109], t[109]; bool qwq[109]; set < pair < int, int > > q;
inline void o_(int x) { if ( x < 10 ) cout << 0; cout << x; }
inline void o(int x) { o_(x / 60), cout << ':', o_(x % 60); }
inline bool qry(int x, int y)
{
	cout << "at ", o(x), cout << " check " << y << endl;
	string z; cin >> z; return z == "asleep";
}
int main()
{
	cin >> n; For(i, 1, n) qwq[i] = qry(0, i), q.emplace(t[i] = 48, i);
	while ( q.size() )
	{
		auto [x, id] = *q.begin(); q.erase(q.begin());
		if ( t[id] )
		{
			if ( qry(x, id) == qwq[id] ) t[id] = min(720 - x, t[id] - 1), q.emplace(x + t[id], id);
			else q.emplace(x + 721 - t[id], id), t[id] = 0;
		}
		else
		{
			if ( x == 1440 ) ans[id] = qwq[id] ? 0 : 720;
			else if ( qry(x, id) == qwq[id] ) ans[id] = qwq[id] ? x : x - 720;
			else q.emplace(x + 1, id);
		}
	}
	cout << "answer"; For(i, 1, n) cout << '\n', o(ans[i]);
	return cout << endl, 0;
}
// 想上GM捏 想上GM捏 想上GM捏 想上GM捏 想上GM捏
// 伊娜可爱捏 伊娜贴贴捏

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3604kb

input:

2
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
asleep

output:

at 00:00 check 1
at 00:00 check 2
at 00:48 check 1
at 00:48 check 2
at 01:35 check 1
at 01:35 check 2
at 02:21 check 1
at 02:21 check 2
at 03:06 check 1
at 03:50 check 1
at 04:33 check 1
at 05:15 check 1
at 05:56 check 1
at 06:36 check 1
at 07:15 check 1
at 07:53 check 1
at 08:30 check 1
at 13:36 ch...

result:

ok n = 2, total = 30, max = 20

Test #2:

score: 0
Accepted
time: 1ms
memory: 3596kb

input:

1
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake

output:

at 00:00 check 1
at 00:48 check 1
at 01:35 check 1
at 02:21 check 1
at 03:06 check 1
at 03:50 check 1
at 04:33 check 1
at 05:15 check 1
at 05:56 check 1
at 06:36 check 1
at 07:15 check 1
at 07:53 check 1
at 08:30 check 1
at 09:06 check 1
at 09:41 check 1
at 10:15 check 1
at 10:48 check 1
at 11:20 ch...

result:

ok n = 1, total = 28, max = 28

Test #3:

score: 0
Accepted
time: 1ms
memory: 3640kb

input:

3
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
awake
a...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:48 check 1
at 00:48 check 2
at 00:48 check 3
at 01:35 check 1
at 01:35 check 2
at 01:35 check 3
at 02:21 check 1
at 02:21 check 2
at 02:21 check 3
at 03:06 check 1
at 03:06 check 2
at 03:06 check 3
at 03:50 check 1
at 03:50 check 2
at 03:50 ch...

result:

ok n = 3, total = 84, max = 28

Test #4:

score: 0
Accepted
time: 0ms
memory: 3828kb

input:

24
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awak...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 24, total = 692, max = 44

Test #5:

score: 0
Accepted
time: 0ms
memory: 3756kb

input:

24
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
asleep
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awak...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 24, total = 670, max = 43

Test #6:

score: 0
Accepted
time: 6ms
memory: 3832kb

input:

100
asleep
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
asleep
awake
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
awake
asleep
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
a...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3062, max = 49

Test #7:

score: 0
Accepted
time: 4ms
memory: 3584kb

input:

100
asleep
asleep
asleep
awake
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
awake
awake
asleep
asleep
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
asleep
awake
awake
awake
awake...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3019, max = 50

Test #8:

score: 0
Accepted
time: 6ms
memory: 3512kb

input:

100
awake
awake
awake
asleep
asleep
awake
awake
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
awake
awake
asleep
awake
asleep
awake
awake
awake
asleep
awake
...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3127, max = 50

Test #9:

score: 0
Accepted
time: 0ms
memory: 3836kb

input:

100
awake
awake
asleep
awake
asleep
awake
asleep
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
asleep
awake
awake
awake
awake
asleep
awake
awake
awake
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
awake
awake
awake
as...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3069, max = 50

Test #10:

score: 0
Accepted
time: 7ms
memory: 3828kb

input:

100
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
awake
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
awake
awake
asleep
awake
asleep
awake
awake
awake
asleep
awake
asleep
asleep
asleep
awake
...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2826, max = 50

Test #11:

score: 0
Accepted
time: 11ms
memory: 3812kb

input:

100
asleep
awake
awake
awake
asleep
asleep
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
asleep
awake
awake
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
awake
awake
asleep
awake
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2716, max = 50

Test #12:

score: 0
Accepted
time: 8ms
memory: 3556kb

input:

100
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
awake
asleep
awake
awake
asleep
awake
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
asleep
awake
asleep
awake
awake
awake
awake
awake
as...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3274, max = 50

Test #13:

score: 0
Accepted
time: 4ms
memory: 3520kb

input:

100
asleep
awake
awake
awake
asleep
awake
awake
asleep
asleep
awake
awake
asleep
awake
awake
awake
awake
asleep
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
awake
awake
asleep
aslee...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2997, max = 49

Test #14:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

100
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
aslee...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2986, max = 50

Test #15:

score: 0
Accepted
time: 10ms
memory: 3604kb

input:

100
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
awake
asleep
awake
awake
asleep
awake
awake
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
awake
awake
awake
asleep
asleep
awake
asleep
asleep
awake
awake
asleep
awake
awake
awake
awake
awake
awake
a...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2812, max = 50

Test #16:

score: 0
Accepted
time: 7ms
memory: 3532kb

input:

100
awake
asleep
awake
asleep
awake
awake
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
awake
awake
asleep
asleep
asleep
asleep
awake
awake
awake
asleep
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
awake
awake
awake
asleep
asleep
asleep
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3025, max = 50

Test #17:

score: 0
Accepted
time: 6ms
memory: 3600kb

input:

100
asleep
asleep
asleep
awake
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
asleep
awake
awake
awake
awake
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3167, max = 50

Test #18:

score: 0
Accepted
time: 19ms
memory: 3612kb

input:

100
awake
asleep
asleep
awake
awake
asleep
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
awake
awake
asleep
asleep
asleep
awake
awake
awake
asleep
asleep
awake
asleep
asleep
awake
awake
asleep
asleep
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2973, max = 50

Test #19:

score: 0
Accepted
time: 3ms
memory: 3592kb

input:

100
asleep
awake
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
asleep
awake
asleep
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
awake...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 2863, max = 50

Test #20:

score: 0
Accepted
time: 4ms
memory: 3532kb

input:

100
awake
awake
awake
asleep
asleep
awake
asleep
awake
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
asleep
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
asleep
awake
...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 100, total = 3173, max = 49

Test #21:

score: 0
Accepted
time: 0ms
memory: 3760kb

input:

98
asleep
asleep
awake
asleep
awake
awake
asleep
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
awake
asleep
asleep
awake
awake
awake
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awake
asleep
asleep
awake
awake
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
awake
asleep...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 98, total = 2772, max = 50

Test #22:

score: 0
Accepted
time: 5ms
memory: 3836kb

input:

99
asleep
asleep
asleep
awake
awake
awake
awake
awake
asleep
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awak...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 99, total = 2813, max = 50

Test #23:

score: 0
Accepted
time: 8ms
memory: 3528kb

input:

95
asleep
awake
awake
awake
asleep
asleep
asleep
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
awake
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
awake
asleep
awake
asleep
asleep
awake
awake
asleep
awake
asleep
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 95, total = 2975, max = 50

Test #24:

score: 0
Accepted
time: 10ms
memory: 3600kb

input:

93
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 93, total = 2935, max = 50

Test #25:

score: 0
Accepted
time: 2ms
memory: 3608kb

input:

93
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 93, total = 3108, max = 50

Test #26:

score: 0
Accepted
time: 10ms
memory: 3540kb

input:

97
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 97, total = 2551, max = 50

Test #27:

score: 0
Accepted
time: 4ms
memory: 3520kb

input:

95
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 95, total = 2964, max = 50

Test #28:

score: 0
Accepted
time: 2ms
memory: 3612kb

input:

97
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 97, total = 2965, max = 50

Test #29:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

96
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asl...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 96, total = 3010, max = 49

Test #30:

score: 0
Accepted
time: 0ms
memory: 3532kb

input:

92
awake
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
awake
awake
awake
asleep
asleep
awake
asleep
awake
awake
awake
asleep
awake
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
awake
awake
awake
a...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 92, total = 2731, max = 49

Test #31:

score: 0
Accepted
time: 4ms
memory: 3548kb

input:

95
awake
asleep
asleep
awake
awake
awake
asleep
awake
awake
awake
asleep
asleep
asleep
asleep
asleep
awake
awake
awake
awake
awake
awake
awake
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
awake
awake...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 95, total = 2620, max = 50

Test #32:

score: 0
Accepted
time: 13ms
memory: 3544kb

input:

99
awake
asleep
awake
awake
awake
awake
asleep
awake
awake
awake
awake
awake
awake
awake
awake
awake
asleep
awake
awake
awake
awake
awake
awake
asleep
awake
awake
awake
awake
asleep
awake
asleep
asleep
asleep
awake
awake
awake
awake
awake
asleep
awake
awake
asleep
awake
awake
asleep
awake
asleep
awa...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 99, total = 2787, max = 50

Test #33:

score: 0
Accepted
time: 6ms
memory: 3528kb

input:

96
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
awake
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
asle...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 96, total = 3429, max = 50

Test #34:

score: 0
Accepted
time: 0ms
memory: 3496kb

input:

97
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awake
asleep
asleep
asleep
awake
asleep
asleep
asleep
asleep
awake
awake
asleep
asleep
asleep
asleep
awake
asle...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 97, total = 2941, max = 50

Test #35:

score: 0
Accepted
time: 8ms
memory: 3576kb

input:

98
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
awake
asleep
asleep
awake
awake
asleep
asleep
asleep
asleep
asleep
asleep
awake
asleep
asleep
awake
asleep
awake
asleep
asleep
asleep
asleep
asleep...

output:

at 00:00 check 1
at 00:00 check 2
at 00:00 check 3
at 00:00 check 4
at 00:00 check 5
at 00:00 check 6
at 00:00 check 7
at 00:00 check 8
at 00:00 check 9
at 00:00 check 10
at 00:00 check 11
at 00:00 check 12
at 00:00 check 13
at 00:00 check 14
at 00:00 check 15
at 00:00 check 16
at 00:00 check 17
at ...

result:

ok n = 98, total = 3038, max = 49

Extra Test:

score: 0
Extra Test Passed