uva10142（未ac）

最新推荐文章于 2018-07-23 18:59:55 发布

@阿奇@

最新推荐文章于 2018-07-23 18:59:55 发布

阅读量211

点赞数

分类专栏： debug

本文链接：https://blog.csdn.net/qq_38140099/article/details/78373106

版权

debug 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <stdio.h>
#include <queue>
#include <string.h>
#include <vector>
#include <sstream>
#include <algorithm>

using namespace std;

vector<queue<int> > vote;
int high,low;
vector<string> namelist;
int candidate[25];
bool elimnate[25];
int candidate_num;
int cases;

void init()
{
    memset(elimnate,false,sizeof(elimnate));
    memset(candidate,0,sizeof(candidate));
    vote.clear();
    namelist.clear();

}
void read()
{
    cin>>candidate_num;
    string name;
    getline(cin, name);
    for(int i=0; i<candidate_num; i++)
    {
        getline(cin, name);
        namelist.push_back(name);
    }
    string ballot;
    getline(cin,ballot);
    while(ballot!="")
    {
        queue<int> q;
        stringstream ss(ballot);
        int id;
        while(ss>>id)
        {
            q.push(id);
        }

        vote.push_back(q);
        getline(cin,ballot);
    }
}
void compute()
{
    for(int i=0; i<vote.size(); i++)
    {
        int id=vote[i].front();
        if(!elimnate[id-1])
            candidate[id-1]++;
    }
    high=0;
    low=2000;
    for(int i=0; i<candidate_num; i++)
    {
        if(!elimnate[i])
        {
            high=max(high,candidate[i]);
            low=min(low,candidate[i]);
        }
    }
    while(high>=low)
    {
        if(2*high>vote.size()) return ;
        for(int i=0; i<candidate_num; i++)
            if(candidate[i]==low)
                elimnate[i]=true;
        for(int i=0; i<vote.size(); i++)
            if(elimnate[vote[i].front()-1])
            {
                while(elimnate[vote[i].front()-1])
                    vote[i].pop();
                candidate[vote[i].front()-1]++;
            }
        high=0;
        low=2000;
        for(int i=0; i<candidate_num; i++)
        {
            if(!elimnate[i])
            {
                high=max(high,candidate[i]);
                low=min(low,candidate[i]);
            }
        }
    }
}
void outresult()
{
    for(int i=0; i<candidate_num; i++)
        if(candidate[i]==high)
            cout<<namelist[i]<<endl;
}
int main()
{
    cin>>cases;
    int t=cases;
    while(cases--)
    {
        init();
        read();
        compute();
        outresult();
        cout<<t-cases<<endl;
        if(t!=cases) cout<<endl;
    }
    return 0;
}