| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 41200 |
2018-02-13T21:55:58 Z |
IvanC |
Sequence (BOI14_sequence) |
C++14 |
|
1000 ms |
876 KB |
#include <bits/stdc++.h>
#pragma GCC optimize ("unroll-loops")
using namespace std;
const int MAXN = 1e5 + 10;
int K,vetor[MAXN],freq[10][2];
int check(int ini){
for(int i = ini + K - 1,ptr = 1;ptr <= K;i--,ptr++){
if(i == 0 && vetor[K - ptr + 1] == 0) continue;
int copia = i;
while(copia != 0 && copia % 10 != vetor[K - ptr + 1]) copia /= 10;
if(copia == 0) return 0;
}
return 1;
}
void adiciona(int v){
while(v != 0){
freq[v % 10][0]++;
v /= 10;
}
}
void tira(int v){
while(v != 0){
freq[v % 10][0]--;
v /= 10;
}
}
int prune(){
for(int i = 0;i<=9;i++){
if(freq[i][0] < freq[i][1]) return 0;
}
return 0;
}
int main(){
cin >> K;
for(int i = 1;i<=K;i++){
cin >> vetor[i];
freq[vetor[i]][1]++;
}
if(K <= 1000){
for(int i = 1;i<=K;i++) adiciona(i);
for(int i = 1;i<=1000000;i++){
if(prune()){
adiciona(i+K);
tira(i);
}
if(check(i)){
cout << i << endl;
return 0;
}
adiciona(i+K);
tira(i);
}
}
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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
480 KB |
Output is correct |
| 3 |
Correct |
1 ms |
532 KB |
Output is correct |
| 4 |
Correct |
1 ms |
532 KB |
Output is correct |
| 5 |
Correct |
1 ms |
532 KB |
Output is correct |
| 6 |
Correct |
1 ms |
532 KB |
Output is correct |
| 7 |
Correct |
2 ms |
532 KB |
Output is correct |
| 8 |
Correct |
8 ms |
532 KB |
Output is correct |
| 9 |
Correct |
1 ms |
548 KB |
Output is correct |
| 10 |
Correct |
2 ms |
548 KB |
Output is correct |
| 11 |
Correct |
2 ms |
576 KB |
Output is correct |
| 12 |
Correct |
2 ms |
576 KB |
Output is correct |
| 13 |
Correct |
1 ms |
576 KB |
Output is correct |
| 14 |
Correct |
2 ms |
620 KB |
Output is correct |
| 15 |
Correct |
2 ms |
620 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
620 KB |
Output is correct |
| 2 |
Correct |
2 ms |
620 KB |
Output is correct |
| 3 |
Correct |
1 ms |
620 KB |
Output is correct |
| 4 |
Correct |
2 ms |
620 KB |
Output is correct |
| 5 |
Correct |
2 ms |
620 KB |
Output is correct |
| 6 |
Correct |
2 ms |
620 KB |
Output is correct |
| 7 |
Correct |
8 ms |
620 KB |
Output is correct |
| 8 |
Correct |
2 ms |
620 KB |
Output is correct |
| 9 |
Correct |
7 ms |
620 KB |
Output is correct |
| 10 |
Correct |
2 ms |
620 KB |
Output is correct |
| 11 |
Execution timed out |
1063 ms |
620 KB |
Time limit exceeded |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
620 KB |
Output is correct |
| 2 |
Correct |
4 ms |
620 KB |
Output is correct |
| 3 |
Correct |
3 ms |
620 KB |
Output is correct |
| 4 |
Correct |
4 ms |
620 KB |
Output is correct |
| 5 |
Correct |
6 ms |
620 KB |
Output is correct |
| 6 |
Correct |
3 ms |
620 KB |
Output is correct |
| 7 |
Correct |
15 ms |
876 KB |
Output is correct |
| 8 |
Correct |
11 ms |
876 KB |
Output is correct |
| 9 |
Correct |
21 ms |
876 KB |
Output is correct |
| 10 |
Correct |
20 ms |
876 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
876 KB |
Output is correct |
| 2 |
Correct |
2 ms |
876 KB |
Output is correct |
| 3 |
Correct |
1 ms |
876 KB |
Output is correct |
| 4 |
Correct |
1 ms |
876 KB |
Output is correct |
| 5 |
Execution timed out |
1069 ms |
876 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
