OJ Board

Code: Select all

/* @BEGIN_OF_SOURCE_CODE */
/* @JUDGE_ID: 45253TH 102 C++ "3'rd problem solved" */

#include <iostream>
using namespace std;

int main()
{	   
    char bin_comb[6][4] = {"021", "012", "201", "210", "102", "120"};
	unsigned long bins[3][3];
	unsigned long temp, no_shifts;
	char smallest;

	while(cin)
	{
		no_shifts = 0;
		smallest = 0;

		char i;
		for(i = 0; i < 9; i++)
			cin>>bins[i / 3][i % 3];
		
		for(i = 0; i < 3; i++)
		{
			temp = bins[i][0] + bins[i][1] + bins[i][2];
			no_shifts += temp - bins[i][bin_comb[0][i] - 48];
		}

		for(i = 1; i < 6; i++)
		{
			temp = 0;
			char k;
			for(k = 0; k < 3; k++)
			{
				temp += bins[k][0] + bins[k][1] + bins[k][2];
				temp = temp - bins[k][bin_comb[i][k] - 48];
			}

			if(temp < no_shifts)
			{
				no_shifts = temp;
				smallest = i;
			}
		}
		for(i = 0; i < 3; i++)
		{
			char out = (bin_comb[smallest][i] == 48)? 'B' : ((bin_comb[smallest][i] == 49)? 'G' : 'C');
			cout<<out;
		}
		cout<<" "<<no_shifts<<endl;
	}

	return 0;
}

/* @END_OF_SOURCE_CODE */

Code: Select all

/* @BEGIN_OF_SOURCE_CODE */
/* @JUDGE_ID: 45253TH 102 C++ "3'rd problem solved" */

#include <iostream>
using namespace std;

int main()
{
	//All possible 6 combinations where 0 - Brown, 1 - Green, 2 - Clear
	//In lexicographical order
	char bin_comb[6][4] = {"021", "012", "201", "210", "102", "120"};
	unsigned long bins[3][3];
	unsigned long temp, no_shifts;
	char smallest;

	while(cin)
	{
		//The minimum no. of shifts
		no_shifts = 0;
		//And its corresponding array loc in bin_comb
		smallest = 0;

		char i;
		for(i = 0; i < 9; i++)
			cin>>bins[i / 3][i % 3];
		
		//Setting bins as BCG - 021 (bin_comb[0], we calculate no. of shifts
		for(i = 0; i < 3; i++)
		{
			temp = bins[i][0] + bins[i][1] + bins[i][2];
			no_shifts += temp - bins[i][bin_comb[0][i] - 48];
		}
		
		//Running rest of the algo for rest 5 combinations
		for(i = 1; i < 6; i++)
		{
			temp = 0;
			char k;
			//Finding no of shifts for each combination
			for(k = 0; k < 3; k++)
			{
				temp += bins[k][0] + bins[k][1] + bins[k][2];
				temp = temp - bins[k][bin_comb[i][k] - 48];
			}

			//Setting new smallest no. of shifts if the combination leads to a lesser no. of shifts
			if(temp < no_shifts)
			{
				no_shifts = temp;
				smallest = i;
			}
		}
		//Printing the output remember 0 - Brown, 1 - Green, 2 - Clear
		for(i = 0; i < 3; i++)
		{
			char out = (bin_comb[smallest][i] == 48)? 'B' : ((bin_comb[smallest][i] == 49)? 'G' : 'C');
			cout<<out;
		}
		cout<<" "<<no_shifts<<endl;
	}

	return 0;
}

/* @END_OF_SOURCE_CODE */

Code: Select all

[quote]I am confused what is my fault?[/quote]

Code: Select all

#include <stdio.h>

