fork download 
  1. #include <bits/stdc++.h>
  2. #define ll long long
  3. #define ld long double
  4. #define fi first
  5. #define se second
  6. #define pii pair<ll ,ll>
  7. #define nmax int(1e6+7)
  8. #define oo (ll)(1e18)
  9. #define MOD (ll)(1e9+7)
  10. #define MASK(i) (1LL<<(i))
  11. #define BIT(x,i) (((x)>>(i))&1)
  12. #define all(v) (v).begin(),(v).end()
  13. #define pb push_back
  14. #define m_p make_pair
  15. #define pro "test"
  16. #define Kietej ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  17. using namespace std;
  18. ll t;
  19. ll numKeo1,numKeo2;
  20. ll numBua1,numBua2;
  21. ll numBao1,numBao2;
  22. int main()
  23. {
  24.     Kietej
  25.     if (fopen(pro ".inp", "r"))
  26.     {
  27.         freopen(pro ".inp", "r", stdin);
  28.         freopen(pro ".out", "w", stdout);
  29.     }
  30.     cin>>t;
  31.     while(t--)
  32.     {
  33.         cin>>numBua1>>numBao1>>numKeo1>>numBua2>>numBao2>>numKeo2;
  34.         ll r1=numBua1,p1=numBao1,s1=numKeo1,r2=numBua2,p2=numBao2,s2=numKeo2;
  35.         ll Max=0,Min=0;
  36.  
  37.         ll Bua_Keo_Max=min(numBua1,numKeo2);
  38.         ll Keo_Bao_Max=min(numKeo1,numBao2);
  39.         ll Bao_Bua_Max=min(numBao1,numBua2);
  40.         numBua1-=Bua_Keo_Max;numKeo2-=Bua_Keo_Max;
  41.         numKeo1-=Keo_Bao_Max;numBao2-=Keo_Bao_Max;
  42.         numBao1-=Bao_Bua_Max;numBua2-=Bao_Bua_Max;
  43.         Max=Max+2*(Bua_Keo_Max+Keo_Bao_Max+Bao_Bua_Max);
  44.         ll Bua_Bua_Max=min(numBua1,numBua2);
  45.         ll Keo_Keo_Max=min(numKeo1,numKeo2);
  46.         ll Bao_Bao_Max=min(numBao1,numBao2);
  47.         Max=Max+(Bua_Bua_Max+Keo_Keo_Max+Bao_Bao_Max);
  48.  
  49.  
  50.         numBua1=r1;numBao1=p1;numKeo1=s1;numBua2=r2;numBao2=p2;numKeo2=s2;
  51.         ll BuaKeoMin=min(numBua2,numKeo1);
  52.         ll KeoBaoMin=min(numKeo2,numBao1);
  53.         ll BaoBuaMin=min(numBao2,numBua1);
  54.         numBua2-=BuaKeoMin;numKeo1-=BuaKeoMin;
  55.         numKeo2-=KeoBaoMin;numBao1-=KeoBaoMin;
  56.         numBao2-=BaoBuaMin;numBua1-=BaoBuaMin;
  57.         ll Bua_Bua_Min=min(numBua1,numBua2);
  58.         ll Keo_Keo_Min=min(numKeo1,numKeo2);
  59.         ll Bao_Bao_Min=min(numBao1,numBao2);
  60.         numBua1-=Bua_Bua_Min;numKeo2-=Keo_Keo_Min;
  61.         numKeo1-=Keo_Keo_Min;numBao2-=Bao_Bao_Min;
  62.         numBao1-=Bao_Bao_Min;numBua2-=Bua_Bua_Min;
  63.         Min=Min+(Bua_Bua_Min+Keo_Keo_Min+Bao_Bao_Min);
  64.         ll Bua_Keo_Min=min(numBua1,numKeo2);
  65.         ll Keo_Bao_Min=min(numKeo1,numBao2);
  66.         ll Bao_Bua_Min=min(numBao1,numBua2);
  67.         Min=Min+2*(Bua_Keo_Min+Keo_Bao_Min+Bao_Bua_Min);
  68.         cout<<Max<<" "<<Min<<"\n";
  69.     }
  70.  
  71.     return 0;
  72. }
  73. // Code by TruongTuanKiet_1
  74.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
https://ideone.com/hfTrNJ
language:
C++14 (gcc 8.3)
created:
4 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!