1880. Psych Up’s Eigenvalues
Time limit: 0.5 second
Memory limit: 64 MB
Memory limit: 64 MB
At one of the contests at the Petrozavodsk Training Camp, players of the Psych Up team quickly found the simple problem and Fedya sat at the computer. The solution was ready in five minutes. Without spending time for testing, Fedya submitted it and in a few seconds got Time Limit Exceeded.
Fedya crumpled the problem statement and left the room slamming the door behind him. Things were going the wrong way and he needed to wind down. On his way to the restroom Fedya heard a conversation of the contest authors. Pasha was discussing with his friend the solution of the problem for which Fedya had got TLE. Fedya could only discern the word “eigenvalues.”
Fedya thought about it and decided that he, for sure, had his eigenvalues. For example, the date of birth, the number of his apartment, the mark he had got at the latest exam, or the number of travels to contests. But they had a team contest, so what was their team’s eigenvalue? Of course, a number was a team’s eigenvalue if it was an eigenvalue for each of its players. With these joyful thoughts Fedya returned to the contest room.
Input
The input data consist of three blocks two lines each. The first line of each block contains the number
n of a player’s eigenvalues (1 ≤
n ≤ 4 000) . In the second line you are given
n distinct integers in ascending order, which are the eigenvalues. All the eigenvalues are positive integers not exceeding 10
9.
n of a player’s eigenvalues (1 ≤
n ≤ 4 000) . In the second line you are given
n distinct integers in ascending order, which are the eigenvalues. All the eigenvalues are positive integers not exceeding 10
9.
Output
Output the number of eigenvalues of the Psych Up team.
Sample
| input | output |
|---|---|
5 13 20 22 43 146 4 13 22 43 146 5 13 43 67 89 146 |
3 |
找三组数中相同的数的个数然后输出，好水好水的题啊
手动了快排，因为sort没用明白，就任性了一把…
#include<cstdio>#include<iostream>#include<algorithm>using namespace std;int a[1000001];void qs(int left,int right){ int i,j,t,k; if(left>right) return; k=a[left]; i=left; j=right; while(i!=j) { while(a[j]>=k&&i<j) j--; while(a[i]<=k&&i<j) i++; if(i<j) { t=a[i]; a[i]=a[j]; a[j]=t; } } a[left]=a[i]; a[i]=k; qs(left,i-1); qs(i+1,right);}int main(){ int n,ans=0,sum=0; for(int i=0;i<3;i++) { scanf("%d",&n); for(int j=ans;j<ans+n;j++) scanf("%d",&a[j]); ans+=n; } qs(0,ans-1); for(int i=0;i<ans;i++) { if(a[i]==a[i+1]&&a[i]==a[i+2]) sum++; } cout<<sum<<endl; return 0;}今天的文章URAL 1880. Psych Up’s Eigenvalues分享到此就结束了，感谢您的阅读。
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 举报，一经查实，本站将立刻删除。
如需转载请保留出处：https://bianchenghao.cn/10230.html
