1244B - Rooms and Staircases - CodeForces Solution

brute force implementation *1000

Please click on ads to support us..

Python Code: 

for i in range(int(input())):
    w=int(input())
    e=input()
    if '1' in e:
        r=min(e.index('1'),e[::-1].index('1'))
        print(2*(w-r))
    else:
        print(w)

C++ Code: 

#include<bits/stdc++.h>
using namespace std;
#define int long long
 
int32_t main(){
     ios_base::sync_with_stdio(false);
     cin.tie(NULL);
    int t;cin>>t;
    while(t--){
     int n;cin>>n;
     string s;cin>>s;
     int x=s.length();
    
     if(s[0]=='1'|| s[x-1]=='1')cout<<2*n<<endl;
     else{
         int y=0;
         for(int i=0;i<x-1;i++){
             if(s[i]=='1')y++;
         }
         int ans=n+y;
     for(int i=0;i<x;i++){
         if(s[i]=='1')ans=max(ans,max(2*(i+1),2*(x-i)));
     }
     cout<<ans<<endl;
     }
    }
  return 0;
}


Comments

Submit
0 Comments
More Questions

1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion
1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals
1035. Uncrossed Lines
328. Odd Even Linked List
1219. Path with Maximum Gold