OJ Board

Code: Select all

#include <iostream>
#include <cstdlib>
using namespace std;
//11034
int main()
{
	int cases;
	cin>>cases;
	int l,m,cl,cnt,s;
	char curSide;
	char side[16];
	while(cases-->0)
	{
		cin>>l;
		l*=100;
		cin>>m;
		cnt=0;
		curSide='l';
		s=0;
		
		while(m-->0)
		{
			cin>>cl>>side;
			if(side[0]!=curSide)
			{
				cnt++;
				curSide=side[0];
				s=cl;
			}
			else
			{
				if(s+cl>l)
				{
					cnt+=2;
					s=cl;
				}
				else
				{
					s+=cl;
				}
			}
		}
		if(s!=0)
			cnt++;
		cout<<cnt<<endl;
	}
}

Code: Select all

1
10 2
300 right
300 left

Code: Select all

2

Code: Select all

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

int main() {

	long n,m,l;
	vector< pair<long,string> > cars;

	cin >>n;
	while (n--) {
		cin >>l >>m;
		l*= 100;

		cars.clear();

		while (m--) {
			long len;
			string bank;

			cin >>len >>bank;

			cars.push_back(make_pair(len, bank));
		}

		string bank= "left";
		long ans= 0;
		while (!cars.empty()) {
			long suml= 0;
			for (int i= 0; i!=cars.size() && suml<l; ) {
				if (cars[i].second== bank && suml+cars[i].first<=l) {
					suml+= cars[i].first;
					cars.erase(cars.begin()+i);
				}
				else i++;
			}
			if (bank=="left") bank= "right";
			else bank= "left";

			ans++;
		}

		cout <<ans <<endl;
	}

	return 0;
}

Code: Select all

/*
Author : Muhammad Yeasin
University of Science & Technology Chittagong ( USTC )
e-mail : gigabyte_yeasin@yahoo.com	date   : 6:59 PM 12/12/2010	uva id : 11034 Ferry Loading IV  
Bangladesh
*/

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<iostream>
#include<fstream>
#include<numeric>
#include<string>
#include<vector>
#include<cstring>
#include<map>
#include<iterator>

#define pb push_back
#define file freopen("in.txt","r",stdin);

using namespace std;


queue<long int> weight;
queue<int> pos;



int before_go(int current){

	if(current!=pos.front ()){
		current=pos.front ();
	}
return current;
}

int go(int current){
			
	if(current==0)
		current=1;
	else
		current=0;
return current;

}


int load(long double limit,int current){


	long double sum=0;
	sum+=weight.front();
	int test=pos.front ();
	
	while((sum<=limit)&&(test==current)&&(!weight.empty())){
	
			weight.pop();
			pos.pop();
			
			if(!weight.empty ())
				sum+=weight.front();
			
	}
return 0;
}

int main(){

	int t,len;
	char ch[7];

	
	//file
	scanf("%d",&t);
	
	long double limit;
	long int n,var;
	
	long int count;

	int current;
	int pre,ct;

	while(t--){
		
		ct=0;
		ch[0]='\x0';
		limit=0;
		current=0;
		count=0;

		scanf("%Lf%ld",&limit,&n);

		limit=limit*100.0;

		int i;
		for(i=0;i<n;i++){

				scanf("%ld%s",&var,&ch);
				len=strlen(ch);
				ch[len]='\x0';
				if(!strcmp(ch,"left"))
					current=0;
				else 
					current=1;
				
				if(var<=limit)
					ct=1;

				weight.push(var);
				pos.push(current);

				ch[0]='\x0';
		}

		current=0;
		pre=0;

		
		
		if(ct>0)
			while(!weight.empty ()){

					
				
					current=before_go(current);
					
					if(pre!=current){
						count++;
						pre=current;
					}
					
					load(limit,current);

					
					if(!weight.empty ())
						current=go(current);

					if(pre!=current){
						count++;
						pre=current;
					}
			}
		
		if((pre==current)&&(ct>0))
			count++;

		printf("%ld\n",count);

		while((!weight.empty ())&&(!pos.empty ())){
			weight.pop();
			pos.pop();
		}
	}
return 0;
}

Code: Select all

AC

Code: Select all

Main.java:9: ')' expected
       BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)
                                                                                  ^
1 error

Code: Select all

AC

Code: Select all

1
1 4
100 right
100 right
100 right
100 left

Code: Select all

#include <bits/stdc++.h>

using namespace std;

int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int t;
    scanf("%d", &t);
    getchar();
    while(t--) {
        int l, m;
        scanf("%d %d", &l, &m);
        getchar();
        if(m == 0) {printf("0\n"); continue;}
        l *= 100;
        int left = 0, right = 0;
        for(int i = 0; i < m; i++) {
            int length;
            char direction[10];
            scanf("%d %s", &length, direction);
            getchar();
            if(direction[0] == 'l')
                left += length;
            else
                right += length;
        }
        int ans;
        if(left > right)
            ans = 2 * (int)ceil(left / ((double)l)) - 1;
        else
            ans = 2 * (int)ceil(right / ((double)l));
        if(ans <= 0) {
            if(left > right)
                ans = 1;
            else
                ans = 2;
        }
        else if(ans % 2 != 0) {
            int n = ((ans + 1) / 2) - 1;
            if(right - (n * l) > 0)
                ans++;
        }
        else if(ans % 2 == 0) {
            int n = ans / 2;
            if(left - (n * l) > 0)
                ans++;
        }
        printf("%d\n", ans);
    }
    return 0;
}