oj.uz

Submission #14437

# Submission time Handle Problem Language Result Execution time Memory
14437 2015-05-15T08:32:41 Z ansol4328 이상한 수열 (OJUZ10_bizarre) C++
100 / 100
 13 ms 8972 KB 
#include<stdio.h>
#define X 1000000

int check[2000005];

int main()
{
    int n, m[50005], k, i, cnt=0, a;
    scanf("%d",&n);
    for(i=1 ; i<=n ; i++)
    {
         scanf("%d",&m[i]);
         if(check[m[i]+X]==0) cnt++, check[m[i]+X]=1;
    }
    scanf("%d",&k);
    if(n>=k) printf("%d",m[k]);
    else
    {
        a=n;
        while(a<=k-2)
        {
            if(check[cnt+X]==0)
            {
                check[cnt+X]=1;
                cnt++;
                if(cnt==X+1)
                {
                    cnt+=(k-2-a);
                    break;
                }
            }
            else break;
            a++;
        }
        printf("%d",cnt);
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8964 KB Output is correct
2 Correct 0 ms 8964 KB Output is correct
3 Correct 0 ms 8968 KB Output is correct
4 Correct 0 ms 8968 KB Output is correct
5 Correct 0 ms 8968 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8972 KB Output is correct
2 Correct 0 ms 8968 KB Output is correct
3 Correct 0 ms 8972 KB Output is correct
4 Correct 0 ms 8968 KB Output is correct
5 Correct 0 ms 8968 KB Output is correct
6 Correct 0 ms 8972 KB Output is correct
7 Correct 0 ms 8968 KB Output is correct
8 Correct 0 ms 8968 KB Output is correct
9 Correct 0 ms 8972 KB Output is correct
10 Correct 0 ms 8964 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8968 KB Output is correct
2 Correct 0 ms 8972 KB Output is correct
3 Correct 7 ms 8964 KB Output is correct
4 Correct 0 ms 8968 KB Output is correct
5 Correct 7 ms 8964 KB Output is correct
6 Correct 0 ms 8972 KB Output is correct
7 Correct 8 ms 8972 KB Output is correct
8 Correct 0 ms 8968 KB Output is correct
9 Correct 1 ms 8968 KB Output is correct
10 Correct 0 ms 8968 KB Output is correct
11 Correct 2 ms 8968 KB Output is correct
12 Correct 0 ms 8968 KB Output is correct
13 Correct 5 ms 8964 KB Output is correct
14 Correct 9 ms 8968 KB Output is correct
15 Correct 4 ms 8968 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8972 KB Output is correct
2 Correct 13 ms 8964 KB Output is correct
3 Correct 11 ms 8964 KB Output is correct
4 Correct 4 ms 8968 KB Output is correct
5 Correct 9 ms 8968 KB Output is correct
6 Correct 0 ms 8972 KB Output is correct
7 Correct 7 ms 8968 KB Output is correct
8 Correct 6 ms 8968 KB Output is correct
9 Correct 12 ms 8964 KB Output is correct
10 Correct 7 ms 8972 KB Output is correct
11 Correct 0 ms 8968 KB Output is correct
12 Correct 7 ms 8968 KB Output is correct
13 Correct 7 ms 8972 KB Output is correct
14 Correct 3 ms 8964 KB Output is correct
15 Correct 8 ms 8964 KB Output is correct