int main(void)
{
	int b[3];
	int g[3];
	int c[3];

	int m, l = 321222, i = 0;

	char s[][4] = {"BCG", "BGC", "CBG", "CGB", "GBC", "GCB"};
	
	while(1)
	{
		scanf("%d %d %d %d %d %d %d %d %d", &b[0], &g[0], &c[0], &b[1], &g[1], &c[1], &b[2], &g[2], &c[2]);
		if (feof(stdin))
			break;
		
		m = b[1]+b[2]+c[0]+c[2]+g[0]+g[1];	
		if (l > m) { l = m; i = 0; }		
		m = b[1]+b[2]+g[0]+g[2]+c[0]+c[1];	
		if (l > m) { l = m; i = 1; }		
		m = c[1]+c[2]+b[0]+b[2]+g[0]+g[1];	
		if (l > m) { l = m; i = 2; }		
		m = c[1]+c[2]+g[0]+g[2]+b[0]+b[1];	
		if (l > m) { l = m; i = 3; }		
		m = g[1]+g[2]+b[0]+b[2]+c[0]+c[1];	
		if (l > m) { l = m; i = 4; }		
		m = g[1]+g[2]+c[0]+c[2]+b[0]+b[1];	
		if (l > m) { l = m; i = 5; }		

		printf("%s %d\n", s[i], l);
		l = 321222;
		i = 0;
	}	
}

Code: Select all

// Problem #102 Volume 2 - Ecological Bin Packing, UVa Online Judge
// Created by Roby on May 27, 2005

#include <stdio.h>
#include <malloc.h>
#include <string.h>

typedef struct data * ptr;
typedef struct data
{
 char bins[4];
 long total;
 ptr next;
};

ptr head, curr, tail;

void Create( void )
{
 head = curr = tail = NULL;
}

void Popall( void )
{
 if ( head != NULL )
 {  curr = head;
    while ( head != NULL )
    {  head = head->next;
       free( curr );
       curr = head;
    }
 }
}

void Insert( char bin1, char bin2, char bin3, long total )
{
 ptr p = NULL;
 curr = ( ptr ) malloc ( sizeof ( data ) );

 curr->bins[0] = bin1;
 curr->bins[1] = bin2;
 curr->bins[2] = bin3;
 curr->bins[3] = '\x0';
 curr->total = total;
 curr->next = NULL;

 if ( head == NULL )
    head = tail = curr;
 else
 {
    if ( ( curr->total ) < ( head->total ) )
    {
       curr->next = head;
       head = curr;
    }

    else if ( ( curr->total ) > ( tail->total ) )
    {
       tail->next = curr;
       tail = curr;
    }
    else
    {
       // find the suitable position
       for ( p = head; strcmp( curr->bins, p->next->bins ) > 0; p = p->next );

       // insert the curr
       curr->next = p->next;
       p->next = curr;
    }
 }
}

int main()
{
 #ifndef ONLINE_JUDGE
    freopen( "102.IN", "r", stdin );
    freopen( "102.OUT", "w", stdout );
 #endif

 long i = 0, j = 0, k = 0, total = 0, ctr = 0, ti = 0, tj = 0, tk = 0;
 long bin1[3] = { 0 }, bin2[3] = { 0 }, bin3[3] = { 0 };

 while ( scanf( "%ld%ld%ld%ld%ld%ld%ld%ld%ld", &bin1[0], &bin2[0], &bin3[0], &bin1[2], &bin2[2], &bin3[2], &bin1[1], &bin2[1], &bin3[1] ) == 9 )
 {
    Create();

    // permutate all the combination ( i realize it only 6 )
    for ( i = 0; i < 3; i++ )
       for ( j = 0; j < 3; j++ )
	  for ( k = 0; k < 3; k++ )
	     if ( j != i && k != i && k != j )
	     {  total = bin2[i] + bin3[i] + bin1[j] + bin3[j] + bin1[k] + bin2[k];
		switch ( i )
		{  case 0 : ti = i + 66; break;
		   case 1 : ti = i + 66; break;
		   case 2 : ti = i + 69; break;
		}
		switch ( j )
		{  case 0 : tj = j + 66; break;
		   case 1 : tj = j + 66; break;
		   case 2 : tj = j + 69; break;
		}
		switch ( k )
		{  case 0 : tk = k + 66; break;
		   case 1 : tk = k + 66; break;
		   case 2 : tk = k + 69; break;
		}
		Insert( ti, tj, tk, total );
	     }

    if ( ctr > 0 )
       printf( "\n" );

    printf( "%s %ld", head -> bins, head -> total ); ctr++;

    Popall();
 }

 return 0;
}