# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
11185 | gs13068 | Sequence (BOI14_sequence) | C++98 | 252 ms | 1980 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
#include<vector>
std::vector<int> a;
long long min;
void f(int w,std::vector<int> &x,int y,int z,int flag)
{
if(!w||x.size()==1)
{
int i,j=0;
long long k;
for(i=0;i<x.size();i++)j|=x[i];
if(j&1)
{
for(i=1;i<10;i++)if((j>>i)&1)break;
if(i==10)i=1;
k=i*10;
while(++i<10)if((j>>i)&1)k=k*10+i;
}
else
{
k=0;
for(i=1;i<10;i++)if((j>>i)&1)k=k*10+i;
}
if(flag&&!k)k=1;
if(k*z+y<min)min=k*z+y;
return;
}
int i,j,k;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |