Submission #14331

#TimeUsernameProblemLanguageResultExecution timeMemory
14331Namnamseo이상한 수열 (OJUZ10_bizarre)C++98
0 / 100
41 ms5104 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...