uva 10258 - Contest Scoreboard_contest scoreboard csdn-优快云博客

本文链接：https://blog.youkuaiyun.com/luckycoding/article/details/7598653

本文介绍了一个用于ACM竞赛的排名系统实现方法，通过C语言进行编程，使用结构体来存储队伍信息，包括解题数量、总用时及错误提交罚时等，并通过qsort函数对队伍进行排序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题意写个rank

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 105

struct list
{
	int num[20], time;
	bool flag[20];
	int count;
	bool submit;
	int x;
}s[MAX];

void initialize ( )
{
	for ( int i = 0; i < MAX; i++ )
	{
		for ( int j = 0; j < 20; j++ )
		{
			s[i].num[j] = 0;
			s[i].flag[j] = false;
		}
		s[i].time = 0;
		s[i].x = i;
		s[i].count = 0;
		s[i].submit = false;
	}
}

int cmp ( const void *a, const void *b )
{
	list *q, *p;
	q = ( list * )a;
	p = ( list * )b;
	if ( q->count > p->count )
		return -1;
	if ( q->count < p->count )
		return 1;
	if ( q->time > q->time )
		return 1;
	else
		return -1;
}

void solve ( )
{
	initialize ( );
	char str[1000];
	while ( gets ( str ) )
	{
		if ( strlen ( str ) < 2 )
			break;
		int troop, title, time;
		char state;
		sscanf ( str, "%d%d%d %c", &troop, &title, &time, &state );
		s[troop].submit = true;
		if ( state == 'C' && !s[troop].flag[title] )
		{
			s[troop].count++;
			s[troop].flag[title] = true;
			s[troop].time += time + s[troop].num[title];
		}
		if ( state == 'I' )
			s[troop].num[title] += 20;
	}
	qsort ( s, MAX, sizeof s[0], cmp );
	for ( int i = 0; i < MAX; i++ )
		if ( s[i].submit )
			printf ( "%d %d %d\n", s[i].x, s[i]. count, s[i].time );
}

int main ( )
{
	int t;
	scanf ( "%d\n\n", &t );
	while ( t-- )
	{
		solve ( );
		if ( t )
			puts ( "" );
	}
	return 0;
}