POJ3282+模拟

模拟题

 /*
 模拟
 注意：相同一边的车有先后顺序！
 */
 #include<stdio.h>
 #include<string.h>
 #include<stdlib.h>
 #include<algorithm>
 #include<iostream>
 #include<queue>
 #include<map>
 #include<stack>
 #include<set>
 #include<math.h>
 using namespace std;
 typedef long long int64;
 //typedef __int64 int64;
 typedef pair<int64,int64> PII;
 #define MP(a,b) make_pair((a),(b))
 const int maxn = ;
 const int inf = 0x7fffffff;
 const double pi=acos(-1.0);
 const double eps = 1e-;

 struct Node{
     int len;
     int id;
 }a[ maxn ];

 bool Judge( int n ){
     bool f = true;
     for( int i=n;i>=;i-- ){
         if( a[i].id!= ){
             f = false;
             break;
         }
     }
     if( f==true ) return true;
     else return false;
 }

 int main(){
     int T;
     //freopen("in.txt","r",stdin);
     //freopen("out.txt","w",stdout);
     scanf("%d",&T);
     while( T-- ){
         int LL,n;
         scanf("%d%d",&LL,&n);
         LL *= ;
         char t[  ];
         for( int i=;i<=n;i++ ){
             scanf("%d %s",&a[i].len,t);
             if( t[]=='l' ) a[i].id = -;
             else a[i].id = ;
         }
         int ans = ;
         int cur = -;
         int L,R;
         L = R = ;
         while(  ){
             if( Judge( n )==true )
                 break;
             //judge
             cur = -;
             int sum = ;
             for( ;L<=n;L++ ){
                 if( a[L].id!=cur ) continue;
                 if( sum+a[L].len<=LL ){
                     sum += a[L].len;
                     a[ L ].id = ;
                 }
                 else break;
             }
             ans ++;
             if( Judge( n )==true )
                 break;
             //left
             sum = ;
             cur = ;
             for( ;R<=n;R++ ){
                 if( a[R].id!=cur ) continue;
                 if( sum+a[R].len<=LL ){
                     sum += a[R].len;
                     a[ R ].id = ;
                 }
                 else break;
             }
             ans++;
             //right
         }
         printf("%d\n",ans);
     }
     return ;
 }