#92825 (C++14) No.370 道路の掃除

• 問題: No.370 道路の掃除
• ユーザー: 小指が強い人
• 提出日時: 2016-05-18 16:40:43
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,472 bytes
• コンパイル時間: 1,764 ms
• コンパイル使用メモリ: 175,332 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-06 05:32:26
• 合計ジャッジ時間: 2,918 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	WA	-
testcase_10	AC	2 ms; 5,248 KB
testcase_11	WA	-
testcase_12	AC	2 ms; 5,248 KB
testcase_13	WA	-
testcase_14	AC	2 ms; 5,248 KB
testcase_15	WA	-
testcase_16	AC	2 ms; 5,248 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-

ソースコード

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, char* c = " "){cout << a[0];for(int i = 1; i < a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

int n,m;
ll a[1000];
ll MAX_VALUE=99999999999;

ll solve(ll pos,int l,int r,int i)
{
    if(i>=n)return 0;
    ll lv = MAX_VALUE;
    ll rv = MAX_VALUE;
    if(l>=0)
        lv=abs(a[l]-pos);
    if(r<m)
        rv=abs(a[r]-pos);
    ll res=MAX_VALUE;
    if(lv<rv)
        res=solve(a[l],l-1,r,i+1)+lv;
    else if(lv>rv)
        res=solve(a[r],l,r+1,i+1)+rv;
    else{
        res=solve(a[l],l-1,r,i+1)+lv;
        res=min(res,solve(a[r],l,r+1,i+1)+rv);
    }
    return res;
}

int main(void)
{
    cin>>n>>m;
    rep(i,m)cin>>a[i];
    sort(a,a+m);
    int mid=-1;
    rep(i,m)
        if(a[i]>=0){
            mid=i;
            break;
        }
    if(mid==-1)mid=m;
    cout<<solve(0,mid-1,mid,0)<<endl;
    return 0;
}