oj.uz

Submission #996733

# Submission time Handle Problem Language Result Execution time Memory
996733 2024-06-11T06:36:07 Z faqinyeager Self Study (JOI22_ho_t2) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

int n, m;
vector<ll> a, b;
vector<ld> r;

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b){ return a / gcd(a, b) * b; }

int main(){
    cin >> n >> m;
    
    a.resize(n);
    b.resize(n);
    r.resize(n);
    
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) cin >> b[i];
    
    ll tmp = 1;
    
    for(int i = 0; i < n; i++) tmp = lcm(tmp, a[i]);
    
    ll tot = n * m, c = 0;
    
    for(int i = 0; i < n; i++){
        r[i] = ld(tmp) / ld(a[i]);
        c += r[i];
    }
    
    ld per = ld(tot) / ld(c), ans = 1e10;
    ll count = 0;
    
    for(int i = 0; i < n; i++){
        r[i] *= per;
        ans = min(ans, r[i] * a[i]);
        count += r[i] * a[i];
    }
    
    cout << ((count < n) ? int(ans) : int(ans) + *min_element(a.begin(), a.end()) * (count / n));
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -