#include<stdio.h>
#include<vector>
using namespace std;
int sw,n;
long long int dap=2147483647000000000000LL,c;
void dfs(long long int num,vector<int>a,int n,long long int w)
{
int i,j;
if(w>=10000000) return;
if(n==-1)
{
if(num<w) num+=w*10;
if(num==0) num=w*10;
if(dap>num) dap=num;
return;
}
if(num+w>=dap) return;
if(n==1)
{
c=0;
for(i=1;i<=9;i++)
{
if((1<<i)&a[0])
{
c=c*10+i;
if(c<10 && 1&a[0]) c=c*10;
}
}
if(a[0]==1) c=10;
if(c>dap/w) return;
c*=w; c+=num;
if(c==0) c=w*10;
if(dap>c)
{
dap=c;
}
return;
}
for(i=0;i<=9;i++)
{
vector<int>s((i+n-1)/10+1);
sw=0;
for(j=0;j<n;j++)
{
s[(i+j)/10]|=a[j]&(1023-(1<<((i+j)%10)));
if(s[(i+j)/10]) sw=1;
}
if(i==0 && a[0]==0 && sw==0)
{
if(dap>num) dap=num;
break;
}
if(sw==0){dfs(i*w+num,s,-1,w); break;}
dfs(i*w+num,s,(i+n-1)/10+1,w*10);
}
}
int main()
{
int i;
scanf("%d",&n);
vector<int>a(n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
a[i]=(1<<a[i]);
}
dfs(0,a,n,1);
printf("%lld",dap);
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1236 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 11 |
Correct |
4 ms |
1236 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 20 |
Correct |
4 ms |
1236 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 22 |
Correct |
4 ms |
1236 KB |
Output is correct |
| 23 |
Correct |
4 ms |
1236 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 2 |
Correct |
24 ms |
1236 KB |
Output is correct |
| 3 |
Correct |
28 ms |
1236 KB |
Output is correct |
| 4 |
Correct |
16 ms |
1236 KB |
Output is correct |
| 5 |
Correct |
20 ms |
1236 KB |
Output is correct |
| 6 |
Correct |
12 ms |
1236 KB |
Output is correct |
| 7 |
Correct |
116 ms |
1776 KB |
Output is correct |
| 8 |
Correct |
76 ms |
1592 KB |
Output is correct |
| 9 |
Correct |
160 ms |
2016 KB |
Output is correct |
| 10 |
Correct |
156 ms |
2016 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 5 |
Correct |
132 ms |
1576 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 11 |
Correct |
300 ms |
2016 KB |
Output is correct |
| 12 |
Correct |
160 ms |
2016 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 14 |
Correct |
4 ms |
1236 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 23 |
Correct |
4 ms |
1236 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1236 KB |
Output is correct |
| 25 |
Correct |
4 ms |
1236 KB |
Output is correct |
| 26 |
Correct |
4 ms |
1236 KB |
Output is correct |
| 27 |
Correct |
32 ms |
1236 KB |
Output is correct |
| 28 |
Correct |
24 ms |
1236 KB |
Output is correct |
| 29 |
Correct |
16 ms |
1236 KB |
Output is correct |
| 30 |
Correct |
20 ms |
1236 KB |
Output is correct |
| 31 |
Correct |
12 ms |
1236 KB |
Output is correct |
| 32 |
Correct |
116 ms |
1776 KB |
Output is correct |
| 33 |
Correct |
76 ms |
1592 KB |
Output is correct |
| 34 |
Correct |
164 ms |
2016 KB |
Output is correct |
| 35 |
Correct |
160 ms |
2016 KB |
Output is correct |
| 36 |
Correct |
216 ms |
1800 KB |
Output is correct |
| 37 |
Correct |
288 ms |
2000 KB |
Output is correct |
| 38 |
Correct |
176 ms |
1680 KB |
Output is correct |
| 39 |
Correct |
300 ms |
2016 KB |
Output is correct |
| 40 |
Correct |
304 ms |
2016 KB |
Output is correct |
