oj.uz

Submission #488576

# Submission time Handle Problem Language Result Execution time Memory
488576 2021-11-19T16:53:23 Z Alex_tz307 Devil's Share (RMI19_devil) C++17
100 / 100
 367 ms 4808 KB 
#include <bits/stdc++.h>

using namespace std;

void TestCase() {
  int k;
  cin >> k;
  vector<int> f(10);
  for (int i = 1; i < 10; ++i) {
    cin >> f[i];
  }
  string last = "";
  for (int i = 9; i > 0 && (int)last.size() < k - 1; --i) {
    int use = min(f[i], k - 1 - (int)last.size());
    f[i] -= use;
    for (int j = 0; j < use; ++j) {
      last += '0' + i;
    }
  }
  reverse(last.begin(), last.end());
  deque<string> dq, q;
  for (int i = 9; i > 0; --i) {
    if (f[i]) {
      for (int j = 0; j < f[i]; ++j) {
        dq.emplace_back(string(1, '0' + i));
      }
      f[i] = 0;
      break;
    }
  }
  for (int i = 1; i < 10; ++i) {
    for (int j = 0; j < f[i]; ++j) {
      q.emplace_back(string(1, '0' + i));
    }
  }
  while (!q.empty()) {
    auto s = q.front();
    q.pop_front();
    dq.back() += s;
    if (dq.back() != dq.front()) {
      q.emplace_back(dq.back());
      dq.pop_back();
    }
    while (!q.empty() && q.back() == dq.front()) {
      dq.emplace_back(q.back());
      q.pop_back();
    }
  }
  for (auto it : dq) {
    cout << it;
  }
  cout << last << '\n';
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int tests;
  cin >> tests;
  for (int tc = 1; tc <= tests; ++tc) {
    TestCase();
  }
  return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 336 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 2024 KB Output is correct
2 Correct 70 ms 1736 KB Output is correct
3 Correct 69 ms 1644 KB Output is correct
4 Correct 86 ms 2124 KB Output is correct
5 Correct 75 ms 1344 KB Output is correct
6 Correct 73 ms 1396 KB Output is correct
7 Correct 69 ms 1264 KB Output is correct
8 Correct 101 ms 1764 KB Output is correct
9 Correct 367 ms 4632 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1668 KB Output is correct
2 Correct 40 ms 1528 KB Output is correct
3 Correct 36 ms 3704 KB Output is correct
4 Correct 53 ms 4160 KB Output is correct
5 Correct 92 ms 4568 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 336 KB Output is correct
2 Correct 74 ms 2024 KB Output is correct
3 Correct 70 ms 1736 KB Output is correct
4 Correct 69 ms 1644 KB Output is correct
5 Correct 86 ms 2124 KB Output is correct
6 Correct 75 ms 1344 KB Output is correct
7 Correct 73 ms 1396 KB Output is correct
8 Correct 69 ms 1264 KB Output is correct
9 Correct 101 ms 1764 KB Output is correct
10 Correct 367 ms 4632 KB Output is correct
11 Correct 47 ms 1668 KB Output is correct
12 Correct 40 ms 1528 KB Output is correct
13 Correct 36 ms 3704 KB Output is correct
14 Correct 53 ms 4160 KB Output is correct
15 Correct 92 ms 4568 KB Output is correct
16 Correct 58 ms 1964 KB Output is correct
17 Correct 62 ms 2196 KB Output is correct
18 Correct 55 ms 1864 KB Output is correct
19 Correct 77 ms 2564 KB Output is correct
20 Correct 39 ms 1344 KB Output is correct
21 Correct 39 ms 1256 KB Output is correct
22 Correct 52 ms 1744 KB Output is correct
23 Correct 114 ms 4808 KB Output is correct