oj.uz

Submission #421831

# Submission time Handle Problem Language Result Execution time Memory
421831 2021-06-09T12:46:44 Z rama_pang Sequence (BOI14_sequence) C++17
0 / 100
 1000 ms 1600 KB 
#include <bits/stdc++.h>
using namespace std;

using lint = long long;

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int N;
  cin >> N;
  vector<int> A(N);
  vector<int> S(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
    S[i] = 1 << A[i];
  }

  const auto CheckAns = [&](lint K) {
    for (int i = 0; i < N; i++) {
      auto str = to_string(K);
      if (count(begin(str), end(str), '0' + A[i]) == 0) {
        return false;
      }
      K += 1;
    }
    return true;
  };

  const lint INF = 1e17;
  const auto Solve = [&](const auto &self, vector<int> S, int lastNonZero, int depth) -> lint {
    if (depth >= 17) return INF;
    if (S.empty()) return lastNonZero ? 0 : 1;
    if (S.size() == 1) {
      if (S[0] == 0) return lastNonZero ? 0 : 1;
      int b = 0;
      lint res = 0;
      if (S[0] & 1) { // must have 0
        lint opt = 1;
        for (b = 1; b <= 9; b++) {
          if ((S[0] >> b) & 1) {
            opt = b;
            break;
          }
        }
        res = opt * 10;
      }
      for (b++; b <= 9; b++) {
        if ((S[0] >> b) & 1) {
          res = res * 10 + b;
        }
      }
      return res;
    }
    lint res = INF;
    for (int st = 0; st <= 9; st++) {
      int dig = st;
      vector<int> newS;
      int last = 0;
      for (auto add : S) {
        if ((add >> dig) & 1) add ^= 1 << dig;
        last |= add;
        if (dig == 9) {
          newS.emplace_back(last);
          last = 0;
        }
        dig = (dig + 1) % 10;
      }
      if (last != 0) {
        newS.emplace_back(last);
      }
      lint newRes = self(self, newS, st != 0, depth + 1);
      res = min(res, newRes * 10ll + st);
    }
    return res;
  };

  lint ans = Solve(Solve, S, 0, 0);
  assert(ans > 0 && CheckAns(ans));

  // for (lint i = 1; i <= 1000; i++) {
  //   if (CheckAns(i)) {
  //     ans = min(ans, i);
  //   }
  // }

  cout << ans << '\n';
  return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 5 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 5 ms 308 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 112 ms 440 KB Output is correct
3 Correct 117 ms 460 KB Output is correct
4 Correct 12 ms 460 KB Output is correct
5 Correct 12 ms 464 KB Output is correct
6 Correct 87 ms 400 KB Output is correct
7 Correct 700 ms 1224 KB Output is correct
8 Correct 458 ms 916 KB Output is correct
9 Execution timed out 1036 ms 1600 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 5 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -