Link to the Problem: Number of Steps

#include <bits/stdc++.h>

using namespace std;

void solve(){
    int n,maxi=INT_MIN;
    cin>>n;
    vector<int> a(n,0),b(n,0);
    for (int i = 0; i < n; i++)
    {
        cin>>a[i];
        maxi=max(maxi,a[i]);
    }
    vector<int> freq_map(maxi+1,0);
    for (int i = 0; i < n; i++)
    {
        cin>>b[i];
        int temp = a[i];
        freq_map[a[i]]++;
        while (a[i]>b[i])
        {
            freq_map[a[i]-b[i]]++;
            a[i]-=b[i];
        }
        a[i]=temp;
    }
    int ans=0,fin=-1;
    for (int i=maxi;i>=0;i--)
    {
        if(freq_map[i]==n){
            fin=i;
        }
    }
    if(fin==-1){
        cout<<-1<<endl;
        return;
    }
    for (int i = 0; i < n; i++)
    {
        ans+= (a[i]-fin)/b[i];
    }
    cout<<ans<<endl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);   
    // freopen ("text_file.txt", "r", stdin);
    int t=1;
    // cin>>t;
    for (int i = 0; i < t; i++)
    {
        solve();
    }

    return 0;
}

It is giving me WA on Input #4 and TLE on Input #5 and Input #6. I tried for hours but was unable to find a problem with my solution. And even in the worst-case scenario where

n = 5000
every ai=5000
every bi = 1

It has an O(n*max(ai)) solution which should be feasible for these constraints. A hint or Advice is appreciated.

No one liked it. So, I guess I'm doing virtual contests then.

Hi, Codeforces community,

Getting straight to the point. Is there any way to have virtual participation in Google Kick start? Because there isn't any similar option on the Kick start website. Or is there a private group that hosted the Google Kick start problem for competition within their group (If there is any please share the link)?

Another important thing I have wanted to ask for a long time is how difficult google Kick start questions are in comparison to the DIV2 contest on codeforces. I am usually only able to solve A and B during contests so, I can't exactly decide its difficulty on my own.

Thank you.

Hi, Codeforces community,

I'm trying to improve my Dynamic programming. I'm able to solve DP problems under 1100-1200 but struggle with DP problems above that rating (When I don't know I have to use DP). The major problem I'm having and which I want to ask with the help of this blog is how to practice to improve?

When I practice DP by searching DP problems specifically by tags I simply don't see improvement because I know I have to apply DP. And came to the conclusion that I can solve the DP problem but just don't know when to use DP. So, How should I practice to improve this? I know Practice is the solution but guidance on how Should I practice would be helpful.