HELP : Solution giving TLE

→ Pay attention

Before contest
Codeforces Round (Div. 2)
5 days

→ Top rated

#	User	Rating
1	Benq	3792
2	VivaciousAubergine	3647
3	jiangly	3631
4	Kevin114514	3574
5	maroonrk	3521
6	strapple	3515
7	Radewoosh	3461
8	tourist	3428
9	turmax	3378
10	Um_nik	3376

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	Qingyu	162
2	adamant	148
3	Um_nik	146
4	Dominater069	143
5	errorgorn	140
6	cry	138
7	Proof_by_QED	136
8	YuukiS	135
9	chromate00	134
10	soullless	133

View all →

→ Find user

→ Recent actions

Detailed →

adityagamer's blog

HELP : Solution giving TLE

By adityagamer, 4 years ago, In English

This is my solution: Solution(Not visible) Check my code below

For question : Question

It is giving TLE on Test 3.

My code

void solve(){
  int k,i, j, q, x, y;
  int h, p;
  cin >> h >> p;
  auto MS = [&] (int n){
    int i = 0;
    while(n){
      i++;
      n >>= 1;
    }
    i--;
    return i;
  };
  int ms = MS(p)+1;
  if(h <= ms){
    print(h);
  } else{
    int ans = ms+((1<< h)-1 - ((1<<ms)-1)+p-1)/p;
    print(ans);
  }
}

My solution is in O(t.log(p)).

need help, tle

adityagamer
4 years ago
8

Comments (8)

Write comment?

beethoven97

4 years ago, hide # |

you solution can't open to other people so can you write your code in spoiler to check it?

→ Reply

adityagamer

4 years ago, hide # ^ |

Added my code. Thanks in advance

→ Reply

beethoven97

4 years ago, hide # |

add this line (ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);) to your code and see the result it will fast your input

→ Reply

margothequeen

4 years ago, hide # ^ |

cout.tie(0) does nothing

→ Reply

beethoven97

4 years ago, hide # ^ |

← Rev. 5 →

i just add the previous line and it give wrong answer instead of TLE

code

        // not my code
#include <bits/stdc++.h>

using namespace std;


void solve()
{
    int k,i, j, q, x, y;
    int h, p;
    cin >> h >> p;
    auto MS = [&] (int n)
    {
        int i = 0;
        while(n)
        {
            i++;
            n >>= 1;
        }
        i--;
        return i;
    };
    int ms = MS(p)+1;
    if(h <= ms)
    {
        cout<<h;
    }
    else
    {
        int ans = ms+((1<< h)-1 &mdash; ((1<<ms)-1)+p-1)/p;
        cout<<ans;
    }
    cout<<'\n';
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);;
    int t=1;
    cin>>t;
    while(t--)
    {
      solve();

    }
    return 0;
}

→ Reply