//Konrad Paluszek, University of Warsaw (former XIV LO Warsaw) #ifndef LOCAL #pragma GCC optimize("O3") #endif #include <bits/stdc++.h> using namespace std; #define sim template <class c #define mor > muu & operator<< ( #define ris return *this #define R22(r) sim> typename enable_if<1 r sizeof(dud<c>(0)), muu&>::type operator<<(c g) { sim> struct rge {c h, n;}; sim> rge<c> range(c h, c n) {return rge<c>{h, n};} sim, class F> struct rgm {c h, n; F f;}; sim, class F> rgm<c, F> map_range(c b, c e, F f) {return rgm<c, F>{b, e, f};} sim, class F> rgm<typename c::const_iterator, F> map_range(const c &x, F f) {return map_range(x.begin(), x.end(), f);} sim> auto dud(c *r) -> decltype(cerr << *r); sim> char dud(...); struct muu { #ifdef LOCAL stringstream a; ~muu() {cerr << a.str() << endl;} R22(<) a << boolalpha << g; ris;} R22(==) ris << range(begin(g), end(g));} sim mor rge<c> u) { a << '{'; for (c s = u.h; s != u.n; ++s) *this << ", " + 2 * (s == u.h) << *s; ris << '}'; } sim, class n mor pair <c,n> r) {ris << "(" << r.first << ", " << r.second << ")";} sim, class F mor rgm<c, F> u) { for (c s = u.h; s != u.n; ++s) u.f(*this << ", " + 2 * (s == u.h), *s); ris; } #else sim mor const c&) {ris;} #endif muu & operator()() {ris;} }; #define debug (muu() << __FUNCTION__ << "#" << __LINE__ << ": ") #define imie(r) "[" #r ": " << (r) << "] " #define imask(r) "[" #r ": " << bitset<8 * sizeof(r)>(r) << "] " #define arr(a, i) "[" #a imie(i) ": " << a[i] << "] " #define arr2(a, i, j) "[" #a imie(i) imie(j) << ": " << a[i][j] << "] " void output(muu & deb, int x) { if (x >= 0) deb << x; else { for (int i = 0; i < -x; ++i) deb << ", " + 2 * !i << "*"; } } const int nax = 2e5 + 44; vector <int> numbers[nax]; void clear(vector <int> &a) { for (int &x : a) if (x == -1) x = 0; } int len(const vector<int> &a) { int ans = 0; for (int x : a) if (x < 0) ans += -x; else ans++; return ans; } void inc(vector <int> & a) { int n = a.size(); for (int i = n - 1; i >= 0; --i) { if (a[i] < 0) { a[i]++; assert(a[i] < 0); a.insert(a.begin() + i + 1, 1); clear(a); return; } else if (a[i] < 9) { a[i]++; return; } else a[i] = 0; } a.resize(n + 1); a[0] = 1; for (int i = 1; i <= n; ++i) a[i] = 0; } int main() { int n; scanf("%d", &n); int init_len = 0; for (int i = 0; i < n; ++i) { int x; scanf("%d", &x); while (x) { numbers[i].push_back(x % 10); x /= 10; } reverse(numbers[i].begin(), numbers[i].end()); init_len += numbers[i].size(); } for (int i = 1; i < n; ++i) { vector <int> can = numbers[i - 1]; inc(can); int can_len = 0; for (int x : can) if (x >= 0) can_len++; else can_len += -x; vector <int> prefix; if (can_len < (int)numbers[i].size()) { debug << map_range(numbers[i], output) << " is large enough"; continue; } for (int x : can) { if (prefix.size() == numbers[i].size()) break; if (x >= 0) prefix.push_back(x); else { for (int _ = 0; _ < -x; ++_) { prefix.push_back(0); if (prefix.size() == numbers[i].size()) break; } } } debug << map_range(prefix, output) << ";;; " << map_range(numbers[i], output); assert(prefix.size() <= numbers[i].size()); if (prefix == numbers[i]) { numbers[i] = can; } else { int zeros = -1; if (prefix < numbers[i]) zeros = can_len - numbers[i].size(); else zeros = can_len - numbers[i].size() + 1; if (zeros > 1) numbers[i].push_back(-zeros); else if (zeros == 1) numbers[i].push_back(0); } debug << map_range(numbers[i], output); } long long final_len = 0; for (int i = 0; i < n; ++i) final_len += len(numbers[i]); printf("%lld\n", final_len - init_len); }
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 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 | //Konrad Paluszek, University of Warsaw (former XIV LO Warsaw) #ifndef LOCAL #pragma GCC optimize("O3") #endif #include <bits/stdc++.h> using namespace std; #define sim template <class c #define mor > muu & operator<< ( #define ris return *this #define R22(r) sim> typename enable_if<1 r sizeof(dud<c>(0)), muu&>::type operator<<(c g) { sim> struct rge {c h, n;}; sim> rge<c> range(c h, c n) {return rge<c>{h, n};} sim, class F> struct rgm {c h, n; F f;}; sim, class F> rgm<c, F> map_range(c b, c e, F f) {return rgm<c, F>{b, e, f};} sim, class F> rgm<typename c::const_iterator, F> map_range(const c &x, F f) {return map_range(x.begin(), x.end(), f);} sim> auto dud(c *r) -> decltype(cerr << *r); sim> char dud(...); struct muu { #ifdef LOCAL stringstream a; ~muu() {cerr << a.str() << endl;} R22(<) a << boolalpha << g; ris;} R22(==) ris << range(begin(g), end(g));} sim mor rge<c> u) { a << '{'; for (c s = u.h; s != u.n; ++s) *this << ", " + 2 * (s == u.h) << *s; ris << '}'; } sim, class n mor pair <c,n> r) {ris << "(" << r.first << ", " << r.second << ")";} sim, class F mor rgm<c, F> u) { for (c s = u.h; s != u.n; ++s) u.f(*this << ", " + 2 * (s == u.h), *s); ris; } #else sim mor const c&) {ris;} #endif muu & operator()() {ris;} }; #define debug (muu() << __FUNCTION__ << "#" << __LINE__ << ": ") #define imie(r) "[" #r ": " << (r) << "] " #define imask(r) "[" #r ": " << bitset<8 * sizeof(r)>(r) << "] " #define arr(a, i) "[" #a imie(i) ": " << a[i] << "] " #define arr2(a, i, j) "[" #a imie(i) imie(j) << ": " << a[i][j] << "] " void output(muu & deb, int x) { if (x >= 0) deb << x; else { for (int i = 0; i < -x; ++i) deb << ", " + 2 * !i << "*"; } } const int nax = 2e5 + 44; vector <int> numbers[nax]; void clear(vector <int> &a) { for (int &x : a) if (x == -1) x = 0; } int len(const vector<int> &a) { int ans = 0; for (int x : a) if (x < 0) ans += -x; else ans++; return ans; } void inc(vector <int> & a) { int n = a.size(); for (int i = n - 1; i >= 0; --i) { if (a[i] < 0) { a[i]++; assert(a[i] < 0); a.insert(a.begin() + i + 1, 1); clear(a); return; } else if (a[i] < 9) { a[i]++; return; } else a[i] = 0; } a.resize(n + 1); a[0] = 1; for (int i = 1; i <= n; ++i) a[i] = 0; } int main() { int n; scanf("%d", &n); int init_len = 0; for (int i = 0; i < n; ++i) { int x; scanf("%d", &x); while (x) { numbers[i].push_back(x % 10); x /= 10; } reverse(numbers[i].begin(), numbers[i].end()); init_len += numbers[i].size(); } for (int i = 1; i < n; ++i) { vector <int> can = numbers[i - 1]; inc(can); int can_len = 0; for (int x : can) if (x >= 0) can_len++; else can_len += -x; vector <int> prefix; if (can_len < (int)numbers[i].size()) { debug << map_range(numbers[i], output) << " is large enough"; continue; } for (int x : can) { if (prefix.size() == numbers[i].size()) break; if (x >= 0) prefix.push_back(x); else { for (int _ = 0; _ < -x; ++_) { prefix.push_back(0); if (prefix.size() == numbers[i].size()) break; } } } debug << map_range(prefix, output) << ";;; " << map_range(numbers[i], output); assert(prefix.size() <= numbers[i].size()); if (prefix == numbers[i]) { numbers[i] = can; } else { int zeros = -1; if (prefix < numbers[i]) zeros = can_len - numbers[i].size(); else zeros = can_len - numbers[i].size() + 1; if (zeros > 1) numbers[i].push_back(-zeros); else if (zeros == 1) numbers[i].push_back(0); } debug << map_range(numbers[i], output); } long long final_len = 0; for (int i = 0; i < n; ++i) final_len += len(numbers[i]); printf("%lld\n", final_len - init_len); } |