Source code for submission s1042

Go to diff to previous submission

#include <stdio.h>
#include <string.h>
#define false 0
#define true 1
 
char inv(char c){
	return c=='L' ? 'R' : 'L';
}
int main( int agrc, char * argv[] ) {
	char array[100002],c, remL, remR;
	int i, wood=10, ants, coo, remaining, pL, pR, timeL, timeR;
	int waitL, waitR;	
	int distL, distR;
	int max=-1, len;
	while( scanf("%d %d", &wood, &ants ) != EOF ) {
		waitL = false;
		waitR = false;
		pL = wood;
		pR = 0;		
		max = -1;
		memset(array, ' ', wood+1);
		for( i = 0 ; i < ants ; i++ ) {
        	scanf("%d %c", &coo, &c );
			array[coo] = c;
			if(coo > pR) pR = coo;
			if(coo < pL) pL = coo;  
		}
		remaining = ants;
		remL = 'L';
		remR = 'R';
		timeL = 0;
		timeR = wood;
		len = 0;
		while(timeL < wood) {
			if(array[timeL] == 'R'){
				max = wood-len;	
				break;
			}
			timeL++;
			len++;	
		}
		len = 0;
		while(timeR >= 0) {
			if(array[timeR] == 'L'){
				if(wood-len>max) max = wood-len;
				break;
			}
			timeR--;
			len++;	
		}
		distL = -1;
		distR = -1;
		while(remaining && pL <= pR) {
			if(waitL == false){
				while(array[pL] == ' ') pL++;
				if(array[pL] == remL){
					remaining--;
					array[pL] = ' ';
					distL = pL;
					pL++;		
				} else if(array[pL] == inv(remL)) {
					remL = inv(remL);
					if(waitR == false)
						waitL = true;
					waitR = false;
				}
			}
			if(waitR == false && remaining){
				while(array[pR] == ' ') pR--;
				if(array[pR] == remR){
					remaining--;
					array[pR] = ' ';
					distR = pR;
					pR--;
				} else if(array[pR] == inv(remR)){
					remR = inv(remR);
					if(waitL == false)
						waitR = true;
					waitL = false;
				}
			}
			/*for( i = 0 ; i < wood ; i++ )
				printf("%c", array[i]);
			printf(",  rem: %c %c,    p: %2d %2d,  wait: %d %d,  remaining: %d\n", remL, remR, pL, pR, waitL, waitR, remaining);*/
		}
		while(array[pL] == ' ') pL++;
		while(array[pR] == ' ') pR--;
 
		/*printf("%d and %d\n", distL, distR);
		distL = array[pL] == ' ' ? wood+123 : pL;
		distR = array[pL] == ' ' ? wood+123 : wood-pR;*/
		printf("The last ant will fall down in %d seconds - ", max);
		if(distR > -1 && distL > -1 && (distL == wood-distR)){
			printf("started at %d and %d.\n", distL, distR);		
		} else if(distR > -1 && (distL < wood-distR)){
			printf("started at %d.\n", distR);	
		} else {
			printf("started at %d.\n", distL);		
		}
	}	
 
	return 0;
}
 

Diff to submission s925

--- c4.s925.cteam043.ants.c.0.ants.c
+++ c4.s1042.cteam043.ants.c.0.ants.c
@@ -49,10 +49,13 @@
                         len++;  
                 }
-                while(remaining > 2 && pL < pR) {
+                distL = -1;
+                distR = -1;
+                while(remaining && pL <= pR) {
                         if(waitL == false){
                                 while(array[pL] == ' ') pL++;
                                 if(array[pL] == remL){
                                         remaining--;
-                                        array[pL] = ' ';        
+                                        array[pL] = ' ';
+                                        distL = pL;
                                         pL++;           
                                 } else if(array[pL] == inv(remL)) {
@@ -63,9 +66,10 @@
                                 }
                         }
-                        if(waitR == false && remaining > 2){
+                        if(waitR == false && remaining){
                                 while(array[pR] == ' ') pR--;
                                 if(array[pR] == remR){
                                         remaining--;
                                         array[pR] = ' ';
+                                        distR = pR;
                                         pR--;
                                 } else if(array[pR] == inv(remR)){
@@ -76,22 +80,21 @@
                                 }
                         }
-                        //for( i = 0 ; i < wood ; i++ )
-                        //      printf("%c", array[i]);
-                        //printf(",  rem: %c %c,    p: %2d %2d,  wait: %d %d,  remaining: %d\n", remL, remR, pL, pR, waitL, waitR, remaining);
+                        /*for( i = 0 ; i < wood ; i++ )
+                                printf("%c", array[i]);
+                        printf(",  rem: %c %c,    p: %2d %2d,  wait: %d %d,  remaining: %d\n", remL, remR, pL, pR, waitL, waitR, remaining);*/
                 }
                 while(array[pL] == ' ') pL++;
                 while(array[pR] == ' ') pR--;
-
+                                
+                /*printf("%d and %d\n", distL, distR);
                 distL = array[pL] == ' ' ? wood+123 : pL;
-                distR = array[pL] == ' ' ? wood+123 : wood-pR;
+                distR = array[pL] == ' ' ? wood+123 : wood-pR;*/
                 printf("The last ant will fall down in %d seconds - ", max);
-                if(distL > distR || pL == pR){
-                        printf("started at %d.\n", pL);         
-                }
-                if(distR > distL && pL != pR){
-                        printf("started at %d.\n", pR);         
-                }
-                if(distR == distL){
-                        printf("started at %d and %d.\n", pL, pR);              
+                if(distR > -1 && distL > -1 && (distL == wood-distR)){
+                        printf("started at %d and %d.\n", distL, distR);                
+                } else if(distR > -1 && (distL < wood-distR)){
+                        printf("started at %d.\n", distR);      
+                } else {
+                        printf("started at %d.\n", distL);              
                 }
         }