/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 196ms 34.312 MiB
#2 Accepted 208ms 34.254 MiB
#3 Accepted 214ms 34.391 MiB
#4 Accepted 266ms 34.27 MiB
#5 Accepted 324ms 34.336 MiB
#6 Accepted 325ms 34.777 MiB
#7 Accepted 323ms 36.02 MiB
#8 Accepted 284ms 35.93 MiB
#9 Accepted 274ms 36.012 MiB
#10 Accepted 262ms 36.02 MiB
#11 Accepted 258ms 35.84 MiB
#12 Wrong Answer 319ms 35.816 MiB
#13 Accepted 332ms 35.867 MiB
#14 Accepted 319ms 37.488 MiB
#15 Accepted 348ms 34.77 MiB
#16 Accepted 315ms 34.777 MiB
#17 Accepted 637ms 34.805 MiB
#18 Accepted 353ms 34.785 MiB
#19 Accepted 348ms 34.797 MiB
#20 Accepted 335ms 34.773 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
vector<ll>ar[200003];
ll dis[200003];
ll mxN=200000;
void seive()
{
    for(int i=1;i<mxN;i++)
    {
        for(int j=i;j<mxN;j+=i)
        {
            ar[j].push_back(i);
        }
    }
}
int main()
{
    ll tc;
    cin>>tc;
    seive();
    while(tc--)
    {
        ll n,k;
        cin>>n>>k;
        vector<ll>v(n),dp(n+1,2e9);
        for(int i=0;i<n;i++)
            cin>>v[i];
        dp[0]=0;
        for(int i=1;i<=mxN;i++)
        {
            dis[i]=2e9;
           
        }
        for(auto it:ar[v[0]])
        {
            dis[it]=min(dis[it],v[0]/it);
        }
        for(int i=1;i<n;i++)
        {
            dp[i]=min(dp[i],dp[i-1]+k);
            for(auto it:ar[v[i]])
            {
                dp[i]=min(dp[i],dis[it]);
            }
            for(auto it:ar[v[i]])
            {
                dis[it]=min(dis[it],dp[i]+(v[i]/it));
            }
        }
        cout<<dp[n-1]<<endl;
    }
    
}

Information

Submit By
Type
Submission
Problem
P1099 Which way to go
Language
C++17 (G++ 13.2.0)
Submit At
2024-10-05 07:04:51
Judged At
2024-10-05 07:04:51
Judged By
Score
95
Total Time
637ms
Peak Memory
37.488 MiB