# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14114 | minchurl | 이상한 수열 (OJUZ10_bizarre) | C++98 | 13 ms | 8896 KiB |
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<stdio.h>
#define N 1000000
int chk[2*N+5],n,m,max,cnt;
FILE *in,*out;
int main(){
int i,x;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&x);
if(i==m){
printf("%d\n",x);
return 0;
}
if(chk[x+N]==1) continue;
chk[x+N]=1;
cnt++;
max=max>x?max:x;
}
scanf("%d",&m);
if(cnt>max){
printf("%d\n",cnt+m-n-1);
return 0;
}
while(1){
if(chk[N+cnt]==1 || i==m){
printf("%d\n",cnt);
return 0;
}
chk[N+cnt]=1;
cnt++;
# | 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... |