#1020165 (C++17) No.2918 Divide Applicants Fairly

提出ソース

結果

問題	No.2918 Divide Applicants Fairly
ユーザー	siganai
提出日時	2024-10-18 18:38:30
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	TLE (最新) AC (最初)
実行時間	-
コード長	5,835 bytes
コンパイル時間	2,817 ms
コンパイル使用メモリ	223,508 KB
実行使用メモリ	97,152 KB
最終ジャッジ日時	2024-11-08 00:07:54
合計ジャッジ時間	25,551 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 5,248 KB
testcase_01	AC	9 ms 5,248 KB
testcase_02	AC	8 ms 5,248 KB
testcase_03	AC	1,437 ms 81,536 KB
testcase_04	AC	890 ms 69,760 KB
testcase_05	AC	17 ms 5,248 KB
testcase_06	AC	21 ms 5,248 KB
testcase_07	AC	10 ms 5,248 KB
testcase_08	AC	11 ms 5,248 KB
testcase_09	AC	151 ms 28,288 KB
testcase_10	AC	1,884 ms 89,472 KB
testcase_11	AC	583 ms 54,400 KB
testcase_12	AC	120 ms 25,344 KB
testcase_13	AC	31 ms 5,376 KB
testcase_14	AC	21 ms 5,248 KB
testcase_15	AC	626 ms 62,080 KB
testcase_16	TLE	-
testcase_17	AC	108 ms 24,320 KB
testcase_18	AC	562 ms 54,400 KB
testcase_19	AC	7 ms 5,248 KB
testcase_20	AC	502 ms 50,688 KB
testcase_21	AC	108 ms 24,064 KB
testcase_22	AC	10 ms 5,248 KB
testcase_23	AC	150 ms 28,416 KB
testcase_24	AC	1,855 ms 89,344 KB
testcase_25	AC	681 ms 58,240 KB
testcase_26	AC	18 ms 5,248 KB
testcase_27	AC	410 ms 46,848 KB
testcase_28	AC	22 ms 5,248 KB
testcase_29	AC	30 ms 5,248 KB
testcase_30	AC	1,103 ms 77,440 KB
testcase_31	AC	36 ms 5,248 KB
testcase_32	TLE	-
testcase_33	AC	5 ms 5,248 KB
testcase_34	AC	5 ms 5,248 KB
testcase_35	AC	7 ms 5,248 KB
testcase_36	AC	272 ms 46,976 KB
testcase_37	AC	207 ms 43,008 KB
testcase_38	AC	171 ms 39,424 KB
testcase_39	AC	341 ms 62,080 KB
testcase_40	AC	138 ms 38,528 KB
testcase_41	AC	169 ms 42,496 KB
testcase_42	AC	194 ms 46,464 KB
testcase_43	AC	226 ms 50,432 KB
testcase_44	AC	266 ms 54,144 KB
testcase_45	AC	302 ms 57,984 KB
testcase_46	AC	1,101 ms 97,152 KB
testcase_47	AC	12 ms 5,248 KB
testcase_48	AC	89 ms 27,008 KB
testcase_49	AC	210 ms 43,136 KB
testcase_50	AC	14 ms 5,248 KB
testcase_51	AC	82 ms 27,008 KB
testcase_52	AC	185 ms 38,784 KB
testcase_53	AC	106 ms 30,976 KB
testcase_54	AC	109 ms 30,976 KB
testcase_55	AC	145 ms 34,944 KB
testcase_56	AC	140 ms 34,944 KB
testcase_57	AC	254 ms 46,464 KB
testcase_58	AC	152 ms 34,944 KB
testcase_59	AC	121 ms 34,688 KB
testcase_60	AC	27 ms 5,248 KB
testcase_61	AC	137 ms 34,816 KB
testcase_62	AC	99 ms 23,680 KB
testcase_63	AC	96 ms 23,552 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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 > 13) {
  			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_next(H2);j < 32000500;j = bs[0]._Find_next(j)) {
				int k = H2 + H2 - j;
				bs[0][k] = 1;
			}
			for (int j = bs[0]._Find_first();j < H2;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';
}

yukicoder

結果

テストケース

ソースコード