2352.cpp

这是哈尔滨工业大学acmOJ的源代码

/* This Code is Submitted by wywcgs for Problem 2352 on 2006-09-14 at 21:14:02 */
#include <cstdio>

const int N = 51200;

int main()
{
	int T, bank[2][N], cn[2], hd[2];
	
	scanf("%d", &T);
	for(int t = 0; t < T; t++) {
		int l, n; scanf("%d %d", &l, &n);
		l *= 100; cn[0] = cn[1] = hd[0] = hd[1] = 0;
		for(int i = 0; i < n; i++) {
			int len; char d[16];
			scanf("%d %s", &len, d);
			int cd = (d[0] == 'r');
			bank[cd][cn[cd]++] = len;
		}
		int fn = 0, cd = 0;
		while(hd[0] != cn[0] || hd[1] != cn[1]) {
			int tl = 0;
			for(; hd[cd] != cn[cd]; hd[cd]++)
				if(tl+bank[cd][hd[cd]] > l) break;
				else tl += bank[cd][hd[cd]];
			fn++; cd = 1-cd;
		}
		printf("%d\n", fn);
	}
	
	return 0;
}