結果

問題 No.2918 Divide Applicants Fairly
ユーザー deuteridayodeuteridayo
提出日時 2024-10-07 23:55:50
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 6,786 bytes
コンパイル時間 6,728 ms
コンパイル使用メモリ 332,788 KB
実行使用メモリ 260,736 KB
最終ジャッジ日時 2024-10-07 23:56:29
合計ジャッジ時間 28,135 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 415 ms
159,744 KB
testcase_01 AC 416 ms
159,744 KB
testcase_02 AC 425 ms
159,744 KB
testcase_03 AC 404 ms
159,872 KB
testcase_04 AC 396 ms
159,872 KB
testcase_05 AC 423 ms
159,872 KB
testcase_06 AC 397 ms
159,872 KB
testcase_07 AC 407 ms
159,872 KB
testcase_08 AC 426 ms
159,744 KB
testcase_09 AC 411 ms
161,152 KB
testcase_10 AC 395 ms
159,744 KB
testcase_11 AC 1,148 ms
209,152 KB
testcase_12 AC 404 ms
160,384 KB
testcase_13 AC 411 ms
159,872 KB
testcase_14 AC 412 ms
159,872 KB
testcase_15 AC 401 ms
159,744 KB
testcase_16 AC 405 ms
159,744 KB
testcase_17 AC 409 ms
160,384 KB
testcase_18 AC 1,157 ms
208,128 KB
testcase_19 AC 405 ms
159,872 KB
testcase_20 AC 914 ms
192,896 KB
testcase_21 AC 399 ms
160,384 KB
testcase_22 AC 406 ms
159,872 KB
testcase_23 AC 404 ms
161,024 KB
testcase_24 AC 400 ms
159,744 KB
testcase_25 TLE -
testcase_26 AC 402 ms
159,872 KB
testcase_27 AC 628 ms
176,256 KB
testcase_28 AC 400 ms
159,744 KB
testcase_29 AC 394 ms
159,744 KB
testcase_30 AC 407 ms
159,872 KB
testcase_31 AC 399 ms
159,872 KB
testcase_32 AC 400 ms
159,872 KB
testcase_33 AC 407 ms
159,744 KB
testcase_34 AC 395 ms
160,000 KB
testcase_35 AC 404 ms
159,744 KB
testcase_36 AC 541 ms
172,032 KB
testcase_37 AC 433 ms
162,176 KB
testcase_38 AC 420 ms
161,280 KB
testcase_39 AC 427 ms
159,872 KB
testcase_40 AC 418 ms
159,744 KB
testcase_41 AC 425 ms
159,744 KB
testcase_42 AC 457 ms
159,872 KB
testcase_43 AC 472 ms
159,872 KB
testcase_44 AC 556 ms
160,000 KB
testcase_45 AC 634 ms
159,872 KB
testcase_46 AC 426 ms
159,872 KB
testcase_47 AC 426 ms
159,744 KB
testcase_48 AC 414 ms
161,024 KB
testcase_49 AC 463 ms
161,536 KB
testcase_50 AC 398 ms
160,000 KB
testcase_51 AC 410 ms
160,128 KB
testcase_52 AC 465 ms
165,248 KB
testcase_53 AC 403 ms
160,512 KB
testcase_54 AC 416 ms
160,384 KB
testcase_55 AC 431 ms
161,024 KB
testcase_56 AC 427 ms
160,640 KB
testcase_57 AC 569 ms
175,616 KB
testcase_58 AC 456 ms
161,280 KB
testcase_59 AC 431 ms
163,200 KB
testcase_60 AC 426 ms
159,744 KB
testcase_61 AC 441 ms
160,768 KB
testcase_62 AC 410 ms
160,512 KB
testcase_63 AC 424 ms
160,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
using llint = __int128_t;
struct edge;
using graph = vector<vector<edge>>;
#define endl '\n'
constexpr int INF = 1<<30;
constexpr lint INF64 = 1LL<<61;
constexpr lint mod107 = 1e9+7;
using mint107 = modint1000000007;
constexpr long mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x) {assert(x >= 0); lint ans = sqrt(x); while(ans*ans > x)ans--; while((ans+1)*(ans+1)<=x)ans++; return ans;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
double Dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
lint DistSqr(lint x1, lint y1, lint x2, lint y2){return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2); }
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= p;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define rrep(i, x) for(int i = x-1; i >= 0; i--)
#define vec vector
#define pb push_back
#define eb emplace_back
#define se second
#define fi first
#define al(x) x.begin(),x.end()
#define ral(x) x.rbegin(),x.rend()
unsigned long Rand() {
    static random_device seed;
    static mt19937_64 engine(seed());
    return engine();
}

struct Point {
    lint x, y; int quad;
    Point(lint X, lint Y) {
        x = X;
        y = Y;
        quad = getQuad();
    }
    int getQuad() {
        if(x >= 0) {
            if(y >= 0) return 1;
            else return 4;
        } else {
            if(y >= 0) return 2;
            else return 3;
        }
    }
};

bool operator<(const Point &left, const Point &right) {
    if(left.quad == right.quad) {
        return left.y * right.x < left.x * right.y;
    } else {
        return left.quad < right.quad;
    }
}

struct Frac {
    lint upper, lower;
    Frac() { Frac(0,1); }
    Frac(lint u, lint l) {
        assert(l != 0);
        if(u <= 0 && l < 0) { upper = -u; lower = -l; } 
        else { upper = u; lower = l; }
        reduction();
    }

    Frac(lint u) { upper = u;  lower = 1;  } 

    void reduction() {
        if(upper != 0) {
            lint g = gcd(abs(upper), abs(lower));
            upper /= g; lower /= g;
            if(lower < 0) {lower *= -1;  upper *= -1; }
        } else {
            lower = 1; 
        }
    }

    Frac operator+(const Frac &other) {
        lint L = lower * other.lower;
        lint U = upper*other.lower + lower*other.upper;
        return Frac(U, L);
    }

    Frac operator-(const Frac &other) {
        lint L = lower * other.lower;
        lint U = upper*other.lower - lower*other.upper;
        upper = U; lower = L;
        return Frac(U, L);
    }

    bool operator<=(const Frac &other) {
        return upper*other.lower <= lower*other.upper;
    }

    Frac operator*(const Frac &other) {
        lint L = lower * other.lower;
        lint U = upper * other.upper;
        return Frac(U, L);
    }

    Frac operator/(const Frac &other) {
        assert(other.upper != 0);
        lint L = lower * other.upper;
        lint U = upper * other.lower;
        return Frac(U, L);
    }
};

bool operator<(const Frac &left, const Frac &right) {
    llint L = left.upper;
    L *= right.lower;
    llint R = right.upper;
    R *= left.lower;
    return L < R;
}

lint extGCD(lint a, lint b, lint &x, lint &y) {
    if (b == 0) {
        x = 1;  y = 0;
        return a;
    }
    lint d = extGCD(b, a%b, y, x);
    y -= a/b * x;
    return d;
}

struct edge{
    edge(lint v, lint c = 1) {to = v, cost = c;}
    lint to;
    lint cost;
};

vector<lint>dijkstra(int s, graph &g) {
    vec<lint>ret(g.size(), INF64);
    priority_queue<pair<lint, lint>>que;
    que.push({-0, s});
    ret[s] = 0;
    vec<bool>went(g.size(), false);
    while(!que.empty()) {
        auto q = que.top();
        que.pop();
        if(went[q.second]) continue;
        went[q.second] = true;
        ret[q.second] = -q.first;
        for(auto&& e: g[q.second]) {
            if(ret[e.to] > -q.first + e.cost) {
                ret[e.to] = -q.first + e.cost;
                que.push({-ret[e.to], e.to});
            }
        }
    }
    return ret;
}

map<int, set<lint>> f(vec<lint>&R) {
    int n = R.size();
    map<int, set<lint>>mp;
    lint P = 1; rep(i, n) P *= 3;

    repp(s,1, P) {
        lint S = s;
        int cnt = 0;
        lint summ = 0;
        rep(i, n) {
            if(S % 3 == 1) {
                cnt++;
                summ += R[i];
            }  else if(S % 3 == 2) {
                cnt--;
                summ -= R[i];
            } 
            S /= 3;
        }
        mp[cnt].insert(summ);
    }
    repp(i, -20, 21){
        mp[i].insert(-INF64);
        mp[i].insert(INF64);
    }
    return mp;

}

int main(){
    int maxx = INF;

    for(int i = 2; i <= 40; i += 2) {
        if(ncrmodp(i, i/2, mod) > i*400000) {
            maxx = i;break;
        }
    }
    int n;
    cin >> n;

    vec<lint>R(n);
    rep(i, n) {
        cin >> R[i];
    }

    if(n >= maxx) {
        cout << 0 << endl;
        return 0;
    }

    vec<lint>R1, R2;
    rep(i, n) {
        if(i*2 < n) R1.pb(R[i]);
        else R2.pb(R[i]);
    }

    auto t1 = f(R1);
    auto t2 = f(R2);

    lint ans = INF64;
    for(lint v: t1[0]) ans = min(ans, abs(v));
    for(lint v: t2[0]) ans = min(ans, abs(v));
    for(int i = -20; i <= 20; i++) {
        for(lint v: t1[i]) {
            if(abs(v) >= INF64)continue;
            auto it = t2[-i].lower_bound(-v);
            ans = min(ans, abs(v + *it));
            it--;
            ans = min(ans, abs(v + *it));
        }
    }
    cout << ans << endl;
    

}
0