/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Accepted 3ms 568.0 KiB
#3 Accepted 62ms 568.0 KiB
#4 Time Exceeded ≥2045ms ≥584.0 KiB
#5 Time Exceeded ≥2013ms ≥592.0 KiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    int n, k;
    cin >> n >> k;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        v[i] = x;
    }
    
    vector<int> dp(n + 1, -1);
    auto rec = [&](auto&& self, int i) -> int {
        if(i + 1 >= n) return 0;
        auto& ans = dp[i] ;
        if(ans != -1) return ans;
        ans = k + self(self, i + 1);
        for(int j = i + 1; j < n; j++) {
            ans = min(ans, (v[i] / __gcd(v[i], v[j])) + self(self, j));
        }
        return ans;
    };
    
    cout << rec(rec, 0) << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1099 Which way to go
Language
C++17 (G++ 13.2.0)
Submit At
2024-10-09 13:27:08
Judged At
2024-11-11 02:38:09
Judged By
Score
15
Total Time
≥2045ms
Peak Memory
≥592.0 KiB