結果

問題 No.545 ママの大事な二人の子供
ユーザー mai
提出日時 2017-07-15 00:22:59
言語 C++17(1z)
(gcc 8.1.0)
結果
AC  
実行時間 27 ms
コード長 4,830 Byte
コンパイル時間 2,771 ms
使用メモリ 1,816 KB
最終ジャッジ日時 2018-07-13 13:30:28

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
challenge1.txt AC 3 ms
1,496 KB
challenge2.txt AC 2 ms
1,496 KB
challenge3.txt AC 3 ms
1,496 KB
challenge4.txt AC 3 ms
1,492 KB
test1.txt AC 2 ms
1,480 KB
test2.txt AC 3 ms
1,484 KB
test3.txt AC 3 ms
1,484 KB
test4.txt AC 2 ms
1,496 KB
test5.txt AC 2 ms
1,496 KB
test6.txt AC 3 ms
1,496 KB
test7.txt AC 2 ms
1,496 KB
test8.txt AC 3 ms
1,496 KB
test9.txt AC 3 ms
1,496 KB
test10.txt AC 2 ms
1,496 KB
test11.txt AC 3 ms
1,496 KB
test12.txt AC 3 ms
1,492 KB
test13.txt AC 3 ms
1,496 KB
test14.txt AC 5 ms
1,496 KB
test15.txt AC 9 ms
1,816 KB
test16.txt AC 8 ms
1,816 KB
test17.txt AC 8 ms
1,812 KB
test18.txt AC 2 ms
1,480 KB
test19.txt AC 12 ms
1,816 KB
test20.txt AC 26 ms
1,816 KB
test21.txt AC 12 ms
1,812 KB
test22.txt AC 25 ms
1,812 KB
test23.txt AC 25 ms
1,812 KB
test24.txt AC 25 ms
1,816 KB
test25.txt AC 27 ms
1,816 KB
test26.txt AC 24 ms
1,812 KB
test27.txt AC 25 ms
1,816 KB
test28.txt AC 25 ms
1,808 KB
テストケース一括ダウンロード
コンパイルメッセージ
main.cpp: メンバ関数 ‘\xe7\x84\xa1\xe5\x90\x8d}::MaiScanner& \xe7\x84\xa1\xe5\x90\x8d}::MaiScanner::operator>>(std::__cxx11::string&)’ 内:
main.cpp:63:9: 警告: 非 void を戻す関数内に return 文がありません [-Wreturn-type]
         }
         ^
main.cpp: 大域スコープ:
main.cpp:77:38: 警告: use of ‘auto’ in parameter declaration only available with -fconcepts
 ll t_search_proto(ll left, ll right, auto func) {
                                      ^~~~

ソースコード

diff #
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}}
#define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}}
#define debugaar(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

mt19937 mt(8901016);
inline int rand_int(int l, int h) {
    return uniform_int_distribution<>(l, h)(mt);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiablechar(cc); cc = getchar_unlocked());
            for (; isvisiablechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;



// 三分探索 しさくひん
// funcを最小化する値を求める.
// funcの極値は1つであること
// かなり無駄がありそう
ll t_search_proto(ll left, ll right, auto func) {

    repeat(30) {

        ll l = right - (2 * right - 2 * left) / 3;
        ll r = right - (right - left) / 3;

        ll lval = func(l);
        ll rval = func(r);
        // printf("%lld %lld ; %lld->%lld %lld->%lld\n", left, right,l,lval,r,rval);

        if (lval <= rval) {
            right = r;
        }
        else {
            left = l;
        }
        if (left == right)
            return left;
    }
    ll best = func(left);
    ll bestidx = left;
    for (ll t = left + 1; t <= right; ++t) {
        ll f = func(t);
        if (best > f) {
            best = f; bestidx = t;
        }
    }
    return bestidx;
}


ll n;

ll aa[40], bb[40];

namespace guchoku {
    ll memo[40];

    ll dfs(int idx = 0, ll a = 0, ll b = 0) {
        if (memo[idx] < abs(a - b)) return 1e15;
        if (idx == n)
            return abs(a - b);
        return min(dfs(idx + 1, a + aa[idx], b), dfs(idx + 1, a, b + bb[idx]));
    }
}

vector<ll> stacker;

void dfs_foward(int idx = 0, ll v = 0) {
    if (idx == 16) {
        stacker.push_back(v);
        return;
    }
    dfs_foward(idx + 1, v + aa[idx]), dfs_foward(idx + 1, v - bb[idx]);
}

ll dfs_backward(int idx = 16, ll v = 0) {
    if (idx == n) {
        int si = t_search_proto(0, stacker.size(), [&v](ll e) {return abs(v + stacker[e]); });
        return abs(v + stacker[si]);
    }
    return min(dfs_backward(idx + 1, v + aa[idx]), dfs_backward(idx + 1, v - bb[idx]));

}

int main() {
    scanner >> n;

    repeat(n) {
        scanner >> aa[cnt] >> bb[cnt];
    }

    repeat(40) {
        guchoku::memo[cnt] = 5e15; // 5000兆円欲しい!
    }
    if (n <= 18) {
        cout << guchoku::dfs() << endl;
    }
    else {
        stacker.reserve(200000);
        dfs_foward();
        sort(ALL(stacker));
        unique(ALL(stacker));
        //printf("%d\n",stacker[0]);
        cout << dfs_backward() << endl;
    }


    return 0;
}
0