Submission #14300

#	Time	Username	Problem	Language	Result	Execution time	Memory
14300		jalmal	이상한 수열 (OJUZ10_bizarre)	C++98	100 / 100	14 ms	12996 KiB

bizarre

#include <stdio.h>

int N, M, inp[50005], chk[3000010], cnt, max;

int main()
{
    //freopen("input.txt", "r", stdin);

    int i, j;

    scanf("%d", &N);
    for(i = 1; i <= N; i ++)
    {
        scanf("%d", &inp[i]);
        if(inp[i] > max) max = inp[i];
        if(!chk[inp[i] + 1000000]) cnt ++, chk[inp[i] + 1000000] = 1;
    }
    scanf("%d", &M);

    if(M <= N)
    {
        printf("%d\n", inp[M]);
        return 0;
    }

    for(i = N+1; i <= M; i ++)
    {
        if(chk[cnt + 1000000])
        {
            printf("%d\n", cnt);
            return 0;
        }
        if(cnt > max)
        {
            printf("%d\n", cnt + M - i);
            return 0;
        }
        chk[cnt++ + 1000000] = 1;
    }

    printf("%d\n", --cnt);
    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 24 / 24
• Subtask 3: 30 / 30
• Subtask 4: 38 / 38