답안 #41197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
41197	2018-02-13T21:21:50 Z	IvanC	수열 (BOI14_sequence)	C++14	34 / 100	1000 ms	1924 KB

sequence

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int K,vetor[MAXN];
int check(int ini){
	for(int i = ini,ptr = 1;ptr <= K;i++,ptr++){
		if(i == 0 && vetor[ptr] == 0) continue;
		int copia = i;
		while(copia != 0 && copia % 10 != vetor[ptr]) copia /= 10;
		if(copia == 0) return 0;
	}
	return 1;
}
int main(){	
	cin >> K;
	for(int i = 1;i<=K;i++) cin >> vetor[i];
	if(K <= 1000){
		for(int i = 1;i<=1000000;i++){
			if(check(i)){
				cout << i << endl;
				return 0;
			}
		}
	}
	if(vetor[1] == 9){
		int geratriz = 8;
		while(true){
			if(check(geratriz + 1)){
				cout << geratriz + 1 << endl;
				return 0;
			}
			geratriz *= 10;
			geratriz += 8;
		}
	}
	else if(vetor[1] == 0){
		int ini = 1;
		while(true){
			if(check(ini)){
				cout << ini << endl;
				return 0;
			}
			ini *= 10;
		}
	}
	else{
		int ini = vetor[1];
		while(true){
			if(check(ini)){
				cout << ini << endl;
				return 0;
			}
			ini *= 10;
		}
	}
	return 0;
}

Subtask #1

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	600 KB	Output is correct
4	Correct	1 ms	600 KB	Output is correct
5	Correct	2 ms	620 KB	Output is correct
6	Correct	2 ms	656 KB	Output is correct
7	Correct	2 ms	672 KB	Output is correct
8	Correct	2 ms	732 KB	Output is correct
9	Correct	1 ms	732 KB	Output is correct
10	Correct	2 ms	732 KB	Output is correct
11	Correct	2 ms	732 KB	Output is correct
12	Correct	2 ms	732 KB	Output is correct
13	Correct	1 ms	732 KB	Output is correct
14	Correct	2 ms	768 KB	Output is correct
15	Correct	2 ms	776 KB	Output is correct

Subtask #2

0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	776 KB	Output is correct
2	Correct	1 ms	784 KB	Output is correct
3	Correct	2 ms	784 KB	Output is correct
4	Correct	1 ms	784 KB	Output is correct
5	Correct	1 ms	784 KB	Output is correct
6	Correct	1 ms	784 KB	Output is correct
7	Correct	2 ms	804 KB	Output is correct
8	Correct	2 ms	804 KB	Output is correct
9	Correct	2 ms	804 KB	Output is correct
10	Correct	1 ms	804 KB	Output is correct
11	Execution timed out	1072 ms	804 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #3

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	804 KB	Output is correct
2	Correct	4 ms	828 KB	Output is correct
3	Correct	4 ms	852 KB	Output is correct
4	Correct	4 ms	892 KB	Output is correct
5	Correct	4 ms	932 KB	Output is correct
6	Correct	5 ms	956 KB	Output is correct
7	Correct	15 ms	1356 KB	Output is correct
8	Correct	10 ms	1364 KB	Output is correct
9	Correct	22 ms	1724 KB	Output is correct
10	Correct	20 ms	1924 KB	Output is correct

Subtask #4

0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1924 KB	Output is correct
2	Correct	2 ms	1924 KB	Output is correct
3	Correct	2 ms	1924 KB	Output is correct
4	Correct	1 ms	1924 KB	Output is correct
5	Execution timed out	1058 ms	1924 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-