Ballot Analyzing Device

题目连接:

http://codeforces.com/gym/100269/attachments

Description

Election committee of Flatland is preparing for presidential elections. To minimize human factor in ballot

counting they decided to develop an automated Ballot Analyzing Device (BAD).

There are n candidates running for president. The ballot contains one square field for each candidate.

The voter must mark exactly one of the fields. If no field is marked or there are two or more marked

fields, the ballot is invalid. Each voter puts his/her ballot to a special scanner in BAD. The scanner

analyzes marks on the ballot and creates a special voting string of n characters: ‘X’ for marked field and

‘.’ for unmarked one. Now voting strings must be analyzed to get the report. Your task is to develop a

report generator for BAD.

Given voting strings for all ballots, your program must print the voting report. Candidates in the report

must be arranged in order of decreasing number of votes. If two candidates have the same number of

votes, they must have the same order as in a voting ballot. For each candidate calculate his/her result

in percent (if the candidate received p votes, the result in percent is 100p/m). The last line of the report

must indicate the percentage of the invalid ballots.

Input

The first line contains two integers n and m — the number of candidates and the number of ballots

(2 ≤ n ≤ 10; 1 ≤ m ≤ 1000). The following n lines contain last names of candidates. Each name is a

string of at most 100 English letters. There is no candidate named “Invalid”.

Then m lines follow, each of them contains one voting string.

Output

Print n+ 1 lines. First print results for candidates in percent. For each candidate print his/her last name

followed by a space and then his/her result in percent and a percent sign ‘%’. The last line must specify

the percentage of invalid ballots: a word “Invalid” followed by a space, the percentage of invalid ballots

and a percent sign.

Round all numbers to exactly two digits after the decimal point. If the number is exactly in the middle

of two representable numbers, output the greater one (e.g. output “12.35” for 12.345).

Sample Input

4 7

Loudy

Apples

Dogman

Miller

.X..

X...

....

..X.

..XX

..X.

..X.

Sample Output

Dogman 42.86%

Loudy 14.29%

Apples 14.29%

Miller 0.00%

Invalid 28.57%

Hint

题意

有m个人给n个人投票,每个人最多给一个人投票,如果投了两个人或者没有投票的话,那么这张票就算无效

然后让你按照票数高低排序,如果票数相同,就按照一开始的顺序输出

题解:

模拟题,当然也是水题

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1050;
char s[maxn];
pair<int,pair<int,string> > p[maxn];
int main()
{
freopen("bad.in","r",stdin);
freopen("bad.out","w",stdout);
int n,m;
scanf("%d%d",&n,&m);
int t=0;
for(int i=0;i<n;i++)
cin>>p[i].second.second,p[i].second.first=n-i;
for(int i=0;i<m;i++)
{
scanf("%s",s);
int flag = 0,cnt = 0;
for(int j=0;j<n;j++)
{
if(s[j]=='X')
flag=j,cnt++;
}
if(cnt==0||cnt>1)
t++;
else
p[flag].first++;
}
sort(p,p+n);
for(int i=n-1;i>=0;i--)
{
cout<<p[i].second.second<<" ";
printf("%.2f%%\n",100.0*p[i].first/m);
}
printf("Invalid %.2f%%\n",100.0*t/m);
}

Codeforces Gym 100269B Ballot Analyzing Device 模拟题的更多相关文章

  1. Codeforces Gym 100269A Arrangement of Contest 水题

    Problem A. Arrangement of Contest 题目连接: http://codeforces.com/gym/100269/attachments Description Lit ...

  2. Gym 100646 Problem C: LCR 模拟题

    Problem C: LCR 题目连接: http://codeforces.com/gym/100646/attachments Description LCR is a simple game f ...

  3. Educational Codeforces Round 2 A. Extract Numbers 模拟题

    A. Extract Numbers Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/600/pr ...

  4. Codeforces Beta Round #3 C. Tic-tac-toe 模拟题

    C. Tic-tac-toe 题目连接: http://www.codeforces.com/contest/3/problem/C Description Certainly, everyone i ...

  5. Codeforces Gym 100463B Music Mess Hash 逻辑题

    Music Mess Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100463/attachments ...

  6. codeforces Gym 100187H H. Mysterious Photos 水题

    H. Mysterious Photos Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100187/p ...

  7. codeforces Gym 100500H H. ICPC Quest 水题

    Problem H. ICPC QuestTime Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100500/a ...

  8. Codeforces Gym 100513F F. Ilya Muromets 水题

    F. Ilya Muromets Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100513/probl ...

  9. HNU 12845 Ballot Analyzing Device

    题目链接:http://acm.hnu.cn/online/?action=problem&type=show&id=12845&courseid=270 解题报告:有m个认给 ...

随机推荐

  1. CMD命令行下载文件

    远程执行sct的另一种姿势 cscript /b C:\Windows\System32\Printing_Admin_Scripts\zh-CN\pubprn.vbs 127.0.0.1 scrip ...

  2. CTF两个经典的文件包含案例

    案例一URL:http://120.24.86.145:8003/代码 <?php include "waf.php"; include "flag.php&quo ...

  3. core dump使用方法、设置、测试用例

    core dump使用方法.设置.测试用例 http://blog.csdn.net/liuzhuchen/article/details/21975227

  4. 【bzoj4695】最假女选手

    zcy的励志故事.jpg 傻逼zcy突然想立一个flag,写一个segment-tree-beats的题娱乐一下 于是他就想起了这道题. 他打算今晚写完 然后光是写他就写的头昏脑涨,还犯了询问写反这种 ...

  5. 【bzoj1026】windy数

    江泽OJ好,远离bzoj保平安. 仍然沿用之前的记忆化搜索的办法即可. #include<bits/stdc++.h> #define N 10010 using namespace st ...

  6. An In-Depth Look at the HBase Architecture

    https://www.mapr.com/blog/in-depth-look-hbase-architecture An In-Depth Look at the HBase Architectur ...

  7. 使用 Visual Studio 部署 .NET Core 应用

    可将 .NET Core 应用程序部署为依赖框架的部署或独立部署,前者包含应用程序二进制文件,但依赖目标系统上存在的 .NET Core,而后者同时包含应用程序和 .NET Core 二进制文件. 有 ...

  8. Nginx事件管理机制-epoll

    epoll的最大好处在于他不会随着被监控描述符的数目的增长而导致效率极致下降. select是遍历扫描来判断每个描述符是否有事件发生,当监控的描述付越多时,时间消耗就越多,并且由于系统的限制selec ...

  9. 基于flask和百度AI接口实现前后端的语音交互

    话不多说,直接怼代码,有不懂的,可以留言 简单的实现,前后端的语音交互. import os from uuid import uuid4 from aip import AipSpeech from ...

  10. 一、python基础相关知识体系

    python基础 a. Python(解释型语言.弱类型语言)和其他语言的区别? 一.编译型语言:一次性,将全部的程序编译成二进制文件,然后在运行.(c,c++ ,go) 运行速度快.开发效率低 二. ...