#include<cstdio> #include<iostream> #include<algorithm> #include<string> #include<vector> #include<set> #include<cmath> using namespace std; typedef vector<int> VI; typedef long long LL; #define FOR(x, b, e) for(int x=b; x<=(e); ++x) #define FORD(x, b, e) for(int x=b; x>=(e); --x) #define REP(x, n) for(int x=0; x<(n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second class Solver { int n, last; public: void readInput() { cin >> n >> last; } int getLength(int a) { return std::to_string(a).size(); } void printLog(int a, int zeros, int last, int res) { printf("%d", a); for(int i=0;i<zeros - getLength(last);i++) { printf("0"); } if(zeros > 0) printf("%d", last); printf(" - %d\n", res); } void solve() { LL result = 0; int lastAdded = 0, lastEnding = 0; int current, currentAdded, currentEnding; for(int i = 1; i < n; i++) { cin >> current; if(current == last) { currentEnding = lastAdded == 0 ? 0 : lastEnding + 1; currentAdded = max(lastAdded, getLength(currentEnding)); if(currentAdded > lastAdded) { currentEnding = 0; } } else if (current < last) { int cl = getLength(current); int ll = getLength(last); if(cl == ll) { currentAdded = lastAdded + 1; currentEnding = 0; } else { int tmp = 1; for(int i = 0; i < ll - cl; i++) { tmp *= 10; } if(current > last/tmp) { currentAdded = lastAdded + ll - cl; currentEnding = 0; } else if(current < last/tmp) { currentAdded = lastAdded + ll - cl + 1; currentEnding = 0; } else { if (lastAdded > 0 && getLength(lastEnding + 1) <= lastAdded) { currentAdded = lastAdded; currentEnding = lastEnding + 1; current = last; result += ll - cl; } else if(last%tmp + 1 < tmp) { currentAdded = lastAdded; current = last + 1; result += ll - cl; currentEnding = 0; } else { currentAdded = lastAdded + 1 + ll - cl; currentEnding = 0; } } } } else { int cl = getLength(current); int ll = getLength(last); if (cl == ll) { currentAdded = lastAdded; currentEnding = 0; } else { int tmp = 1; for(int i = 0; i < cl - ll; i++) { tmp *= 10; } if(current/tmp > last) { currentAdded = max(0,lastAdded - (cl - ll)); currentEnding = 0; } else if(current/tmp < last) { currentAdded = max(0,lastAdded + 1 - (cl - ll)); currentEnding = 0; } else { if(lastAdded < cl - ll) { currentAdded = 0; currentEnding = 0; } else { last *= tmp; int zeros = lastAdded - getLength(lastEnding); lastAdded -= cl - ll; if(zeros < cl - ll) { tmp = 1; for(int i = 0; i < lastAdded; i++) tmp *= 10; last += lastEnding/tmp; lastEnding %= tmp; } if(current > last) { currentAdded = lastAdded; currentEnding = 0; } else if(current < last) { currentAdded = lastAdded + 1; currentEnding = 0; } else { currentEnding = lastAdded == 0 ? 0 : lastEnding + 1; currentAdded = max(lastAdded, getLength(currentEnding)); if(currentAdded > lastAdded) { currentEnding = 0; } } } } } } last = current; lastAdded = currentAdded; lastEnding = currentEnding; result += currentAdded; //printLog(current, currentAdded, currentEnding, result); } cout << result << '\n'; } }; int main() { ios_base::sync_with_stdio(0); Solver solver; solver.readInput(); solver.solve(); return 0; }
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 | #include<cstdio> #include<iostream> #include<algorithm> #include<string> #include<vector> #include<set> #include<cmath> using namespace std; typedef vector<int> VI; typedef long long LL; #define FOR(x, b, e) for(int x=b; x<=(e); ++x) #define FORD(x, b, e) for(int x=b; x>=(e); --x) #define REP(x, n) for(int x=0; x<(n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second class Solver { int n, last; public: void readInput() { cin >> n >> last; } int getLength(int a) { return std::to_string(a).size(); } void printLog(int a, int zeros, int last, int res) { printf("%d", a); for(int i=0;i<zeros - getLength(last);i++) { printf("0"); } if(zeros > 0) printf("%d", last); printf(" - %d\n", res); } void solve() { LL result = 0; int lastAdded = 0, lastEnding = 0; int current, currentAdded, currentEnding; for(int i = 1; i < n; i++) { cin >> current; if(current == last) { currentEnding = lastAdded == 0 ? 0 : lastEnding + 1; currentAdded = max(lastAdded, getLength(currentEnding)); if(currentAdded > lastAdded) { currentEnding = 0; } } else if (current < last) { int cl = getLength(current); int ll = getLength(last); if(cl == ll) { currentAdded = lastAdded + 1; currentEnding = 0; } else { int tmp = 1; for(int i = 0; i < ll - cl; i++) { tmp *= 10; } if(current > last/tmp) { currentAdded = lastAdded + ll - cl; currentEnding = 0; } else if(current < last/tmp) { currentAdded = lastAdded + ll - cl + 1; currentEnding = 0; } else { if (lastAdded > 0 && getLength(lastEnding + 1) <= lastAdded) { currentAdded = lastAdded; currentEnding = lastEnding + 1; current = last; result += ll - cl; } else if(last%tmp + 1 < tmp) { currentAdded = lastAdded; current = last + 1; result += ll - cl; currentEnding = 0; } else { currentAdded = lastAdded + 1 + ll - cl; currentEnding = 0; } } } } else { int cl = getLength(current); int ll = getLength(last); if (cl == ll) { currentAdded = lastAdded; currentEnding = 0; } else { int tmp = 1; for(int i = 0; i < cl - ll; i++) { tmp *= 10; } if(current/tmp > last) { currentAdded = max(0,lastAdded - (cl - ll)); currentEnding = 0; } else if(current/tmp < last) { currentAdded = max(0,lastAdded + 1 - (cl - ll)); currentEnding = 0; } else { if(lastAdded < cl - ll) { currentAdded = 0; currentEnding = 0; } else { last *= tmp; int zeros = lastAdded - getLength(lastEnding); lastAdded -= cl - ll; if(zeros < cl - ll) { tmp = 1; for(int i = 0; i < lastAdded; i++) tmp *= 10; last += lastEnding/tmp; lastEnding %= tmp; } if(current > last) { currentAdded = lastAdded; currentEnding = 0; } else if(current < last) { currentAdded = lastAdded + 1; currentEnding = 0; } else { currentEnding = lastAdded == 0 ? 0 : lastEnding + 1; currentAdded = max(lastAdded, getLength(currentEnding)); if(currentAdded > lastAdded) { currentEnding = 0; } } } } } } last = current; lastAdded = currentAdded; lastEnding = currentEnding; result += currentAdded; //printLog(current, currentAdded, currentEnding, result); } cout << result << '\n'; } }; int main() { ios_base::sync_with_stdio(0); Solver solver; solver.readInput(); solver.solve(); return 0; } |