oj.uz

Submission #14304

# Submission time Handle Problem Language Result Execution time Memory
14304 2015-05-11T14:35:24 Z pichulia 이상한 수열 (OJUZ10_bizarre) C++
100 / 100
 33 ms 49520 KB 
#include<stdio.h>
#define M 1000000
int n, m;
long long int a[3100099];
long long int s[3100000];
int main()
{
    int i, j, k, l;
    scanf("%d",&n);
    for(i=1;i<=n;i++){scanf("%lld",&a[i]);s[a[i]+M]++;}
    scanf("%d",&m);
    int cnt=0;
    for(i=0;i<2*M+20;i++)if(s[i])cnt++;
    for(i=n+1;i<2*M+20;i++)
    {
        a[i]=cnt;
        s[cnt+M]++;
        if(s[cnt+M]==1)cnt++;
    }
    if(m<2*M+20)
    {
        printf("%lld\n",a[m]);
    }
    else
    {
        long long int p,q;
        p = a[i-2];
        q = a[i-1];
        {
            q+=(m-i+1)*(q-p);
            printf("%lld\n",q);
        }
    }
  
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 49520 KB Output is correct
2 Correct 0 ms 49520 KB Output is correct
3 Correct 18 ms 49520 KB Output is correct
4 Correct 12 ms 49520 KB Output is correct
5 Correct 3 ms 49520 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 49520 KB Output is correct
2 Correct 13 ms 49520 KB Output is correct
3 Correct 16 ms 49520 KB Output is correct
4 Correct 14 ms 49520 KB Output is correct
5 Correct 13 ms 49520 KB Output is correct
6 Correct 18 ms 49520 KB Output is correct
7 Correct 18 ms 49520 KB Output is correct
8 Correct 17 ms 49520 KB Output is correct
9 Correct 17 ms 49520 KB Output is correct
10 Correct 19 ms 49520 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 49520 KB Output is correct
2 Correct 28 ms 49520 KB Output is correct
3 Correct 10 ms 49520 KB Output is correct
4 Correct 22 ms 49520 KB Output is correct
5 Correct 25 ms 49520 KB Output is correct
6 Correct 29 ms 49520 KB Output is correct
7 Correct 18 ms 49520 KB Output is correct
8 Correct 16 ms 49520 KB Output is correct
9 Correct 25 ms 49520 KB Output is correct
10 Correct 7 ms 49520 KB Output is correct
11 Correct 25 ms 49520 KB Output is correct
12 Correct 9 ms 49520 KB Output is correct
13 Correct 19 ms 49520 KB Output is correct
14 Correct 26 ms 49520 KB Output is correct
15 Correct 17 ms 49520 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 49520 KB Output is correct
2 Correct 18 ms 49520 KB Output is correct
3 Correct 13 ms 49520 KB Output is correct
4 Correct 14 ms 49520 KB Output is correct
5 Correct 27 ms 49520 KB Output is correct
6 Correct 19 ms 49520 KB Output is correct
7 Correct 12 ms 49520 KB Output is correct
8 Correct 33 ms 49520 KB Output is correct
9 Correct 19 ms 49520 KB Output is correct
10 Correct 15 ms 49520 KB Output is correct
11 Correct 14 ms 49520 KB Output is correct
12 Correct 20 ms 49520 KB Output is correct
13 Correct 17 ms 49520 KB Output is correct
14 Correct 28 ms 49520 KB Output is correct
15 Correct 25 ms 49520 KB Output is correct