2381880_wa.c

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <string.h>
int l, n, i, L[10000], t, mark[10000], ans;
char pos[10000][5], p;
void input()
{
	scanf("%d%d",&l,&n);
	p = 'l';ans = 0;
	memset(mark,0,sizeof(mark));
	for(i = 0; i < n; i++)
		scanf("%d%s",&L[i],&pos[i]);
	for(i = 0; i < n; i++)
	{
		if(mark[i])
			continue;
		if(pos[i][0]!=p)
		{
			p = pos[i][0];
			ans++;
		}
		t = l*100;
		while(i<n&&L[i]<=t)
		{
			if(p==pos[i][0])
			{
				mark[i] = 1;
				t -= L[i];
			}
			i++;
		}
		ans++;i--;
		p = (p=='l'?'r':'l');
	}
	printf("%d\n",ans);
}

int main()
{
	int c;

	scanf("%d",&c);
	while(c--)
		input();
	return 1;
}