提出 #67002046

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define mk make_pair
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define bi __int128_t
#define lb(x) ((x)&(-(x)))
#define gp(i,j) (((i)>>(j-1))&1)
#define ppc __builtin_popcount
#define ctz __builtin_ctz
#define db long double
using namespace std;
const int N=2e5+10,mod=1e9+7,inf=1e9+10;
const db eps=1e-8;
bool Mbg;
void Add(int &a,int b){a+=b;if(a>=mod) a-=mod;}
void Sub(int &a,int b){a-=b;if(a<0) a+=mod;}
void Mul(int &a,int b){a=1ll*a*b%mod;}
int qp(int a,int b){
    int x=1;
    while(b){
        if(b&1) Mul(x,a);
        Mul(a,a);b>>=1;
    }return x;
}
int n;
void slv(){
    ll cnt1=0,cnt2=0,w=0;
    cin>>n;
    for(int i=1;i<=n;i++){
        int a,b,c;cin>>a>>b>>c;
        int p1=min(a,b),p2=min(c,b);
        int q1=min(c,b-p1),q2=min(a,b-p2);
        cnt1+=p1,cnt2+=q1;w+=p1-q2;
    }
    ll mn=cnt1-w,mx=cnt1;
    ll val=(cnt1+cnt2)/2,ans=0;
    if(mn<=val&&val<=mx) ans=max(ans,min(cnt1+cnt2-val,val));
    if(mn<=val+1&&val+1<=mx) ans=max(ans,min(cnt1+cnt2-val-1,val+1));
    ans=max(ans,min(mn,cnt1+cnt2-mn));
    ans=max(ans,min(mx,cnt1+cnt2-mx));
    cout<<ans<<endl;
}
bool Med;
int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t=1;cin>>t;
    while(t--) slv();
    cout.flush();
    cerr<<clock()*1.0/CLOCKS_PER_SEC<<' '<<(&Mbg-&Med)/1024.0/1024.0<<endl;
    return 0;
}

提出情報

ジャッジ結果