oj.uz

Submission #13968

# Submission time Handle Problem Language Result Execution time Memory
13968 2015-04-24T16:41:22 Z gs14004 이상한 수열 (OJUZ10_bizarre) C++14
8 / 100
 14 ms 1472 KB 
#include <cstdio>
#include <algorithm>
using namespace std;

int n,a[100005];

int main(){
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d",&a[i]);
    }
    int m;
    scanf("%d",&m);
    if(m <= n){
        printf("%d",a[m-1]);
        return 0;
    }
    sort(a,a+n);
    m -= n;
    n = (int)(unique(a,a+n) - a);
    int k = (int)(lower_bound(a,a+n,n) - a);
    if(k == n){
        printf("%d",m - n + 1);
        return 0;
    }
    m--;
    while (m && n < a[k]) {
        n++;
        m--;
    }
    printf("%d",n);
}

Subtask #1
8.0 / 8.0

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

Subtask #2
0.0 / 24.0

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

Subtask #3
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1472 KB Output is correct
2 Correct 0 ms 1472 KB Output is correct
3 Correct 0 ms 1472 KB Output is correct
4 Incorrect 0 ms 1472 KB Output isn't correct
5 Incorrect 13 ms 1472 KB Output isn't correct
6 Correct 0 ms 1472 KB Output is correct
7 Correct 0 ms 1472 KB Output is correct
8 Correct 0 ms 1472 KB Output is correct
9 Correct 0 ms 1472 KB Output is correct
10 Incorrect 14 ms 1472 KB Output isn't correct
11 Incorrect 0 ms 1472 KB Output isn't correct
12 Correct 0 ms 1472 KB Output is correct
13 Incorrect 0 ms 1472 KB Output isn't correct
14 Correct 0 ms 1472 KB Output is correct
15 Correct 0 ms 1472 KB Output is correct

Subtask #4
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1472 KB Output isn't correct
2 Correct 0 ms 1472 KB Output is correct
3 Incorrect 5 ms 1472 KB Output isn't correct
4 Correct 3 ms 1472 KB Output is correct
5 Correct 14 ms 1472 KB Output is correct
6 Correct 12 ms 1472 KB Output is correct
7 Incorrect 0 ms 1472 KB Output isn't correct
8 Incorrect 6 ms 1472 KB Output isn't correct
9 Incorrect 13 ms 1472 KB Output isn't correct
10 Incorrect 5 ms 1472 KB Output isn't correct
11 Correct 14 ms 1472 KB Output is correct
12 Correct 0 ms 1472 KB Output is correct
13 Correct 0 ms 1472 KB Output is correct
14 Incorrect 0 ms 1472 KB Output isn't correct
15 Incorrect 3 ms 1472 KB Output isn't correct