Kayaks

#include <cstdio>
#include <cstring>

int findint(char* s){
	while(*s != 0x00 || *s == 'F'){
		if(*s <= '9' && *s > '0')
			return *s-'0';
		s++;
	}
	return -1;
}
int get_dist(char* s){
	int i=0;
	while(*s != 'F'){
		if(*s <= '9' && *s > '0')
			return i;
		s++;
		i++;
	}
	return -1;
}

int get_max(int dists[]){
	int i;
	int max = -1;
	for(i=1; i<=9; i++){
		if(dists[i] > max) max = dists[i];
	}
	return max;
}

#define extra 10
int main(){
	int w,h;
	int roska = scanf("%d %d", &h, &w);
	char* parks;
	char raw[h][w+20];
	int i;
	int boat;
	int boats = 9;
	char tmp[w+10];
	memset(tmp, 0, w+10);
	for (i=0; i<h; i++){
		roska = scanf("%s", tmp);
		boat = findint(tmp);
		if (boat == -1) continue;
		parks = strcpy( raw[boat], tmp);
	}
	//printf("%d", boats);
	roska++;
	parks++;
	//for (i=1; i<=boats; i++) printf("%s\n", raw[i]);	
	//boats are in numeric order------------------------------------

	int dists[boats+extra];
	memset(dists, 0, boats);
	for (i=1; i<=boats; i++){
		dists[i] = get_dist(raw[i]);
		//printf("%d\n", dists[i]);
	}
	//we have distances from the start for each boat -------------------------
	
	int row;
	int rank = 1;
	int max;
	int rankings[boats+10];
	memset(rankings, -1, boats);
	for(row=1; row<=boats; row++){
		max = get_max(dists);
		if (max == -1) break;
		for (boat=1; boat<=boats; boat++){
			if (dists[boat] == max){
				rankings[boat] = rank;
				dists[boat] = -1;
			}
		}
		rank++;
	}
	for (i=1; i<=boats; i++) printf("%d\n", rankings[i]);	
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED