//#include <iostream> #include <string> #include <vector> //#include <cmath> using namespace std; //string toAppend; inline void appendNZeros(int const n, string& str, int const strLen) { str.resize(strLen + n); fill(str.begin()+strLen, str.end(), '0'); } inline unsigned process (string& prevLine, string& currLine) { auto const currLen = currLine.length(); auto const prevLen = prevLine.length(); if (prevLen < currLen) return 0; if (prevLen == currLen) { if (prevLine < currLine) return 0; currLine.push_back('0'); return 1; } //if (prevLen > currLen) //string prevPrefix = prevLine.substr(0, currLen); //auto cmpResult = prevPrefix.compare(currLine); auto cmpResult = currLine.compare(0, currLen, prevLine, 0, currLen); //if (prevPrefix > currLine) if (cmpResult < 0) { auto n = prevLen-currLen + 1; appendNZeros(n, currLine, currLen); return n; } //if (prevPrefix == currLine) if (cmpResult == 0) { bool incremented = false; //toAppend.assign(prevLine, currLen); for (int i = prevLen-1; i >=currLen; i--) { if (prevLine[i] == '9') { prevLine[i] = '0'; continue; } prevLine[i]++; incremented = true; break; } if (!incremented) { auto const n = prevLen-currLen + 1; appendNZeros(n, currLine, currLen); return n; } else { currLine.append(prevLine, currLen, string::npos); return prevLen-currLen; } /* bool incremented = false;*/ //toAppend.assign(prevLine, currLen); //for (int i = toAppend.length()-1; i >=0; i--) //{ //if (toAppend[i] == '9') //{ //toAppend[i] = '0'; //continue; //} //toAppend[i]++; //incremented = true; //break; //} //if (!incremented) //{ //auto const n = prevLen-currLen + 1; //appendNZeros(n, currLine, currLen); //return n; //} //else //{ //currLine.append(toAppend); //return toAppend.length(); /*}*/ } //if (prevPrefix < currLine) //if (cmpResult > 0) else { auto const n = prevLen-currLen; appendNZeros(n, currLine, currLen); return n; } } int main() { int N; unsigned long long sum = 0; //cin >> N; scanf("%d", &N); string evenLine; string oddLine; evenLine.reserve(200001); oddLine.reserve(200001); //toAppend.reserve(200001); char input[11]; scanf("%s", input); evenLine.assign(input); //cin >> evenLine; for (auto i = 1; i < N; i++) if (i % 2 == 1) { scanf("%s", input); //cin >> oddLine; oddLine.assign(input); sum += process(evenLine, oddLine); } else { //cin >> evenLine; scanf("%s", input); evenLine.assign(input); sum += process(oddLine, evenLine); } //cout << sum; printf("%llu", sum); 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 | //#include <iostream> #include <string> #include <vector> //#include <cmath> using namespace std; //string toAppend; inline void appendNZeros(int const n, string& str, int const strLen) { str.resize(strLen + n); fill(str.begin()+strLen, str.end(), '0'); } inline unsigned process (string& prevLine, string& currLine) { auto const currLen = currLine.length(); auto const prevLen = prevLine.length(); if (prevLen < currLen) return 0; if (prevLen == currLen) { if (prevLine < currLine) return 0; currLine.push_back('0'); return 1; } //if (prevLen > currLen) //string prevPrefix = prevLine.substr(0, currLen); //auto cmpResult = prevPrefix.compare(currLine); auto cmpResult = currLine.compare(0, currLen, prevLine, 0, currLen); //if (prevPrefix > currLine) if (cmpResult < 0) { auto n = prevLen-currLen + 1; appendNZeros(n, currLine, currLen); return n; } //if (prevPrefix == currLine) if (cmpResult == 0) { bool incremented = false; //toAppend.assign(prevLine, currLen); for (int i = prevLen-1; i >=currLen; i--) { if (prevLine[i] == '9') { prevLine[i] = '0'; continue; } prevLine[i]++; incremented = true; break; } if (!incremented) { auto const n = prevLen-currLen + 1; appendNZeros(n, currLine, currLen); return n; } else { currLine.append(prevLine, currLen, string::npos); return prevLen-currLen; } /* bool incremented = false;*/ //toAppend.assign(prevLine, currLen); //for (int i = toAppend.length()-1; i >=0; i--) //{ //if (toAppend[i] == '9') //{ //toAppend[i] = '0'; //continue; //} //toAppend[i]++; //incremented = true; //break; //} //if (!incremented) //{ //auto const n = prevLen-currLen + 1; //appendNZeros(n, currLine, currLen); //return n; //} //else //{ //currLine.append(toAppend); //return toAppend.length(); /*}*/ } //if (prevPrefix < currLine) //if (cmpResult > 0) else { auto const n = prevLen-currLen; appendNZeros(n, currLine, currLen); return n; } } int main() { int N; unsigned long long sum = 0; //cin >> N; scanf("%d", &N); string evenLine; string oddLine; evenLine.reserve(200001); oddLine.reserve(200001); //toAppend.reserve(200001); char input[11]; scanf("%s", input); evenLine.assign(input); //cin >> evenLine; for (auto i = 1; i < N; i++) if (i % 2 == 1) { scanf("%s", input); //cin >> oddLine; oddLine.assign(input); sum += process(evenLine, oddLine); } else { //cin >> evenLine; scanf("%s", input); evenLine.assign(input); sum += process(oddLine, evenLine); } //cout << sum; printf("%llu", sum); return 0; } |