Submission #1842262


Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}
#define N 200010
ll d[N];
int main(){
	ll n, m;
	cin>>n>>m;
	vector<int> a(n);
	rep(i, n) cin>>a[i];
	ll res = 0;
	rep(i, n-1){
		int x = a[i], y = a[i+1];
		if(y<x) y += m;
		res += y-x;
		if(y-x<=1) continue;
		d[x+2] += 1;
		d[y+1] += -(y-x);
		d[y+2] += y-x-1;
	}
	rep(i, 2*m) d[i+1] += d[i];
	rep(i, 2*m) d[i+1] += d[i];
	ll mx = 0;
	rep(i, m) mx = max(mx, d[i+1]+d[i+1+m]);
	cout<<res-mx<<endl;
	return 0;
}

Submission Info

Submission Time
Task E - guruguru
User Lepton
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1594 Byte
Status AC
Exec Time 30 ms
Memory 2176 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 22
Set Name Test Cases
Sample sample1.txt, sample2.txt
All half0.txt, half1.txt, half2.txt, half3.txt, half4.txt, min_m.txt, min_n.txt, mx0.txt, mx1.txt, mx2.txt, rnd0.txt, rnd1.txt, rnd2.txt, rnd3.txt, rnd4.txt, rnd5.txt, rnd6.txt, rnd7.txt, rnd8.txt, rnd9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
half0.txt AC 8 ms 1152 KB
half1.txt AC 5 ms 1792 KB
half2.txt AC 14 ms 1664 KB
half3.txt AC 21 ms 1280 KB
half4.txt AC 23 ms 1920 KB
min_m.txt AC 1 ms 256 KB
min_n.txt AC 2 ms 1792 KB
mx0.txt AC 30 ms 2176 KB
mx1.txt AC 30 ms 2176 KB
mx2.txt AC 30 ms 2176 KB
rnd0.txt AC 1 ms 640 KB
rnd1.txt AC 1 ms 256 KB
rnd2.txt AC 2 ms 512 KB
rnd3.txt AC 5 ms 512 KB
rnd4.txt AC 18 ms 512 KB
rnd5.txt AC 2 ms 256 KB
rnd6.txt AC 1 ms 256 KB
rnd7.txt AC 2 ms 640 KB
rnd8.txt AC 3 ms 384 KB
rnd9.txt AC 1 ms 384 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB