結果

問題 No.2501 Maximum Inversion Number
ユーザー woodywoodywoodywoody
提出日時 2023-10-14 12:51:18
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 393 ms / 2,000 ms
コード長 6,045 bytes
コンパイル時間 4,005 ms
コンパイル使用メモリ 236,740 KB
実行使用メモリ 13,164 KB
最終ジャッジ日時 2024-09-16 07:39:55
合計ジャッジ時間 6,014 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 45 ms
5,376 KB
testcase_02 AC 101 ms
5,376 KB
testcase_03 AC 58 ms
5,376 KB
testcase_04 AC 65 ms
9,856 KB
testcase_05 AC 46 ms
8,840 KB
testcase_06 AC 78 ms
11,048 KB
testcase_07 AC 63 ms
6,340 KB
testcase_08 AC 37 ms
5,376 KB
testcase_09 AC 26 ms
5,376 KB
testcase_10 AC 50 ms
5,376 KB
testcase_11 AC 70 ms
6,112 KB
testcase_12 AC 57 ms
6,000 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 97 ms
13,164 KB
testcase_15 AC 55 ms
5,376 KB
testcase_16 AC 393 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

void solve(){
    int n,m; cin>>n>>m;
    vl l(n), r(n);
    rep(i,n) cin>>l[i];
    rep(i,n) cin>>r[i];

    ll suml = sumv(l);
    ll sumr = sumv(r);
    if (suml > m) retval(-1);
    if (sumr < m) retval(-1);

    auto check = [&](ll mid)->bool{
        ll sum = 0;
        rep(i,n){
            if (mid <= l[i]) sum += l[i];
            else if(mid >= r[i]) sum += r[i];
            else sum += mid;
        }
        return (sum<=m);
    };
    ll bsl = 0, bsu = 2e9;
    if (check(bsu)){
        assertmle(sumv(r)==m);
        ll ans = 0;
        rep(i,n){
            ans += (m-r[i])*r[i];
        }
        ans /= 2;
        out;
        return;
    }
    while(bsu-bsl>1){
        ll mid = (bsl+bsu)/2;
        if (check(mid)) bsl = mid;
        else bsu = mid;
    }
    ll res = m;
    mpq<pll> q;
    vl v;
    rep(i,n){
        ll tmp = 0;
        if (l[i] >= bsl) tmp = l[i];
        else if(r[i] <= bsl) tmp = r[i];
        else tmp = bsl;
        res -= tmp;
        if (tmp == r[i]){
            v.pb(r[i]);
        }else{
            q.push({tmp,r[i]});
        }
    }
    asserttle(res>=0);
    while(sz(q) && res){
        pll p = q.top();
        q.pop();
        res--;
        pll nxt = {p.fi+1, p.se};
        if (nxt.fi == nxt.se) v.pb(nxt.fi);
        else q.push(nxt);
    }
    while(sz(q)){
        v.pb(q.top().fi);
        q.pop();
    }
    assert(sumv(v)==m);
    assert(sz(v)==n);
    ll ans = 0;
    rep(i,n){
        ans += (m-v[i])*v[i];
    }
    ans /= 2;
    out;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0