提出 #67001994

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

using ll=long long;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using P=pair<int,int>;
using vi=vc<int>;

void solve(){
    int n;
    cin>>n;
    vc<int> A(n),B(n),C(n);
    ll S=0,T=0;
    ll c=0;
    for(int i=0;i<n;i++){
        cin>>A[i]>>B[i]>>C[i];
        int e=min(B[i],C[i]);
        S+=e;
        B[i]-=e;
        int f=min(A[i],B[i]);
        T+=f;
        A[i]-=f;
        c+=min(A[i],e);
    }
    if(S>T){
        ll d=(S-T)/2;
        S-=min(c,d);
        T+=min(c,d);
    }
    cout<<min(S,T)<<endl;
}
int main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
    int T;
    cin>>T;
	while(T--) solve();
}

提出情報

ジャッジ結果