Cinema

Problem Description

Probably everyone has experienced an awkward situation due to shared armrests between seats in cinemas. A highly accomplished cinema manager named "Chef" decided to solve this problem.

When a customer wants to buy a ticket, the clerk at the ticket window asks the visitor if they need the armrests, and if so, which of them: left, right, or both. We know that out of the audience expected to show up, L of them only need the left armrest, R of them need just the right one, Z need none and B need both. Your task is to calculate the maximum number of people that can attend the show. In the cinema hall there are N rows with M seats each. There is only one armrest between two adjacent seats. Seats at the beginning and at the end of the row have two armrests

Input
Input begins with an integer T: the number of test cases.
Each test case consists of a single line with 6 space-separated integers: N, M, Z, L, R, B.

Output
For each test case, output a line containing the answer for the task.

Explanation
'L' - needs left
'R - needs right
'Z' - doesn't need any
'B' - needs both
'-' - empty place
Example case 1.
ZZ
ZB
Example case 2.
LLB
BZB
B-B

• Test Case 1

  
  Input (stdin)

  2
  
  2 2 3 2 1 1
  
  3 3 1 2 0 9
  
  

  Expected Output

  4
  
  8

• Test Case 2

  
  Input (stdin)

  2
  
  2 3 3 2 2 1
  
  3 1 1 2 0 9
  
  

  Expected Output

  6
  
  3

• Program

• #include <stdio.h>
  int main()
  {
      int t;
      scanf("%d",&t);
      while(t--)
      {
          long long int n,m,z,l,r,b,max=0;
          scanf("%lld %lld %lld %lld %lld %lld",&n,&m,&z,&l,&r,&b);
          long long int i,j;
          char x;
          for(i=0;i<n;i++)
          {
              for(j=0;j<m;j++)
              {
                  if(j==0)
                  {
                      if(r>0)
                      {
                          x='R';
                          r--;
                          max++;
                      }
                      else if(b>0)
                      {
                          x='B';
                          b--;
                          max++;
                      }
                      else if(l>0)
                      {
                          x='L';
                          l--;
                          max++;
                      }
                      else if(z>0)
                      {
                          x='Z';
                          z--;
                          max++;
                      }
                      else
                      {
                          x='O';
                      }
                  }
                  else
                  {
                      if(x=='B'||x=='L')
                      {
                          if(l>0)
                          {
                          x='L';
                          l--;
                          max++;
                          }
                          else if(z>0)
                          {
                          x='Z';
                          z--;
                          max++;
                          }
                          else
                          {
                           x='O';
                          }
                      }
                      else if((x='R')||(x=='Z')||(x=='O'))
                      {
                          if(j==m-1||x=='O')
                          {
                              if(b>0)
                              {
                                  x='B';
                                  b--;
                                  max++;
                              }
                              else if(l>0)
                              {
                                  x='L';
                                  l--;
                                  max++;
                              }
                              else if(r>0)
                              {
                                  x='R';
                                  r--;
                                  max++;
                              }
                              else if(z>0)
                              {
                                  x='Z';
                                  z--;
                                  max++;
                              }
                              else
                              {
                                  x='O';
                              }
                          }
                          else
                          {
                              if(r>0)
                              {
                                  x='R';
                                  r--;
                                  max++;
                              }
                              else if(b>0)
                              {
                                  x='B';
                                  b--;
                                  max++;
                              }
                              else if(l>0)
                              {
                                  x='L';
                                  l--;
                                  max++;
                              }
                              else if(z>0)
                              {
                                  x='Z';
                                  z--;
                                  max++;
                              }
                              else
                              {
                                  x='O';
                              }
                          }
                      }
                  }
              }
          }
          printf("%lld\n",max);
      }
      return 0;
  }
  

•