PAT_A 1041. Be Unique (20)
来源:互联网 发布:Linux解压rar 编辑:程序博客网 时间:2024/06/13 09:43
PAT_A 1041. Be Unique (20)
时间限制 100 ms 内存限制 65536 kBBeing unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1, 104]. The first one who bets on a unique number wins. For example, if there are 7 people betting on 5 31 5 88 67 88 17, then the second one who bets on 31 wins.Input Specification:Each input file contains one test case. Each case contains a line which begins with a positive integer N (<=10^5) and then followed by N bets. The numbers are separated by a space.Output Specification:For each test case, print the winning number in a line. If there is no winner, print "None" instead.Sample Input 1:7 5 31 5 88 67 88 17Sample Output 1:31Sample Input 2:5 888 666 666 888 888Sample Output 2:None
分析:
- 这题要求,找出最先出现的那个数,且出现一次。时间限制100ms,数据最大10^5,写完程序,担心超时,好比t1039。索性没有太多要求,一次AC。
- 方法:利用stl的map+vector完成,map用来完成重复数据计算,vector用来标识数据次序。最后按vector先后顺序,查找第一个map中value=1的key,即是。
code:
#include<iostream>#include<cstdio>#include<map>#include<vector>using namespace std;map<int,int> people;vector<int> seq;int main(){ freopen("in","r",stdin); int N,tmp; cin>>N; for(int i=0;i<N;i++) { cin>>tmp; if(people[tmp]==0) seq.push_back(tmp); people[tmp]++; } int i=0; int size=seq.size(); for(i=0;i<size;i++) { if(people[seq[i]]==1) { cout<<seq[i]<<endl; break; } } if(i==size) cout<<"None"<<endl; return 0;}
- AC
阅读全文
0 0
- PAT_A 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- 1041. Be Unique (20)
- Largest_Divisible_Subset
- 【C语言】【unix c】使用mmap将物理地址映射到进程的虚拟地址空间
- windwos下怎样配置redis服务器
- 假定CSomething是一个类,执行下面这些语句之后,内存里创建了____个CSomething对象。
- VMware vSphere Web Services SDK编程指南(八)- 8.1 认证和授权(相关对象)
- PAT_A 1041. Be Unique (20)
- 防止表单重复提交的三种方式
- C++面向对象模型初探
- python 经典100例(1-20)
- Java_多线程(创建/同步锁/等待唤醒机制/线程池/AsyncTask)
- 【C语言】【unix c】如何获得进程自己的PID
- 设计模式讲解与代码实践(十八)——中介者
- Ubuntu 16.04中将Unity启动栏移到底部或左側的教程
- 由于nvmini.sys引起蓝屏故障的处理方法