Submission #1399621

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>

#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <map>
// #include <unordered_map>
#include <set>
#include <utility>
#include <bitset>
#include <limits>
#include <climits>
using namespace std;

#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

#define INTSPACE 11
char _buf[INTSPACE*1000000 + 3];  // ここ要確認

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}


ll solve(int n, int m, vector<int>& a) {
    assert(a.size() == n);
    rep(i, n) --a[i];

    /*
    ll without = 0;
    for (int i=1; i<n; ++i) {
        without += (a[i] - a[i-1] + m) % m;
    }
    printf("without: %lld\n", without);
    */

    vector<ll> b(m+1, 0);
    vector<ll> ac(m+1, 0);

    for (int i=1; i<n; ++i) {
        int prev = a[i-1], next = a[i];

        if (next < prev) {
            int without = next + m - prev;
            b[0] += next+1; // <= without
            ac[0] -= 1;

            b[next+1] += without;
            ac[next+1] += 1;

            if (prev+1 < m) {
                ac[prev+1] -= 1;
            }
        } else { // prev < next
            int without = next - prev;
            b[0] += without;
            // ac[0] += 0;
            ac[prev+1] -= 1;

            b[next+1] += without;
            ac[next+1] += 1;
        }
    }

#ifdef DEBUG
    cout << "b:" << b << endl;
    cout << "c:" << ac << endl;
#endif
    rep(i, m) {
        b[i+1] += b[i];
        ac[i+1] += ac[i];
    }
    rep(i, m) {
        ac[i+1] += ac[i];
    }
#ifdef DEBUG
    cout << "b:" << b << endl;
    cout << "c:" << ac << endl;
#endif
    vector<ll> d(m, 0);
    d[0] = b[0];
    rep1(i, m-1) {
        d[i] = b[i] + ac[i-1];
    }
#ifdef DEBUG
    cout << "d: " << d << endl;
#endif
    return *min_element(ALL(d));
}

int main() {
    vector<int> a;
    loadvec(a, 2);
    int n=a[0], m=a[1];
    a.resize(n);
    loadvec(a, n);
    cout << solve(n, m, a) << endl;
}

Submission Info

Judge Result