cat id is missing from project $pid: ".print_r($project, true));
	}
}
function score_cmp($a, $b) {
	return (int)$b['jscore']['total'] - (int)$a['jscore']['total'];
}

/* Reindex array so the highest score is at index 0 */
foreach($cats as $cid=>$c) {
	uasort($projects_sorted[$cid], 'score_cmp');

	$n = array();
	$i = 0;
	foreach($projects_sorted[$cid] as $pid=>&$p) {
		$n[$i] = &$p;
		$i++;
	}
	$projects_sorted[$cid] = $n;
}

/* Desired number of projects at each index, adjusted for cusp teams */
$target_projects_at_cusp = array();
/* Actual number of projects at each inded */
$n_projects_at_cusp = array();
/* Medal distribution (even indexes), and the number of projects that are assined up to the previous index (odd indexes)
 *  actual number[odd index] - medal distribution[odd index] = number of projects to assign down to the next index */
$medal_distribution = array();

/* Sort out which projects get what */
foreach($cats as $cid=>$c) {
	$total_projects = count($projects_sorted[$cid]);

	debug("\n".$c['name']."- $total_projects projects \n");

	$n_projects_at_cusp[$cid] = array_fill(0, count($config['judge_divisional_distribution'])*2, 0);
	$target_projects_at_cusp[$cid] = array_fill(0, count($config['judge_divisional_distribution'])*2, 0);
	$medal_distribution[$cid] = array_fill(0, count($config['judge_divisional_distribution'])*2, 0);
	/* Build an array of fractions for each div award and cusp team 
	 * even indexes = div award (not rejudged)
	 * odd indexes = cusp team (rejudged) */

	$half_projects_per_cusp = (int)($config['projects_per_cusp'] / 2);
	$index = 0;
	foreach($config['judge_divisional_distribution'] as $c) {
		$c /= 100;
		$n = (int)round($c * $total_projects);
		$medal_distribution[$cid][$index] = $n;
		/* Each cusp has 3 parts:
		 * - top $config['projects_per_cusp']/2 projects that are assigned to [$index - 1] (unless $index=0)
		 * - middle $n - $config['projects_per_cusp'] that are assigned to [$index]
		 * - bottom $config['projects_per_cusp']/2 projects that are assigned to [$index + 1]
		 * We are not allowed to distribute more than $n projects, top and bottom are split
		 *  evenly (ties to bottom), the middle could be zero 
		 * By calculating the split this way, the CUSP judging teams can just assign 
		 *  half the projects to the div above, and half to the div below.  Although that will
		 *  change below */

		/* There is no cusp above gold (index == 0) so just remove the top cusp/2 projects completely */
		$top = ($index == 0) ? 0 : $half_projects_per_cusp;
		$bot = $half_projects_per_cusp;

		if($top + $bot > $n) {
			/* If there are more cusp projects for judging than actual projects in this cusp
			 * recalculate top/bot as a ratio of the projects that are available.
			 *  This either computes a 50/50 split, or a 0/100 if top==0, but it is written to
			 *  handle any ratio */
			$top = (int)($n * ($top / ($top + $bot) ));
			$bot = $n - $top;
			$mid = 0;
		} else {
			/* There are enough projects for a 3-way split, so assign mid whatever is left */
			$mid = $n - ($top + $bot);
		}

		/* Add top, mid, bot to the right project target counts */
		if($index > 0) 	$target_projects_at_cusp[$cid][$index - 1] += $top;
		$target_projects_at_cusp[$cid][$index] += $mid;
		$target_projects_at_cusp[$cid][$index + 1] += $bot;
		$index += 2;
	}
	/* Add another half to the projects at the last cusp so the HM-nothing cusp doesn't get a target 
	 * of just three projects, want it to be six */
	$target_projects_at_cusp[$cid][$index-1] += $half_projects_per_cusp;

	debug("CUSP: target project counts:\n");
	for($index=0; $index $target_n?\n");
				/* Div section */
				if($n_projects_at_cusp[$cid][$index] + $n_to_add > $target_n) {
					/* Won't fit */
					debug("CUSP         add to next index\n");
					$add_to_index = $index + 1;
					$force_change_index = true;
				} else {
					debug("CUSP         add to current index\n");
					$add_to_index = $index;
				}
			} else {
				/* Current index is a cusp team */
				$add_to_index = $index;
			}

			/* Add it */
			for($j = $p_start; $j <= $p_end; $j++) {
				$projects_sorted[$cid][$j]['cusp_index'] = $add_to_index;
			}
			$n_projects_at_cusp[$cid][$add_to_index] += $n_to_add;
			$total_n += $n_to_add;

			/* Adjust the next start and reset the score */
			$p_start = $project_index + 1;
			$current_jscore = -1;

			debug("CUSP:      cusp[{$cusp_sections[$index]}] now has {$n_projects_at_cusp[$cid][$index]}/{$target_n} projects\n");
			/* Stop adding to this index if it's now full */
			if($force_change_index || $n_projects_at_cusp[$cid][$index] >= $target_n) {
				break;
			}
		}
	}

	/* Calculate the up/down just for printing */
	for($index=0; $index&$a) {
		if($a['type'] == 'divisional' && in_array($cid, $a['categories'])) {
			$award = &$a;
			break;
		}
	}

	debug("Assign projects for CUSP category $cid:{$cats[$cid]['name']}\n");

	if($award === NULL) {
		print("Error, couldn't find divisional award");
		debug("   Error: Couldn't find divisional award.\n");
		exit();
	}
		
	/* Ensure it only has one categroy */
	if(count($award['categories']) != 1) {
		print("Error, turn on debug.");
		debug("   Error:Divisional Award has more than one category\n");
		exit();
	}

	debug("   Found divisional award {$award['id']}:{$award['name']}\n");
	/* Now iterate over the prizes find the jteam for each prize, and assign projects.
	 * Start at the last index above 'nothing' and work backwards.  The prizes_in_order
	 * are HM -> gold */
	$match_cusp_index = count($cusp_sections)-2;
	foreach($award['prizes_in_order'] as &$prize) {

		unset($jteam);
		$jteam = NULL;
		foreach($jteams as $jteam_id=>&$jt) {
			if($jt['prize_id'] == $prize['id']) {
				$jteam = &$jt;
				break;
			}
		}
		debug("   Processing prize {$prize['id']}:{$prize['name']}\n");

		if($jteam === NULL) {
			print("Coudln't find jteam");
			debug("   Couldn't find jteam for prize\n");
			exit();
		}

		debug("   Found jteam {$jteam['id']}:{$jteam['name']}\n");

		/* Delete projects on all cusp teams for $cid */
		$jteam['project_ids'] = array();

		/* Assign new projects */
		foreach($projects_sorted[$cid] as $index=>&$project) {
			if($project['cusp_index'] == $match_cusp_index) {
				$jteam['project_ids'][] = $project['pid'];
			}
		}
		debug("   Added projects: ".join(',', $jteam['project_ids'])."\n");

		/* Also record the number of cusp up projects (those that get this prize), all other projects
		 * get the next prize down */
		$up = $medal_distribution[$cid][$match_cusp_index];
		$down = $n_projects_at_cusp[$cid][$match_cusp_index] - $up;
		debug("   Award distribution up=$up, down=$down\n");
		if($up + $down != count($jteam['project_ids'])) {
			print("Error, turn on debug");
			debug("   Prize has $up up + $down down != ".count($jteam['project_ids'])." project ids which were added\n");
			exit();
		}

		$jteam['cusp_n_up'] = $up;

		/* Increment to next cusp index */
		$match_cusp_index -= 2;

		jteam_save($mysqli, $jteam);
	}

	form_ajax_response(array('status'=>0));
	exit();
}


$page_id = 'c_judge_score_summary';
$help = '
Judging Scores Summary';
sfiab_page_begin($u, "Judging Scores Summary", $page_id, $help);
?>


 




	
Using the following medal distributions:
	


		
: %
		
	

	
Choose a category below, review the Cusp projects, then assign the projects to Cusp judging teams.
	


	

		

		

$c) { ?>
				


		
		

$c) {
			$current_section = -1;
			$x = 0;
?>
			



			
 Medal Allocations:
			


				
:  project(s)
		
			

			&$project) { 
				$x++;
				if($current_section != $project['cusp_index']) { 
					$index = $project['cusp_index'];
					$current_section = $index; ?>
					

			

				

				
Rank
				
Number
				
Project
				
Sci
				
Org
				
Comm
				
Total
				
			

Assign $up {$plist[($index-1)/2]}, $down {$plist[($index+1)/2]}");
						
					}

					if($project['cusp_index'] < count($cusp_sections)-1) {
						print(" - target: {$n_projects_at_cusp[$cid][$index]} / {$target_projects_at_cusp[$cid][$index]} project(s)");
					} 
					
					
					?>