結果

問題 No.3322 引っ張りだこ
コンテスト
ユーザー のらら
提出日時 2025-10-25 23:22:28
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,659 bytes
コンパイル時間 3,933 ms
コンパイル使用メモリ 194,476 KB
実行使用メモリ 34,900 KB
最終ジャッジ日時 2025-10-31 20:40:11
合計ジャッジ時間 16,928 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 21 WA * 22
権限があれば一括ダウンロードができます

ソースコード

diff # 

//貪欲法（端の処理をしないやつ）
//WA
#include <iostream>
#include <algorithm>
#include <atcoder/all>
#include <queue>
using namespace std;
using namespace atcoder;
using ll = long long;
const long long INF = 1000000000000000000;
//#define endl "\n";
using classPQ = tuple<ll, ll, ll, ll, ll>;
priority_queue<classPQ, vector<classPQ>, less<classPQ>> que;

int main(){
  ll Q;
  cin >> Q;
  for(int q = 1; q <= Q; q++){
    ll N, K;
    cin >> N >> K;
    vector<vector<ll>> A(N + 1, vector<ll>(2, 0));
    for(ll i = 1; i <= N; i++) cin >> A[i][0];
    for(ll i = 1; i <= N; i++) cin >> A[i][1];
    A[0][1] = -INF;
  
    vector<ll> l(N + 1, 0), r(N + 1, 0), tasu_a(N + 1, 0), tasu_b(N + 1, 0), selected(N + 1, 0);
    for(int i = 0; i <= N; i++){
      l[i] = i, r[i] = i;
      if(A[i][0] >= A[i][1]){
        tasu_a[i] = A[i][0];
        tasu_b[i] = A[i][1];
        selected[i] = 0;
      }else{
        tasu_a[i] = A[i][1];
        tasu_b[i] = A[i][0];
        selected[i] = 1;
      }
    }
    ll pos = 0, chg = 0, ans = 0;
    dsu d(N + 1);
    for(ll i = 1; i <= N; i++){
      if(selected[i - 1] !=  selected[i]){
        ll ld = d.leader(i - 1);
        ans += tasu_a[ld];
        chg++;
        que.push(make_tuple(tasu_b[ld] - tasu_a[ld], ld, l[ld], r[ld], selected[ld]));
        pos = (pos+1)%2;
      }else{
        ll ld1 = d.leader(i - 1);
        ll ld2 = d.leader(i);
        ll ld = d.merge(ld1, ld2);
        tasu_a[ld] = tasu_a[ld1] + tasu_a[ld2];
        tasu_b[ld] = tasu_b[ld1] + tasu_b[ld2];
        l[ld] = min(l[ld1], l[ld2]);
        r[ld] = max(r[ld1], r[ld2]);
        selected[ld] = pos;
        d.merge(ld1, ld2);
      }
    }
    ll restId = d.leader(N);
    que.push(make_tuple(tasu_b[restId] - tasu_a[restId], restId, l[restId], r[restId], selected[restId]));
    ans += tasu_a[restId];
  
    //cout << "chg=" << chg << " " << "ans=" << ans << endl;
    while(!que.empty()){
      auto [dd, tmpidx, tl, tr, sel] = que.top();
      ll idx = d.leader(tmpidx);
      que.pop();
      if(chg <= K) continue; //flip不要
      if(tl != l[idx] || tr != r[idx]) continue;
      ll chgplus = 0;
      ll ld1 = d.leader(max(0LL, tl - 1));
      ll ld2 = d.leader(min(N, tr + 1));
      if(selected[idx] != selected[ld1]) chgplus++;
      if(selected[idx] != selected[ld2]) chgplus++;
      if(chgplus <= 0) continue; //入らないはず
      //if(chg % 2 == K % 2 && chgplus == 1) continue; //もう1回余分にflipが必要になるのでやらない
      //cout << dd << " " << idx << " " << tl << " " << tr << " " << sel << " " << chg << endl;
      ans += dd;
      ll nextasu_a = tasu_b[idx], nextasu_b = tasu_a[idx];
      ll nexld = idx;
      if(selected[idx] != selected[ld1]){
        nextasu_a += tasu_a[ld1];
        nextasu_b += tasu_b[ld1];
        ll prenexld = d.leader(nexld);
        nexld = d.merge(prenexld, ld1);
        l[nexld] = min(l[prenexld], l[ld1]);
        r[nexld] = max(r[prenexld], r[ld1]);
      }
      if(selected[idx] != selected[ld2]){
        nextasu_a += tasu_a[ld2];
        nextasu_b += tasu_b[ld2];
        ll prenexld = d.leader(nexld);
        nexld = d.merge(prenexld, ld2);
        l[nexld] = min(l[prenexld], l[ld2]);
        r[nexld] = max(r[prenexld], r[ld2]);
      }
      selected[nexld] = (selected[idx] + 1) % 2;
      tasu_b[nexld] = nextasu_b;
      tasu_a[nexld] = nextasu_a;
      que.push(make_tuple(tasu_b[nexld] - tasu_a[nexld], nexld, l[nexld], r[nexld], selected[nexld]));
      chg -= chgplus;
    }
    pos = 0;
    while(pos <= N){
        ll idx = d.leader(pos);
        pos = r[idx] + 1;
    }
  
    cout << ans << endl;
  }
  return 0;
}
0