#include <iostream> #include <vector> #include <array> struct student { std::size_t id; std::vector<unsigned> t; }; const std::size_t DIGIT_NUM = 10; const std::size_t DIGIT_MAX = 10; int main() { std::size_t n, m; std::cin >> n >> m; std::vector<student> students; std::vector<unsigned> current_t; current_t.reserve(m); for (std::size_t i = 0; i < n; ++i) { unsigned t_i; std::cin >> t_i; current_t.push_back(t_i); } students.push_back({1, current_t}); for (std::size_t i = 1; i < m; ++i) { std::size_t p_i, x_i; std::cin >> p_i >> x_i; current_t[p_i - 1] = x_i; students.push_back({i + 1, current_t}); } for (std::size_t i = n; i > 0; --i) { for (std::size_t digit = 0; digit < DIGIT_NUM; ++digit) { std::array<std::vector<student>, DIGIT_MAX> queues; for (std::size_t j = 0; j < m; ++j) { auto one = std::move(students[j]); auto val = one.t[i - 1]; for (std::size_t k = 0; k < digit; ++k) { val /= DIGIT_MAX; } val %= DIGIT_MAX; queues[val].push_back(std::move(one)); } students.clear(); for (auto &queue: queues) { for (std::size_t j = 0; j < queue.size(); ++j) { students.push_back(std::move(queue[j])); } } } } for (auto one: students) { std::cout << one.id << " "; } std::cout << "\n"; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 | #include <iostream> #include <vector> #include <array> struct student { std::size_t id; std::vector<unsigned> t; }; const std::size_t DIGIT_NUM = 10; const std::size_t DIGIT_MAX = 10; int main() { std::size_t n, m; std::cin >> n >> m; std::vector<student> students; std::vector<unsigned> current_t; current_t.reserve(m); for (std::size_t i = 0; i < n; ++i) { unsigned t_i; std::cin >> t_i; current_t.push_back(t_i); } students.push_back({1, current_t}); for (std::size_t i = 1; i < m; ++i) { std::size_t p_i, x_i; std::cin >> p_i >> x_i; current_t[p_i - 1] = x_i; students.push_back({i + 1, current_t}); } for (std::size_t i = n; i > 0; --i) { for (std::size_t digit = 0; digit < DIGIT_NUM; ++digit) { std::array<std::vector<student>, DIGIT_MAX> queues; for (std::size_t j = 0; j < m; ++j) { auto one = std::move(students[j]); auto val = one.t[i - 1]; for (std::size_t k = 0; k < digit; ++k) { val /= DIGIT_MAX; } val %= DIGIT_MAX; queues[val].push_back(std::move(one)); } students.clear(); for (auto &queue: queues) { for (std::size_t j = 0; j < queue.size(); ++j) { students.push_back(std::move(queue[j])); } } } } for (auto one: students) { std::cout << one.id << " "; } std::cout << "\n"; } |