oj.uz

Submission #14684

# Submission time Handle Problem Language Result Execution time Memory
14684 2015-06-03T12:08:02 Z atomzeno 이상한 수열 (OJUZ10_bizarre) C++
62 / 100
 14 ms 1864 KB 
#include<stdio.h>
#include<algorithm>
#define N 100002
int n,m,a[N],nn=1,b[N],mm;
int main(){
	int i,j;
	scanf("%d",&n);
	for(i=1;i<=n;i++){scanf("%d",&a[i]);}
	scanf("%d",&m);
	if(m<=n){
		printf("%d",a[m]);
	}
	else{
		m=m-n;
		std::sort(a+1,a+n+1);
		for(i=2;i<=n;i++){
			if(a[i-1]!=a[i]){
				nn++;
				b[nn]=a[i];
			}
		}
		b[n+1]=2100000000;
		int g;
		b[0]=-2100000000;
		for(i=1;i<=n+1;i++){
			if(b[i-1]<nn&&nn<=b[i]){
				g=i;
				break;
			}
		}
		nn+=(m-1);
		if(nn>=b[g]){
			printf("%d",b[g]);
		}
		else{
			printf("%d",nn);
		}
	}
}

Subtask #1
8.0 / 8.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
30.0 / 30.0

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

Subtask #4
0.0 / 38.0

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