Submission #10160794

---

Source Code Expand

#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")   
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>

using namespace std;

#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define Str(x) to_string(x)
#define len(s) (int)s.size()

typedef long long ll;
typedef long double lld;
typedef string str;
typedef unsigned long long ull;

const int maxn = 1e6 + 2;

int dp[maxn][10][2];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    vector <int> s;
    string t;
    cin >> t;
    int g = len(t);
    for (auto it : t) {
        s.pb(it - '0');
    }
    while (len(s) != maxn)
        s.pb(0);
    for (int i = 0; i < maxn; i++) {
        for (int j = 0; j < 10; j++) {
            dp[i][j][0] = dp[i][j][1] = 1e9;
        }
    }

    for (int i = 0; i < 10; i++) {
        if (i >= s[0]) {
            dp[0][i][0] = 2 * i - s[0];
        } else {
            dp[0][i][1] = i  + i + 10 - s[0];
        }
    }
    int ans = 1e9;
    for (int i = 1; i < maxn; i++) {
        for (int j = 0; j < 10; j++) {
            for (int last = 0; last < 10; last++) {
                for (int first = 0; first < 2; first++) {
                    for (int second = 0; second < 2; second++) {
                        int x = j - s[i];
                        if (second) {
                            x--;
                        }
                        if (first)
                            x += 10;
                        if (x >= 0 && x < 10) {
                            dp[i][j][first] = min(dp[i][j][first], dp[i-1][last][second] + j + x);
                        }
                    }
                }
            }
            if (i + 1 >= g) {
                ans = min(ans, dp[i][j][0]);
            }
        }
    }
    cout << ans;
    return 0;
}

Submission Info

Judge Result