oj.uz

Submission #14421

# Submission time Handle Problem Language Result Execution time Memory
14421 2015-05-14T08:18:39 Z hakgb11 이상한 수열 (OJUZ10_bizarre) C++
8 / 100
 15 ms 2112 KB 
#include <iostream>
#include <fstream>
#include <string>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <limits.h>

typedef long long ll;
using namespace std;

ll n, m, t;

int main()
{
#ifdef _CONSOLE
	freopen("input.txt", "r", stdin);
#endif
	ll n;
	scanf("%lld", &n);
	vector<ll> vi(n);
	for (ll i = 0; i < n; i++){
		scanf("%lld", &vi[i]);
	}
	scanf("%lld", &m);
	if (m <= n){
		printf("%lld\n", vi[m - 1]);
		return 0;
	}
	sort(vi.begin(), vi.end());
	vi.resize(unique(vi.begin(), vi.end()) - vi.begin());
	vector<ll>::iterator itor = lower_bound(vi.begin(), vi.end(), vi.size());
	
	if (itor == vi.end()){
		printf("%lld\n", (m - n) + (vi.size() - 1)); // 무한
	}
	else{
		if((*itor - vi.size() + 1) + n <= m) // 아닐때
			printf("%lld\n", *itor);
		else{
			printf("%lld\n", (m - n) + (vi.size() - 1));

		}
	}
}

Subtask #1
8.0 / 8.0

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

Subtask #2
0.0 / 24.0

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

Subtask #3
0.0 / 30.0

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

Subtask #4
0.0 / 38.0

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