///////////////////////////////// //////**DOMINIK___KOWALCZYK**//// ///////////////////////////////// #include <bits/stdc++.h> using namespace std; #define boost ios_base::sync_with_stdio(0); #define all(a) (a).begin(),(a).end() #define sz(a) (int)(a).size() #define ELO exit(0) #define pb push_back #define FOR(a,b,c) for(int a = b; a <= c; a++) template <class T>inline void setmax(T & a, T b) {if (b > a)a = b;} template <class T>inline void setmin(T & a, T b) {if (a > b)a = b;} typedef long long ll; const int N = 2e5 + 7; string tab[N]; const int DL = 100; int main() { boost; int n; cin >> n; FOR(i, 1, n)cin >> tab[i]; //if (i & 1)tab[i] = "1"; //else tab[i] = "2"; ll res = 0; ll zera = 0; //int p[20] = {0}; FOR(i, 2, n) { int pref = -1; for (int j = 0 ; j < min(sz(tab[i]), sz(tab[i - 1])); j++) { if (tab[i][j] > tab[i - 1][j]) { pref = j; break; } else if (tab[i][j] < tab[i - 1][j]) { pref = -2; break; } } //cerr << "pref : " << pref << " " << tab[i - 1] << " " << tab[i] << "\n"; if (pref == -1)//rowny prefix { if (sz(tab[i]) == sz(tab[i - 1]))//takie same { //p[0]++; tab[i] += "0"; res++; } else if (sz(tab[i]) < sz(tab[i - 1]))//i jest prefixem wiekszego i-1 { if (zera > 0) { //p[1]++; //cerr << "siema : " << i << " " << zera << "\n"; res += sz(tab[i - 1]) - sz(tab[i]); tab[i] = tab[i - 1]; res += zera; } else { //p[2]++; bool z = false; int last = -1; FOR(x, sz(tab[i]), sz(tab[i - 1]) - 1) { if (tab[i - 1][x] != '9') { last = x; } } if (last != -1 and zera == 0) { FOR(j, sz(tab[i]), last - 1) { tab[i] += tab[i - 1][j]; res++; } tab[i] += char(tab[i - 1][last] + 1); res++; while (sz(tab[i]) < sz(tab[i + 1])) { tab[i] += "0"; res++; } } else { while (sz(tab[i]) < sz(tab[i - 1]) + 1) { tab[i] += "0"; res++; } res += zera; if (sz(tab[i]) >= DL) { tab[i].pop_back(); zera++; } } } } else//i jest wieksze { ;//p[3]++; } } else if (pref == -2) //mniejsze { //p[4]++; while (sz(tab[i]) < sz(tab[i - 1]) + 1) { tab[i] += "0"; res++; } res += zera; if (sz(tab[i]) >= DL) { tab[i].pop_back(); zera++; } } else//wieksze { //p[5]++; //cerr << "XD : " << i << " " << pref << "\n"; //cerr << tab[i] << " " << tab[i - 1] << "\n"; while (sz(tab[i]) < sz(tab[i - 1])) { tab[i] += "0"; res++; } res += zera; } } //FOR(i, 1, n)cerr << tab[i] << " "; //cerr << "\n"; //FOR(i, 1, 1000)cerr << tab[i] << "\n"; //cerr << "\n"; //FOR(i, 0, 5)cerr << p[i] << " "; //cerr << "\n"; cout << res; ELO; } /* kon12 - 9988987949 kon.in - 9948427020 kon1txt.txt - 0 konmax.txt - 19999900000 testkon.txt - 286 */
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 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 | ///////////////////////////////// //////**DOMINIK___KOWALCZYK**//// ///////////////////////////////// #include <bits/stdc++.h> using namespace std; #define boost ios_base::sync_with_stdio(0); #define all(a) (a).begin(),(a).end() #define sz(a) (int)(a).size() #define ELO exit(0) #define pb push_back #define FOR(a,b,c) for(int a = b; a <= c; a++) template <class T>inline void setmax(T & a, T b) {if (b > a)a = b;} template <class T>inline void setmin(T & a, T b) {if (a > b)a = b;} typedef long long ll; const int N = 2e5 + 7; string tab[N]; const int DL = 100; int main() { boost; int n; cin >> n; FOR(i, 1, n)cin >> tab[i]; //if (i & 1)tab[i] = "1"; //else tab[i] = "2"; ll res = 0; ll zera = 0; //int p[20] = {0}; FOR(i, 2, n) { int pref = -1; for (int j = 0 ; j < min(sz(tab[i]), sz(tab[i - 1])); j++) { if (tab[i][j] > tab[i - 1][j]) { pref = j; break; } else if (tab[i][j] < tab[i - 1][j]) { pref = -2; break; } } //cerr << "pref : " << pref << " " << tab[i - 1] << " " << tab[i] << "\n"; if (pref == -1)//rowny prefix { if (sz(tab[i]) == sz(tab[i - 1]))//takie same { //p[0]++; tab[i] += "0"; res++; } else if (sz(tab[i]) < sz(tab[i - 1]))//i jest prefixem wiekszego i-1 { if (zera > 0) { //p[1]++; //cerr << "siema : " << i << " " << zera << "\n"; res += sz(tab[i - 1]) - sz(tab[i]); tab[i] = tab[i - 1]; res += zera; } else { //p[2]++; bool z = false; int last = -1; FOR(x, sz(tab[i]), sz(tab[i - 1]) - 1) { if (tab[i - 1][x] != '9') { last = x; } } if (last != -1 and zera == 0) { FOR(j, sz(tab[i]), last - 1) { tab[i] += tab[i - 1][j]; res++; } tab[i] += char(tab[i - 1][last] + 1); res++; while (sz(tab[i]) < sz(tab[i + 1])) { tab[i] += "0"; res++; } } else { while (sz(tab[i]) < sz(tab[i - 1]) + 1) { tab[i] += "0"; res++; } res += zera; if (sz(tab[i]) >= DL) { tab[i].pop_back(); zera++; } } } } else//i jest wieksze { ;//p[3]++; } } else if (pref == -2) //mniejsze { //p[4]++; while (sz(tab[i]) < sz(tab[i - 1]) + 1) { tab[i] += "0"; res++; } res += zera; if (sz(tab[i]) >= DL) { tab[i].pop_back(); zera++; } } else//wieksze { //p[5]++; //cerr << "XD : " << i << " " << pref << "\n"; //cerr << tab[i] << " " << tab[i - 1] << "\n"; while (sz(tab[i]) < sz(tab[i - 1])) { tab[i] += "0"; res++; } res += zera; } } //FOR(i, 1, n)cerr << tab[i] << " "; //cerr << "\n"; //FOR(i, 1, 1000)cerr << tab[i] << "\n"; //cerr << "\n"; //FOR(i, 0, 5)cerr << p[i] << " "; //cerr << "\n"; cout << res; ELO; } /* kon12 - 9988987949 kon.in - 9948427020 kon1txt.txt - 0 konmax.txt - 19999900000 testkon.txt - 286 */ |