結果
問題 | No.545 ママの大事な二人の子供 |
ユーザー | daleksprinter |
提出日時 | 2018-10-08 04:09:14 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 24 ms / 2,000 ms |
コード長 | 2,893 bytes |
コンパイル時間 | 1,660 ms |
コンパイル使用メモリ | 177,104 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-10-12 14:26:56 |
合計ジャッジ時間 | 2,700 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 32 |
ソースコード
#include <bits/stdc++.h>using namespace std;/* macro */#define rep(i,a,b) for(int i=a;i<b;i++)#define revrep(i,a,b) for(int i = a; i > b; i--)#define int long long#define exist(s,e) ((s).find(e)!=(s).end())#define all(v) (v).begin(), (v).end()#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)#define sum(v) accumulate(all(v), (0LL))#define sort(v) sort(all(v))/* constant */const int inf = 100100100100100100;const int mod = 1000000007;int dx[8]={1,0,-1,0,-1,1,-1,1};int dy[8]={0,1,0,-1,-1,-1,1,1};/* io_method */int input(){int tmp;cin >> tmp;return tmp;}string raw_input(){string tmp;cin >> tmp;return tmp;}string readline(){string s;getline(cin, s);return s;}template<class T> void printx(T n){cout << n;}template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}template<class T> void print(T n){printx(n);cout << endl;}template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" <<endl;}/* general_method */template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }/* math_library */int ceil(int a, int b){if(a % b == 0){return a/b;}else{return a/b + 1;}}/* main */signed main(){cin.tie(0);ios::sync_with_stdio(false);int n = input();vector<pair<int, int> > a;vector<pair<int, int> > b;rep(i,0,n/2){int x, y; cin >> x >> y;a.push_back(make_pair(x,y));}rep(i,n/2, n){int x, y; cin >> x >> y;b.push_back(make_pair(x,y));}vector<int> diffa;vector<int> diffb;rep(i,0,(1<< n/2)){int x = 0, y = 0;rep(j,0,n/2){if(i & (1 << j)){x += a[j].first;}else{y += a[j].second;}}diffa.push_back(x - y);}rep(i,0, (1<< (n - n/2))){int x = 0, y = 0;rep(j,0,(n-n/2)){if(i & (1<< j)){x += b[j].first;}else{y += b[j].second;}}diffb.push_back(x - y);}sort(diffa);sort(diffb);int mindiff = inf;rep(i,0,diffa.size()){auto tmp = lower_bound(all(diffb), -diffa[i]);if(tmp != diffa.begin() && abs(diffa[i] + *tmp) > abs(diffa[i] + *(tmp-1))) tmp--;chmin(mindiff, abs(diffa[i] + *tmp));}print(mindiff);}