# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118707 | songc | Sequence (BOI14_sequence) | C++14 | 266 ms | 1408 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 <bits/stdc++.h>
#define INF 1234567890123456ll
using namespace std;
typedef long long LL;
int N;
int A[20][101010];
LL f(int lv, int k){
LL ans = INF;
bool tf=true;
for (int i=1; i<=k; i++) if (A[lv][i]) tf = false;
if (tf) return 0;
if (lv>15) return INF;
if (k == 1){
ans = 0;
for (int i=1; i<10; i++) if (A[lv][1] & (1<<i)){
ans = ans*10 + i;
if (A[lv][1] & 1) ans *= 10, A[lv][1] ^= 1;
}
if (A[lv][1] & 1) ans = 10;
return ans;
}
for (int i=0; i<10; i++){
for (int j=1; j<=k; j++) A[lv+1][j] = 0;
for (int j=1; j<=k; j++) A[lv+1][(i+j-1)/10+1] |= A[lv][j] & ~(1<<((i+j-1)%10));
LL ret = f(lv+1, (i+k-1)/10+1);
if (ret == INF) continue;
if (ret == 0 && i == 0) ans = min(ans, 10ll);
else ans = min(ans, ret*10+i);
}
return ans;
}
int main(){
scanf("%d", &N);
for (int i=1; i<=N; i++) {
scanf("%d", &A[0][i]);
A[0][i] = 1 << A[0][i];
}
printf("%lld\n", f(0, N));
return 0;
}
Compilation message (stderr)
# | 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... |