제출 #13960

#제출 시각아이디문제언어결과실행 시간메모리
13960kriii이상한 수열 (OJUZ10_bizarre)C++14
0 / 100
676 ms65536 KiB
#include <stdio.h>
#include <set>
using namespace std;

set<int> S;
int N,B[2000000];

int main()
{
	scanf ("%d",&N);
	for (int i=0;i<N;i++) scanf ("%d",&B[i]), S.insert(B[i]);
	for (int i=N;i<2000000;i++){
		int u = S.size();
		B[i] = u;
		S.insert(u);
	}

	int M,A;
	scanf ("%d",&M); M--;
	if (M < 2000000) A = B[M];
	else A = B[1999999] + (M - 1999999) * (B[1999999] - B[1999998]);

	printf ("%d\n",A);

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...