QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#753567#8784. Dwarfs' Bedtimediandian2008AC ✓20ms3936kbC++142.2kb2024-11-16 13:12:112024-11-16 13:12:11

Judging History

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

  • [2024-11-16 13:12:11]
  • 评测
  • 测评结果:AC
  • 用时:20ms
  • 内存:3936kb
  • [2024-11-16 13:12:11]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int ans[105];
int n;
struct node
{
	int pos,val;
};
bool operator <(node a,node b)
{
	return a.val>b.val;
}
priority_queue<node>q;
void check(int s)
{
	string a;
	for(int i=1;i<=102;i++)
	{
		ans[i]=-1;
	}
	bool las[105];
	for(int i=1;i<=s;i++)
	{
	
	cout<<"at "<<"00:00 check "<<i<<endl;
	
	cin>>a;
	if(a[1]=='s')
	{
		las[i]=0;
	}
	else
	{
		las[i]=1;	
	}
}
	node lastim[105]; 
	memset(lastim,0,sizeof lastim);
	int now[105];
	bool vis[105]={0};
	memset(vis,0,sizeof vis);
	for(int i=48;i>=1;i--)
	{
		for(int j=1;j<=s;j++)
		{
		if(vis[j])
		{
			continue;
		}
		
		lastim[j].val+=i;
		lastim[j].pos=j;
		int hour=lastim[j].val/60;
		int m=lastim[j].val%60;
		if(hour>=12)
		{
			now[j]=i;
			vis[j]=1;
			lastim[j].val=lastim[j].val-now[j]+720;
			lastim[j].val%=1440;
			for(int k=1;k<=now[j];k++)
			{
				q.push((node){j,lastim[j].val+k});
			}
			continue;
		}
		else
		{
		
		cout<<"at "<<(int)(hour/10)<<hour%10<<":"<<(int)(m/10)<<m%10<<" check "<<j<<endl;
		cin>>a;
		if((a[1]=='s'&&las[j]==1)||(a[1]=='w'&&las[j]==0))
		{
			now[j]=i;
			vis[j]=1;
			lastim[j].val=lastim[j].val-now[j]+720;
			lastim[j].val%=1440;
			for(int k=1;k<=now[j];k++)
			{
				q.push((node){j,lastim[j].val+k});
			}
			continue;
		}
		}
	}
	}
	bool vis2[1004];
	memset(vis2,0,sizeof vis2);
	while(!q.empty())
	{
		node x=q.top();
		q.pop();
		int k=x.pos,v=x.val;
		if(vis2[k])
		continue;
		int hour=v/60;
		int m=v%60;
		if(hour==24)
		{
			if(las[k]==0)
			ans[k]=0;
			else
			if(las[k]==1)
			ans[k]=720;
			vis2[k]=1;
			continue;
		}
		cout<<"at "<<(int)(hour/10)<<hour%10<<":"<<(int)(m/10)<<m%10<<" check "<<k<<endl;
		cin>>a;
		if((a[1]=='s'&&las[k]==0&&ans[k]==-1))
		{
			ans[k]=(v)%1440;
			vis2[k]=1;
			continue;
			
		}
		if((a[1]=='w'&&las[k]==1&&ans[k]==-1))
		{
			vis2[k]=1;
			ans[k]=(v+720)%1440;
			continue;
		}
	}
	
}
signed main()
{
	int n;
	cin>>n;
	
		check(n);
	
	cout<<"answer"<<endl;
	for(int i=1;i<=n;i++)
	{
		int hour=ans[i]/60;
		int m=ans[i]%60;
		if(hour==24)
		hour=0;
		cout<<(int)(hour/10)<<hour%10<<":"<<(int)(m/10)<<m%10<<endl;
	}
	
} 

Details

Tip: Click on the bar to expand more detailed information

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: 3616kb

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

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 = 27, max = 27

Test #3:

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

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 = 81, max = 27

Test #4:

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

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 = 690, max = 44

Test #5:

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

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 = 668, max = 43

Test #6:

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

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: 3ms
memory: 3664kb

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: 0ms
memory: 3900kb

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: 14ms
memory: 3832kb

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 = 3067, max = 50

Test #10:

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

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 = 2825, max = 50

Test #11:

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

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 = 2713, max = 50

Test #12:

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

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 = 3271, max = 50

Test #13:

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

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 = 2994, max = 49

Test #14:

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

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 = 2985, max = 50

Test #15:

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

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: 10ms
memory: 3900kb

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 = 3024, max = 50

Test #17:

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

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 = 3166, max = 50

Test #18:

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

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 = 2971, max = 50

Test #19:

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

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 = 2862, max = 50

Test #20:

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

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 = 3172, max = 49

Test #21:

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

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 = 2769, max = 50

Test #22:

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

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 = 2812, max = 50

Test #23:

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

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: 3896kb

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 = 2934, max = 50

Test #25:

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

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: 0ms
memory: 3556kb

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: 20ms
memory: 3896kb

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 = 2963, max = 50

Test #28:

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

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 = 2964, max = 50

Test #29:

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

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 = 3007, max = 49

Test #30:

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

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: 0ms
memory: 3604kb

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: 6ms
memory: 3936kb

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 = 2786, max = 50

Test #33:

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

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 = 3427, max = 50

Test #34:

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

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 = 2936, max = 50

Test #35:

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

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 = 3034, max = 49

Extra Test:

score: 0
Extra Test Passed