oj.uz

Submission #14302

# Submission time Handle Problem Language Result Execution time Memory
14302 2015-05-11T14:31:00 Z pichulia 이상한 수열 (OJUZ10_bizarre) C++
62 / 100
 30 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+2;i++)if(s[i])cnt++;
    for(i=n+1;i<2*M+2;i++)
    {
        a[i]=cnt;
        s[cnt+M]++;
        if(s[cnt+M]==1)cnt++;
    }
    if(m<2*M+2)
    {
        printf("%d\n",a[m]);
    }
    else
    {
        long long int p,q;
        p = a[i-2];
        q = a[i-1];
        if(p==q)printf("%lld\n",p);
        else
        {
            q+=(m-i)*(q-p);
            printf("%lld\n",q);
        }
    }
  
}

Subtask #1
8.0 / 8.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 49520 KB Output is correct
2 Correct 18 ms 49520 KB Output is correct
3 Correct 29 ms 49520 KB Output is correct
4 Correct 15 ms 49520 KB Output is correct
5 Correct 20 ms 49520 KB Output is correct
6 Correct 23 ms 49520 KB Output is correct
7 Correct 18 ms 49520 KB Output is correct
8 Correct 26 ms 49520 KB Output is correct
9 Correct 20 ms 49520 KB Output is correct
10 Correct 15 ms 49520 KB Output is correct
11 Correct 30 ms 49520 KB Output is correct
12 Correct 20 ms 49520 KB Output is correct
13 Correct 21 ms 49520 KB Output is correct
14 Correct 22 ms 49520 KB Output is correct
15 Correct 18 ms 49520 KB Output is correct

Subtask #4
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 49520 KB Output is correct
2 Correct 26 ms 49520 KB Output is correct
3 Incorrect 23 ms 49520 KB Output isn't correct
4 Incorrect 22 ms 49520 KB Output isn't correct
5 Incorrect 12 ms 49520 KB Output isn't correct
6 Correct 20 ms 49520 KB Output is correct
7 Incorrect 23 ms 49520 KB Output isn't correct
8 Incorrect 20 ms 49520 KB Output isn't correct
9 Incorrect 24 ms 49520 KB Output isn't correct
10 Correct 17 ms 49520 KB Output is correct
11 Correct 19 ms 49520 KB Output is correct
12 Incorrect 19 ms 49520 KB Output isn't correct
13 Incorrect 20 ms 49520 KB Output isn't correct
14 Incorrect 27 ms 49520 KB Output isn't correct
15 Correct 19 ms 49520 KB Output is correct