Submission #1164275


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vstring vector<string>
using namespace std;

#include<map>
#include<set>
#include<queue>

typedef long long ll;
typedef unsigned long long ull;

const int MAX_N = 1000000;
int N; double A, B;

int main() {

    cin >> N >> A >> B;
    double AVG = 0.0;
    double MN = INT64_MAX;
    double MX = INT64_MIN;
    rep(i, N){
        double s; cin >> s;
        AVG += s;
        MN = min(MN, s);
        MX = max(MX, s);
        fprintf(stderr, "%f %f %f\n", MN, MX, s);
    }
    AVG /= N;

    if(MN == MX) {
        cout << -1 << endl;
        return 0;
    }

    double S = B /(MX - MN) ;
    double Q = A - AVG * S;

    printf("%.10f %.10f\n", S, Q);
}

Submission Info

Submission Time
Task A - 点数変換
User threecourse
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1023 Byte
Status AC
Exec Time 321 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 45
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 113 ms 256 KB
subtask1_02.txt AC 238 ms 256 KB
subtask1_03.txt AC 183 ms 256 KB
subtask1_04.txt AC 47 ms 256 KB
subtask1_05.txt AC 288 ms 256 KB
subtask1_06.txt AC 210 ms 256 KB
subtask1_07.txt AC 296 ms 256 KB
subtask1_08.txt AC 195 ms 256 KB
subtask1_09.txt AC 73 ms 256 KB
subtask1_10.txt AC 87 ms 256 KB
subtask1_11.txt AC 139 ms 256 KB
subtask1_12.txt AC 301 ms 256 KB
subtask1_13.txt AC 97 ms 256 KB
subtask1_14.txt AC 10 ms 256 KB
subtask1_15.txt AC 181 ms 256 KB
subtask1_16.txt AC 188 ms 256 KB
subtask1_17.txt AC 77 ms 256 KB
subtask1_18.txt AC 190 ms 256 KB
subtask1_19.txt AC 300 ms 256 KB
subtask1_20.txt AC 304 ms 256 KB
subtask1_21.txt AC 310 ms 256 KB
subtask1_22.txt AC 291 ms 256 KB
subtask1_23.txt AC 298 ms 256 KB
subtask1_24.txt AC 299 ms 256 KB
subtask1_25.txt AC 293 ms 256 KB
subtask1_26.txt AC 299 ms 256 KB
subtask1_27.txt AC 297 ms 256 KB
subtask1_28.txt AC 304 ms 256 KB
subtask1_29.txt AC 305 ms 256 KB
subtask1_30.txt AC 309 ms 256 KB
subtask1_31.txt AC 305 ms 256 KB
subtask1_32.txt AC 321 ms 256 KB
subtask1_33.txt AC 299 ms 256 KB
subtask1_34.txt AC 306 ms 256 KB
subtask1_35.txt AC 300 ms 256 KB
subtask1_36.txt AC 308 ms 256 KB
subtask1_37.txt AC 302 ms 256 KB
subtask1_38.txt AC 300 ms 256 KB
subtask1_39.txt AC 262 ms 256 KB