Capture the FlagTime Limit:2 Seconds Memory Limit:65536 KB Special Judge
In computer security, Capture the Flag (CTF) is a computer security competition. CTF contests are usually designed to serve as an educational exercise to give participants experience in securing a machine, as well as conducting and reacting to the sort of attacks found in the real world. Reverse-engineering, network sniffing, protocol analysis, system administration, programming, and cryptanalysis are all skills which have been required by prior CTF contests at DEF CON. There are two main styles of capture the flag competitions: attack/defense and jeopardy.
In an attack/defense style competition, each team is given a machine (or a small network) to defend on an isolated network. Teams are scored on both their success in defending their assigned machine and on their success in attacking other team’s machines. Depending on the nature of the particular CTF game, teams may either be attempting to take an opponent’s flag from their machine or teams may be attempting to plant their own flag on their opponent’s machine.
Recently, an attack/defense style competition calledMCTFheld by Marjar University is coming, and there areNteams which participate in the competition. In the beginning, each team hasSpoints as initial score; during the competition, there are some checkpoints which will renew scores for all teams. The rules of the competition are as follows:
If a team has been attacked for a serviceP, they will loseN – 1points. The lost points will be split equally and be added to the team(s) which attacks successfully. For example, there are 4 teams and Team A has been attacked by Team B and Team C, so Team A will lose 3 points, while Team B and Team C each will get 1.5 points.If a team cannot maintain their service well, they will loseN – 1points, which will be split equally too and be added to the team(s) which maintains the service well.
The score will be calculated at the checkpoints and then all attacks will be re-calculated. Edward is the organizer of the competition and he needs to write a program to display the scoreboard so the teams can see their scores instantly. But he doesn’t know how to write. Please help him!
Input
There are multiple test cases. The first line of input contains an integerTindicating the number of test cases. For each test case:
The first line contains four integersN(2 <=N<= 100) – the number of teams,Q- the number of services (1 <=Q<= 10),S- the initial points (0 <=S<= 100000) andC- the number of checkpoints (1 <=C<= 100).
For each checkpoint, there are several parts:
The first line contains an integerA- the number of the successful attacks. ThenAlines follow and each line contains a message:[The No. of the attacker] [The No. of the defender] [The No. of the service]For example, "1 2 3" means the 1stteam attacks the 2ndteam in service 3 successfully. The No. of teams and services are indexed from 1. You should notice that duplicate messages are invalid because of the rules. Just ignore them.Then there areQlines and each line containsNintegers. Thejthnumber of theithline indicating thejthteam’s maintaining status of theithservice, where 1 means well and 0 means not well.Finally there is an integerU(0 <=U<= 100), which describing the number of the queries. The following line containsUintegers, which means Edward wants to know the score and the ranking of these teams.Output
For each queryL, output the score and the ranking of theLthteam. The relative error or absolute error of the score should be less than 10-5. The team with higher score gets higher rank; the teams with the same scores should have the same rank. It is guaranteed that the scores of any two teams are either the same or with a difference greater than 10-5.
Sample Input14 2 2500 501 1 1 11 1 1 141 2 3 421 2 13 2 11 1 1 11 1 1 141 2 3 411 2 21 1 1 11 1 1 041 2 3 400 0 0 00 0 0 041 2 3 401 1 1 11 1 1 121 4Sample Output2500.00000000 12500.00000000 12500.00000000 12500.00000000 12501.50000000 12497.00000000 42501.50000000 12500.00000000 32505.50000000 12495.00000000 42502.50000000 22497.00000000 32499.50000000 12489.00000000 42496.50000000 22491.00000000 32499.50000000 12491.00000000 3Hint
For C++ users, kindly usescanfto avoid TLE for huge inputs.
链接：?problemId=5527
题意：
n个队伍，q台服务器，s为初始分数，5次操作
每次操作中有A次攻击
每次攻击 a b ser，表示 a队攻击 b队，通过服务器ser。忽略重复出现 同样的 a b ser。
攻击完后，计算分数要把每台服务器上的攻击分开计算。被攻击的队伍-（n-1）分，把这n-1分 平分给攻击他的队伍。
然后是q行n列
表示 每台服务器上，，n支队伍有没有 维护好 各自领域。 把没维护好的 队伍扣n-1分，把扣的总分平分给 维护好的队伍。
然后一个U，询问U个队伍的 分数和排名，然后输出。 排序的时候注意精度，如 0.123451和0.123452 实际上不相等，但是精度为1e-5时，算是相等的
坦然接受生活给你的馈赠吧，不管是好的还是坏的。
