Problem Description
Acm——大学中四大竞赛之首——是极具挑战性的大学生竞赛形式。在一场acm比赛中,一个参赛队伍由三人组合而成,在最短的时间内做出尽可能多的题目而且要尽量少提交错误代码,这样才能得到更高的排名。现在让我们模拟一次不正规的acm比赛,假设在比赛开始后30分钟(这时已经有不少同学提交了代码,在rating中已经出现),到比赛结束前,又有新的同学提交(在rating中出现),同时rating在不断变化着,还有一些同学因为一些原因中途退出比赛(这时rating中自动删除,当然在正式比赛中不会有这种情况)。最后终于比赛结束啦,看看rating,都有谁能拿到奖牌呢?
Input
第一行一个整数n(n<=1000),代表开始比赛后30分钟已经有n个人提交了代码。从第二行到第n+1行每行包括名字name(小于20个字符),分数p(0<=p<=10000),同时行数代表目前排名情况,第二行的排名第一,第三行排名第二,依次类推。
从第n+2行起,每行有一个字符,是A,Q,C,S,O中的一个:
A代表新加进rating中一名同学,紧随其后是名字name(小于20个字符),分数p(0<=p<=10000);
Q代表有一名同学退出了,接着是他的名字name(小于20个字符);
C代表有一个人的分数发生的改变,接着是此人的名字name,他的分数加多少(分数只会增加不会减少);
S代表一次显示此时rating的请求,这时输出所有在rating中的同学名字及他们的分数。
O代表比赛结束。
Output
对每次请求,输出此时rating中的所有同学名字和对应分数,在比赛结束时输出金牌获得者(一名),银牌获得者(两名),铜牌获得者(三名)(测试数据保证此时有至少6名同学在rating上)。注意:有同学添加到rating中或者分数改变后,在rating中有和这名同学有相同的分数,那么这名同学排在最后一个与他有相同分数同学的后面。
Example Input
7cze 90qch 87zff 70shangcf 66zhaohq 50zhrq 46yah 20A pc 56Q zffC qch 4SA von 66O
Example Output
qch 91cze 90shangcf 66pc 56zhaohq 50zhrq 46yah 20#1 : qch#2 : cze shangcf von#3 : pc zhaohq zhrq
Hint
Author
第一次写出这么长的代码。。。150行。。。有重复的部分,自己不爱用函数所以比较长,还好一次ac,好激动的说,哈哈哈哈
001 | #include<stdio.h> |
002 | #include<stdlib.h> |
003 | #include<string.h> |
004 | struct team |
005 | { |
006 | char na[22]; |
007 | int num; |
008 | struct team *next; |
009 | }; |
010 | int main() |
011 | { |
012 | int i, n, d, t; |
013 | char c, b[22]; |
014 | struct team *head, *p, *tail, *q; |
015 | head = ( struct team *) malloc ( sizeof ( struct team)); |
016 | head -> next = NULL; |
017 | tail = head; |
018 | scanf ( "%d" , &n); |
019 | for (i = 0; i < n; i++) |
020 | { |
021 | p = ( struct team *) malloc ( sizeof ( struct team)); |
022 | scanf ( "%s %d" , p -> na, &p -> num); |
023 | p -> next = NULL; |
024 | tail -> next = p; |
025 | tail = p; |
026 | } |
027 | while ( scanf ( "%c" , &c) != EOF) |
028 | { |
029 | if (c == 'A' ) |
030 | { |
031 | p = ( struct team *) malloc ( sizeof ( struct team)); |
032 | scanf ( "%s %d" , p -> na, &p -> num); |
033 | tail -> next = p; |
034 | tail = p; |
035 | p -> next = NULL; |
036 | } |
037 | else if (c == 'Q' ) |
038 | { |
039 | scanf ( "%s" , b); |
040 | p = head; |
041 | while (p -> next != NULL) |
042 | { |
043 | q = p -> next; |
044 | if ( strcmp (b, q -> na) == 0) |
045 | { |
046 | p -> next = q -> next; |
047 | free (q); |
048 | break ; |
049 | } |
050 | else p = q; |
051 | } |
052 | } |
053 | else if (c == 'C' ) |
054 | { |
055 | scanf ( "%s%d" , b, &d); |
056 | p = head; |
057 | while (p -> next != NULL) |
058 | { |
059 | q = p -> next; |
060 | if ( strcmp (b, q -> na) == 0) |
061 | { |
062 | q -> num += d; |
063 | break ; |
064 | } |
065 | else p = q; |
066 | } |
067 | } |
068 | else if (c == 'S' ) |
069 | { |
070 | for (p = head -> next; p != NULL; p = p -> next) |
071 | { |
072 | for (q = p -> next; q != NULL; q = q -> next) |
073 | { |
074 | if (q -> num > p -> num) |
075 | { |
076 | t = q -> num; |
077 | q -> num = p -> num; |
078 | p -> num = t; |
079 | strcpy (b, p -> na); |
080 | strcpy (p -> na, q -> na); |
081 | strcpy (q -> na, b); |
082 | } |
083 | } |
084 | } |
085 | p = head -> next; |
086 | while (p != NULL) |
087 | { |
088 | printf ( "%s %d\n" , p -> na, p -> num); |
089 | p = p -> next; |
090 | } |
091 | } |
092 | else if (c == 'O' ) break ; |
093 | } |
094 | for (p = head -> next; p != NULL; p = p -> next) |
095 | { |
096 | for (q = p -> next; q != NULL; q = q -> next) |
097 | { |
098 | if (q -> num > p -> num) |
099 | { |
100 | t = q -> num; |
101 | q -> num = p -> num; |
102 | p -> num = t; |
103 | strcpy (b, p -> na); |
104 | strcpy (p -> na, q -> na); |
105 | strcpy (q -> na, b); |
106 | } |
107 | } |
108 | } |
109 | p = head -> next; |
110 | printf ( "#1 : %s" , p -> na); |
111 | while (p != NULL) |
112 | { |
113 | q = p -> next; |
114 | if (q -> num == p -> num) printf ( " %s" , q -> na); |
115 | else |
116 | { |
117 | printf ( "\n" ); |
118 | break ; |
119 | } |
120 | p = q; |
121 | } |
122 | printf ( "#2 : %s %s" , q -> na, q -> next -> na); |
123 | p = q -> next; |
124 | while (p != NULL) |
125 | { |
126 | q = p -> next; |
127 | if (q -> num == p -> num) printf ( " %s" , q -> na); |
128 | else |
129 | { |
130 | printf ( "\n" ); |
131 | break ; |
132 | } |
133 | p = q; |
134 | } |
135 | printf ( "#3 : %s %s %s" , q -> na, q -> next -> na, q -> next -> next -> na); |
136 | p = q -> next; |
137 | while (p != NULL) |
138 | { |
139 | q = p -> next; |
140 | if (q -> num == p -> num) printf ( " %s" , q -> na); |
141 | else |
142 | { |
143 | printf ( "\n" ); |
144 | break ; |
145 | } |
146 | p = q; |
147 | } |
148 | return 0; |
149 | } |
#include<stdlib.h>
#include<string.h>
struct team
{
char na[22];
int num;
struct team *next;
};
int main()
{
int i, n, d, t;
char c, b[22];
struct team *head, *p, *tail, *q;
head = (struct team *) malloc (sizeof(struct team));
head -> next = NULL;
tail = head;
scanf("%d", &n);
for(i = 0; i < n; i++)
{
p = (struct team *) malloc (sizeof(struct team));
scanf("%s %d", p -> na, &p -> num);
p -> next = NULL;
tail -> next = p;
tail = p;
}
while(scanf("%c", &c) != EOF)
{
if(c == 'A')
{
p = (struct team *) malloc (sizeof(struct team));
scanf("%s %d", p -> na, &p -> num);
tail -> next = p;
tail = p;
p -> next = NULL;
}
else if(c == 'Q')
{
scanf("%s", b);
p = head;
while(p -> next != NULL)
{
q = p -> next;
if(strcmp(b, q -> na) == 0)
{
p -> next = q -> next;
free(q);
break;
}
else p = q;
}
}
else if(c == 'C')
{
scanf("%s%d", b, &d);
p = head;
while(p -> next != NULL)
{
q = p -> next;
if(strcmp(b, q -> na) == 0)
{
q -> num += d;
break;
}
else p = q;
}
}
else if(c == 'S')
{
for(p = head -> next; p != NULL; p = p -> next)
{
for(q = p -> next; q != NULL; q = q -> next)
{
if(q -> num > p -> num)
{
t = q -> num;
q -> num = p -> num;
p -> num = t;
strcpy(b, p -> na);
strcpy(p -> na, q -> na);
strcpy(q -> na, b);
}
}
}
p = head -> next;
while(p != NULL)
{
printf("%s %d\n", p -> na, p -> num);
p = p -> next;
}
}
else if(c == 'O') break;
}
for(p = head -> next; p != NULL; p = p -> next)
{
for(q = p -> next; q != NULL; q = q -> next)
{
if(q -> num > p -> num)
{
t = q -> num;
q -> num = p -> num;
p -> num = t;
strcpy(b, p -> na);
strcpy(p -> na, q -> na);
strcpy(q -> na, b);
}
}
}
p = head -> next;
printf("#1 : %s", p -> na);
while(p != NULL)
{
q = p -> next;
if(q -> num == p -> num) printf(" %s", q -> na);
else
{
printf("\n");
break;
}
p = q;
}
printf("#2 : %s %s", q -> na, q -> next -> na);
p = q -> next;
while(p != NULL)
{
q = p -> next;
if(q -> num == p -> num) printf(" %s", q -> na);
else
{
printf("\n");
break;
}
p = q;
}
printf("#3 : %s %s %s", q -> na, q -> next -> na, q -> next -> next -> na);
p = q -> next;
while(p != NULL)
{
q = p -> next;
if(q -> num == p -> num) printf(" %s", q -> na);
else
{
printf("\n");
break;
}
p = q;
}
return 0;
}