oj.uz

Submission #330837

# Submission time Handle Problem Language Result Execution time Memory
330837 2020-11-26T17:34:46 Z AlexPop28 Devil's Share (RMI19_devil) C++11
100 / 100
 85 ms 7148 KB 
#include <bits/stdc++.h>
#define dbg() cerr <<
#define name(x) (#x) << ": " << (x) << ' ' <<

using namespace std;

void SolveTest() {
  int k; cin >> k;
  vector<int> freq(10);
  for (int i = 1; i < 10; ++i) {
    cin >> freq[i]; 
  }
  
  string suff;
  int dig = 9;
  for (int i = 0; i < k - 1; ++i) {
    while (freq[dig] == 0) --dig;
    suff += dig + '0';
    --freq[dig];
  }
  reverse(suff.begin(), suff.end());

  while (freq[dig] == 0) --dig;
  pair<string, int> mx = {string(1, dig + '0'), freq[dig]};

  vector<pair<string, int>> q;
  for (int i = 0; i < dig; ++i) {
    if (freq[i] > 0)
      q.emplace_back(string(1, i + '0'), freq[i]); 
  }

  for (int it = 0; it < (int)q.size(); ++it) {
    auto mn = q[it];

    while (mn.second >= mx.second) {
      mx.first += mn.first;
      mn.second -= mx.second;
    }

    if (mn.second > 0) {
      q.emplace_back(mx.first + mn.first, mn.second);
      mx.second -= mn.second;
    }
  }

  for (int i = 0; i < mx.second; ++i)
    cout << mx.first;
  cout << suff << '\n';
}

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

  int t; cin >> t;
  while (t--) {
    SolveTest();
  }
}

Subtask #1
13.0 / 13.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2028 KB Output is correct
2 Correct 38 ms 1772 KB Output is correct
3 Correct 34 ms 1772 KB Output is correct
4 Correct 61 ms 2156 KB Output is correct
5 Correct 6 ms 1644 KB Output is correct
6 Correct 6 ms 1388 KB Output is correct
7 Correct 7 ms 1388 KB Output is correct
8 Correct 6 ms 1516 KB Output is correct
9 Correct 4 ms 1520 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1772 KB Output is correct
2 Correct 25 ms 1644 KB Output is correct
3 Correct 11 ms 1544 KB Output is correct
4 Correct 13 ms 7148 KB Output is correct
5 Correct 3 ms 1408 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 55 ms 2028 KB Output is correct
3 Correct 38 ms 1772 KB Output is correct
4 Correct 34 ms 1772 KB Output is correct
5 Correct 61 ms 2156 KB Output is correct
6 Correct 6 ms 1644 KB Output is correct
7 Correct 6 ms 1388 KB Output is correct
8 Correct 7 ms 1388 KB Output is correct
9 Correct 6 ms 1516 KB Output is correct
10 Correct 4 ms 1520 KB Output is correct
11 Correct 39 ms 1772 KB Output is correct
12 Correct 25 ms 1644 KB Output is correct
13 Correct 11 ms 1544 KB Output is correct
14 Correct 13 ms 7148 KB Output is correct
15 Correct 3 ms 1408 KB Output is correct
16 Correct 59 ms 2028 KB Output is correct
17 Correct 61 ms 2284 KB Output is correct
18 Correct 51 ms 1900 KB Output is correct
19 Correct 85 ms 2668 KB Output is correct
20 Correct 9 ms 1388 KB Output is correct
21 Correct 9 ms 1388 KB Output is correct
22 Correct 6 ms 1388 KB Output is correct
23 Correct 3 ms 1492 KB Output is correct