Submission #470527

---

Source Code Expand

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;

void computepq(const long n, const long * ssPtr, const long a, const long b, double & p, double & q, bool & notFound)
{
    long ma = ssPtr[0], mi = ssPtr[0];
    long long int su = ssPtr[0];
    for(long i = 1; i < n; ++i)
    {
        ma = max(ma, ssPtr[i]);
        mi = min(mi, ssPtr[i]);
        su += ssPtr[i];
    }
    
    // set p and q
    if( ma == mi )
    {
        notFound = true;
        return;
    }
    else
    {
        notFound = false;
        p = double(b) / double(ma - mi);
        q = double(a) - p * double(su) / double(n);
        return;
    }
}

int main() {
    
    // input values
    long n, a, b;
    cin >> n;
    cin >> a;
    cin >> b;
    long ss[n];
    for(long i = 0; i < n; ++i)
    {
        cin >> ss[i];
    }
    
    // compute p and q
    double p(0.0), q(0.0);
    bool nf(true);
    computepq(n, &ss[0], a, b, p, q, nf);
    
    // output
    if( nf )
    {
        cout << -1 << endl;
    }
    else
    {
        cout << fixed << setprecision(7) << p << " " << q << endl;    
    }
    return 0;
}

Submission Info

Judge Result