답안 #14305

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
14305	2015-05-11T16:11:37 Z	gs14004	이상한 수열 (OJUZ10_bizarre)	C++14	38 / 100	15 ms	1472 KB

bizarre

#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;
    }
    m -= n;
    sort(a,a+n);
    a[n] = 2e9;
    n++;
    n = (int)(unique(a,a+n) - a);
    int k = (int)(lower_bound(a,a+n,n+1) - a);
    m--;
    n--;
    int dist = min(m,a[k] - n);
    printf("%d",n + dist);
}

Subtask #1

8.0 / 8.0

#	결과	실행 시간	메모리	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

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	1472 KB	Output isn't correct
2	Incorrect	0 ms	1472 KB	Output isn't 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
6	Correct	0 ms	1472 KB	Output is correct
7	Correct	0 ms	1472 KB	Output is correct
8	Incorrect	0 ms	1472 KB	Output isn't correct
9	Correct	0 ms	1472 KB	Output is correct
10	Correct	0 ms	1472 KB	Output is correct

Subtask #3

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	1472 KB	Output is correct
2	Correct	0 ms	1472 KB	Output is correct
3	Correct	9 ms	1472 KB	Output is correct
4	Correct	13 ms	1472 KB	Output is correct
5	Correct	7 ms	1472 KB	Output is correct
6	Correct	0 ms	1472 KB	Output is correct
7	Correct	9 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	Correct	3 ms	1472 KB	Output is correct
11	Correct	7 ms	1472 KB	Output is correct
12	Correct	2 ms	1472 KB	Output is correct
13	Correct	0 ms	1472 KB	Output is correct
14	Correct	14 ms	1472 KB	Output is correct
15	Correct	1 ms	1472 KB	Output is correct

Subtask #4

0.0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	14 ms	1472 KB	Output is correct
2	Correct	9 ms	1472 KB	Output is correct
3	Correct	11 ms	1472 KB	Output is correct
4	Correct	6 ms	1472 KB	Output is correct
5	Correct	0 ms	1472 KB	Output is correct
6	Correct	3 ms	1472 KB	Output is correct
7	Correct	15 ms	1472 KB	Output is correct
8	Correct	5 ms	1472 KB	Output is correct
9	Correct	9 ms	1472 KB	Output is correct
10	Correct	4 ms	1472 KB	Output is correct
11	Incorrect	10 ms	1472 KB	Output isn't correct
12	Correct	15 ms	1472 KB	Output is correct
13	Correct	0 ms	1472 KB	Output is correct
14	Correct	9 ms	1472 KB	Output is correct
15	Correct	0 ms	1472 KB	Output is correct