#include <bits/stdc++.h> using namespace std; #define PII pair<int, int> #define VI vector<int> #define VPII vector<PII> #define LL long long #define LD long double #define f first #define s second #define MP make_pair #define PB push_back #define ALL(c) (c).begin(), (c).end() #define SIZ(c) (int)(c).size() #define REP(i, n) for(int i = 0; i < (int)(n); ++i) #define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i) #define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i) #define Sim template<class n Sim, class s> ostream & operator << (ostream &p, pair<n, s> x) {return p << "<" << x.st << ", " << x.nd << ">";} Sim> auto operator << (ostream &p, n y) -> typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type {int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";} void dor() {cerr << endl;} Sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);} Sim, class s> void mini(n &p, s y) {if(p>y) p = y;} Sim, class s> void maxi(n &p, s y) {if(p<y) p = y;} #ifdef DEB #define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__) #else #define debug(...) #endif #define I(x) #x " = ", (x), " " #define A(a, i) #a "[" #i " = ", i, "] = ", a[i], " " bool prefix(string &a, string &b) { if(a.size() > b.size())return 0; REP(i, a.size()) if(a[i] != b[i]) return 0; return 1; } char buf[20]; int main() { int n; scanf("%d", &n); string prev, s; scanf("%s", buf); s = buf; map<int, int> actual; auto try_increase_or_clear = [&](int len) { // returns 1 if increased if possible // or 0 if cleared 0...len REP(i, len) { if(actual[i] < 9) { actual[i]++; return 1; } else { actual[i] = 0; } } actual[len] = 0; return 0; }; auto clear = [&](int len) { while(actual.size() && actual.begin()->f < len) actual.erase(actual.begin()); }; int prev_add_len = 0; LL result = 0; FOR(uuu, 1, n) { prev = s; REP(i, prev.size()) actual[prev_add_len + (int)s.size() - i - 1] = prev[i] - '0'; if(uuu == n)break; scanf("%s", buf); s = buf; if(prefix(prev, s)) { // 1123xxxx // 11231yyy int add_len = prev_add_len + (int)prev.size() - (int)s.size(); if(add_len < 0) { clear(prev_add_len); prev_add_len = 0; continue; } int val = 0; REP(i, s.size()) { int result_idx = (int)s.size() - i - 1 + add_len; if(actual[result_idx] + '0' < s[i]) { val = -1; break; } else if(actual[result_idx] + '0' > s[i]) { val = 1; break; } } if(val == 1) { // 1123[2]xxx // 1123 1 yyy add_len++; clear(add_len); } else if(val == -1) { // 1123[2]xxx // 1123 3 yyy clear(add_len); } else { // 1123[2]xxx // 1123 2 yyy if(try_increase_or_clear(add_len) == 0) { add_len++; } } prev_add_len = add_len; result += add_len; continue; } if(prefix(s, prev)) { // 11231xxx // 1123yyyy int add_len = prev_add_len + (int)prev.size() - (int)s.size(); if(try_increase_or_clear(add_len) == 0) add_len++; prev_add_len = add_len; result += add_len; continue; } if(prev < s) { prev_add_len = max(prev_add_len + (int)prev.size() - (int)s.size(), 0); clear(prev_add_len); result += prev_add_len; continue; } if(prev > s) { prev_add_len = max(prev_add_len + (int)prev.size() - (int)s.size() + 1, 0); clear(prev_add_len); result += prev_add_len; continue; } } cout << result << endl; }
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 | #include <bits/stdc++.h> using namespace std; #define PII pair<int, int> #define VI vector<int> #define VPII vector<PII> #define LL long long #define LD long double #define f first #define s second #define MP make_pair #define PB push_back #define ALL(c) (c).begin(), (c).end() #define SIZ(c) (int)(c).size() #define REP(i, n) for(int i = 0; i < (int)(n); ++i) #define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i) #define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i) #define Sim template<class n Sim, class s> ostream & operator << (ostream &p, pair<n, s> x) {return p << "<" << x.st << ", " << x.nd << ">";} Sim> auto operator << (ostream &p, n y) -> typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type {int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";} void dor() {cerr << endl;} Sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);} Sim, class s> void mini(n &p, s y) {if(p>y) p = y;} Sim, class s> void maxi(n &p, s y) {if(p<y) p = y;} #ifdef DEB #define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__) #else #define debug(...) #endif #define I(x) #x " = ", (x), " " #define A(a, i) #a "[" #i " = ", i, "] = ", a[i], " " bool prefix(string &a, string &b) { if(a.size() > b.size())return 0; REP(i, a.size()) if(a[i] != b[i]) return 0; return 1; } char buf[20]; int main() { int n; scanf("%d", &n); string prev, s; scanf("%s", buf); s = buf; map<int, int> actual; auto try_increase_or_clear = [&](int len) { // returns 1 if increased if possible // or 0 if cleared 0...len REP(i, len) { if(actual[i] < 9) { actual[i]++; return 1; } else { actual[i] = 0; } } actual[len] = 0; return 0; }; auto clear = [&](int len) { while(actual.size() && actual.begin()->f < len) actual.erase(actual.begin()); }; int prev_add_len = 0; LL result = 0; FOR(uuu, 1, n) { prev = s; REP(i, prev.size()) actual[prev_add_len + (int)s.size() - i - 1] = prev[i] - '0'; if(uuu == n)break; scanf("%s", buf); s = buf; if(prefix(prev, s)) { // 1123xxxx // 11231yyy int add_len = prev_add_len + (int)prev.size() - (int)s.size(); if(add_len < 0) { clear(prev_add_len); prev_add_len = 0; continue; } int val = 0; REP(i, s.size()) { int result_idx = (int)s.size() - i - 1 + add_len; if(actual[result_idx] + '0' < s[i]) { val = -1; break; } else if(actual[result_idx] + '0' > s[i]) { val = 1; break; } } if(val == 1) { // 1123[2]xxx // 1123 1 yyy add_len++; clear(add_len); } else if(val == -1) { // 1123[2]xxx // 1123 3 yyy clear(add_len); } else { // 1123[2]xxx // 1123 2 yyy if(try_increase_or_clear(add_len) == 0) { add_len++; } } prev_add_len = add_len; result += add_len; continue; } if(prefix(s, prev)) { // 11231xxx // 1123yyyy int add_len = prev_add_len + (int)prev.size() - (int)s.size(); if(try_increase_or_clear(add_len) == 0) add_len++; prev_add_len = add_len; result += add_len; continue; } if(prev < s) { prev_add_len = max(prev_add_len + (int)prev.size() - (int)s.size(), 0); clear(prev_add_len); result += prev_add_len; continue; } if(prev > s) { prev_add_len = max(prev_add_len + (int)prev.size() - (int)s.size() + 1, 0); clear(prev_add_len); result += prev_add_len; continue; } } cout << result << endl; } |