This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <set>
using namespace std;
set<int> s;
int n;
int data[50010];
int main()
{
scanf("%d",&n);
int i;
for(i=1;i<=n;++i) scanf("%d",data+i);
int m;
scanf("%d",&m);
if(m<=n){
for(i=1;i<=m;++i) s.insert(data[i]);
printf("%u\n",s.size());
return 0;
}
for(i=1;i<=n;++i) s.insert(data[i]);
m-=n;
for(i=1;m && i<=n;++i){
if(s.find(s.size()) != s.end()){
break;
}
--m;
s.insert(s.size());
}
printf("%d\n",s.size());
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |