結果

問題 No.2918 Divide Applicants Fairly
ユーザー siganaisiganai
提出日時 2024-10-18 18:29:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 5,722 bytes
コンパイル時間 2,582 ms
コンパイル使用メモリ 211,428 KB
実行使用メモリ 97,120 KB
最終ジャッジ日時 2024-10-18 18:29:50
合計ジャッジ時間 27,345 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
9,572 KB
testcase_01 AC 11 ms
11,624 KB
testcase_02 AC 8 ms
9,576 KB
testcase_03 AC 1,595 ms
79,704 KB
testcase_04 AC 1,013 ms
68,208 KB
testcase_05 AC 20 ms
14,044 KB
testcase_06 AC 23 ms
16,104 KB
testcase_07 AC 12 ms
11,804 KB
testcase_08 AC 13 ms
11,936 KB
testcase_09 AC 214 ms
31,744 KB
testcase_10 TLE -
testcase_11 AC 702 ms
57,048 KB
testcase_12 AC 121 ms
22,824 KB
testcase_13 AC 33 ms
18,412 KB
testcase_14 AC 23 ms
16,256 KB
testcase_15 AC 693 ms
62,424 KB
testcase_16 TLE -
testcase_17 AC 122 ms
22,444 KB
testcase_18 AC 669 ms
56,520 KB
testcase_19 AC 8 ms
9,704 KB
testcase_20 AC 615 ms
52,704 KB
testcase_21 AC 106 ms
22,464 KB
testcase_22 AC 11 ms
11,784 KB
testcase_23 AC 170 ms
31,900 KB
testcase_24 TLE -
testcase_25 AC 772 ms
58,376 KB
testcase_26 AC 19 ms
14,024 KB
testcase_27 AC 519 ms
50,812 KB
testcase_28 AC 23 ms
16,116 KB
testcase_29 AC 31 ms
18,216 KB
testcase_30 AC 1,225 ms
73,976 KB
testcase_31 AC 40 ms
18,324 KB
testcase_32 TLE -
testcase_33 AC 6 ms
9,564 KB
testcase_34 AC 5 ms
7,536 KB
testcase_35 AC 6 ms
9,608 KB
testcase_36 AC 256 ms
50,956 KB
testcase_37 AC 197 ms
46,904 KB
testcase_38 AC 154 ms
45,024 KB
testcase_39 AC 305 ms
62,396 KB
testcase_40 AC 102 ms
45,060 KB
testcase_41 AC 125 ms
47,020 KB
testcase_42 AC 152 ms
50,796 KB
testcase_43 AC 187 ms
52,648 KB
testcase_44 AC 210 ms
56,700 KB
testcase_45 AC 238 ms
58,356 KB
testcase_46 AC 1,047 ms
97,120 KB
testcase_47 AC 11 ms
11,624 KB
testcase_48 AC 83 ms
32,952 KB
testcase_49 AC 205 ms
46,848 KB
testcase_50 AC 15 ms
13,668 KB
testcase_51 AC 67 ms
31,696 KB
testcase_52 AC 176 ms
45,160 KB
testcase_53 AC 83 ms
39,376 KB
testcase_54 AC 97 ms
39,308 KB
testcase_55 AC 135 ms
41,092 KB
testcase_56 AC 129 ms
41,276 KB
testcase_57 AC 256 ms
50,888 KB
testcase_58 AC 171 ms
41,072 KB
testcase_59 AC 100 ms
41,128 KB
testcase_60 AC 31 ms
17,780 KB
testcase_61 AC 118 ms
41,132 KB
testcase_62 AC 100 ms
22,276 KB
testcase_63 AC 93 ms
22,076 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "main.cpp"
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vul = vector<ull>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i) , end(i)
#define all2(i,a) begin(i) , begin(i) + a
#define all3(i,a,b) begin(i) + a , begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){return *min_element(all(a));}
template<class T> auto max(const T& a){return *max_element(all(a));}
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}
void Yes() {cout << "Yes\n";return;}
void No() {cout << "No\n";return;}
void YES() {cout << "YES\n";return;}
void NO() {cout << "NO\n";return;}
template <typename T>
T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}
template <typename T>
T ceil(T x, T y) {return floor(x + y - 1, y);}
template <typename T>
T bmod(T x, T y) {return x - y * floor(x, y);}
template <typename T>
pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} 
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
constexpr long double PI = 3.141592653589793238462643383279L;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};

//constexpr int mod = 998244353;
constexpr int mod = 1000000007;
bitset<32000500> bs[21];
int H2 = 32000500 / 2;
int main() {
	INT(n);
	VEC(int,r,n);
	sort(all(r),greater<int>());
	int kans = 1e9;
	rep(i,1,n) chmin(kans,r[i-1]-r[i]);
	rep(i,n) {
		if(i > 0) {
		  if(i > 15) {
  			rrep(j,i+1) {
  				if(j - (n - i) > 0) continue;
  				if(j + 1 - (n - i - 1) <= 0) bs[j+1] |= bs[j] << r[i];
  			}
  			rep(j,1,i+1) {
  				if(j - (n - i) > 0) continue;
  				bs[j-1] |= bs[j] >> r[i];
  			}
		  }
		  else {
		    rrep(j,i+1) {
		      if(j - (n - i) > 0) continue;
		      if(j + 1 - (n - i - 1) <= 0) {
		        for(int k = bs[j]._Find_first();k + r[i] < 32000500;k = bs[j]._Find_next(k)) {
		          bs[j+1][k + r[i]] = 1;
		        }
		      }
		    }
		    rep(j,1,i+1) {
		      if(j - (n - i) > 0) continue;
		        for(int k = bs[j]._Find_next(r[i] - 1);k < 32000500;k = bs[j]._Find_next(k)) {
		          bs[j-1][k - r[i]] = 1;
		      }
		    }
		  }
			for (int j = bs[0]._Find_first();j < 32000500;j = bs[0]._Find_next(j)) {
				int k = H2 + H2 - j;
				bs[0][k] = 1;
			}
		}
		bs[1][r[i]+H2] = 1;
	}
	int ans = kans;
	rep(i,H2-kans,H2+kans+1) {
		if(bs[0][i]) chmin(ans,(int)abs(H2-i));
	}
	cout << ans << '\n';
}
0