結果
問題 | No.545 ママの大事な二人の子供 |
ユーザー | mai |
提出日時 | 2017-07-14 23:51:34 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,770 bytes |
コンパイル時間 | 3,636 ms |
コンパイル使用メモリ | 225,880 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-08 00:03:59 |
合計ジャッジ時間 | 5,517 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 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 | 3 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 3 ms
5,248 KB |
testcase_17 | AC | 3 ms
5,248 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 2 ms
5,248 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 97 ms
5,248 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
コンパイルメッセージ
main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)': main.cpp:62:9: warning: no return statement in function returning non-void [-Wreturn-type] 62 | } | ^ main.cpp: At global scope: main.cpp:76:38: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts' 76 | ll t_search_proto(ll left, ll right, auto func) { | ^~~~
ソースコード
#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 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(90) { 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 a = 0, ll b = 0) { if (idx == 15) { stacker.push_back((a - b)); return; } dfs_foward(idx + 1, a + aa[idx], b), dfs_foward(idx + 1, a, b + bb[idx]); } ll dfs_backward(int idx = 15, ll a = 0, ll b = 0) { if (idx == n) { ll ab = a - b; int si = t_search_proto(0, stacker.size(), [&ab](ll e) {return abs(ab - stacker[e]); }); return abs(ab-stacker[si]); } return min(dfs_backward(idx + 1, a + aa[idx], b), dfs_backward(idx + 1, a, b + bb[idx])); } int main() { scanner >> n; repeat(n) { scanner >> aa[cnt] >> bb[cnt]; } repeat(40) { guchoku::memo[cnt] = 5e15; // 5000兆円欲しい! } if (n <= 20) { cout << guchoku::dfs() << endl; } else { dfs_foward(); sort(ALL(stacker)); cout << dfs_backward() << endl; } vector<int> perm(n / 2); return 0; }