oj.uz

Submission #14163

# Submission time Handle Problem Language Result Execution time Memory
14163 2015-05-02T19:31:01 Z pichulia 이상한 수열 (OJUZ10_bizarre) C++
62 / 100
 24 ms 25300 KB 
#include<stdio.h>
#define M 1000000
int n, m;
int a[3100099];
int s[3100000];
int main()
{
    int i, j, k, l;
    scanf("%d",&n);
    for(i=1;i<=n;i++){scanf("%d",&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<=m&& i<2*M+20;i++)
    {
        a[i]=cnt;
        s[cnt+M]++;
        if(s[cnt+M]==1)cnt++;
    }
    if(m<2*M+2)
    {
        printf("%d\n",a[m]);
    }
    else
    {
        int p,q;
        p = a[i-2];
        q = a[i-1];
        if(p==q)printf("%d\n",p);
        else
        {
            q+=(m-i)*(q-p);
            printf("%d\n",q);
        }
    }
 
}

Subtask #1
8.0 / 8.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
30.0 / 30.0

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

Subtask #4
0.0 / 38.0

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