#919725 (C++14) No.2501 Maximum Inversion Number

• 問題: No.2501 Maximum Inversion Number
• ユーザー: 蜜蜂
• 提出日時: 2023-10-13 21:28:16
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 1,738 bytes
• コンパイル時間: 1,878 ms
• コンパイル使用メモリ: 174,096 KB
• 実行使用メモリ: 6,528 KB
• 最終ジャッジ日時: 2024-09-15 17:04:04
• 合計ジャッジ時間: 4,418 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
other	AC * 3 WA * 14

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
// g++-13 1.cpp -std=c++17 -O2 -I .
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/dsu>
#include <atcoder/modint>
using namespace atcoder;
using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;
 
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())
void solve(){
  int n;
  ll m;
  cin>>n>>m;
  vll l(n),r(n);
  ll lsum=0,rsum=0;
  rep(i,0,n){
    cin>>l[i];
    lsum+=l[i];
  }
  rep(i,0,n){
    cin>>r[i];
    rsum+=r[i];
  }
  if(m<lsum||rsum<m){
    cout<<-1<<endl;
    return;
  }
  ll ans=0;
  per(i,n-1,1){
    lsum-=l[i];
    rsum-=r[i];
    // lsum + cnt(i) <= m <= rsum + cnt(i)
    // m - rsum <= cnt(i) <= m - lsum
    ll cntl=m-rsum;
    ll cntr=m-lsum;
    cntl=max(cntl,l[i]);
    cntr=min(cntr,r[i]);
    if(cntl>cntr){
      cout<<-1<<endl;
      continue;
    }
    
    if((m+i)/(i+1)<cntl){
      ans+=cntl*(m-cntl);
      m-=cntl;
      continue;
    }
    else if(cntr<m/(i+1)){
      ans+=cntr*(m-cntr);
      m-=cntr;
      continue;
    }
    else{
      ans+=m/(i+1)*(m-m/(i+1));
      m-=m/(i+1);
    }
  }
  cout<<ans<<endl;
}
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;cin>>t;
  while(t--){
    solve();
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX