Submission #1417268
Source Code Expand
#include <iostream> #include <algorithm> #include <climits> #include <cstdio> long long int N = 0, A = 0, B = 0; long long int S = 0; int main(void){ long long int sum = 0; long long int max = 0; long long int min = INT_MAX; std::cin >> N >> A >> B; for(int i=0; i<N; ++i){ std::cin >> S; sum += S; max = std::max(max, S); min = std::min(min, S); } double ave = (1.*sum)/N; if(max == min){ std::cout << -1 << std::endl; }else{ double P = (1.*B)/(1.*max-min); double Q = A - ave*P; printf("%.10lf %.10lf\n", P, Q); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 点数変換 |
User | KurataKcyb |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 667 Byte |
Status | AC |
Exec Time | 43 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 15 ms | 256 KB |
subtask1_02.txt | AC | 30 ms | 256 KB |
subtask1_03.txt | AC | 25 ms | 256 KB |
subtask1_04.txt | AC | 7 ms | 256 KB |
subtask1_05.txt | AC | 38 ms | 256 KB |
subtask1_06.txt | AC | 27 ms | 256 KB |
subtask1_07.txt | AC | 39 ms | 256 KB |
subtask1_08.txt | AC | 25 ms | 256 KB |
subtask1_09.txt | AC | 11 ms | 256 KB |
subtask1_10.txt | AC | 12 ms | 256 KB |
subtask1_11.txt | AC | 19 ms | 256 KB |
subtask1_12.txt | AC | 38 ms | 256 KB |
subtask1_13.txt | AC | 13 ms | 256 KB |
subtask1_14.txt | AC | 2 ms | 256 KB |
subtask1_15.txt | AC | 24 ms | 256 KB |
subtask1_16.txt | AC | 25 ms | 256 KB |
subtask1_17.txt | AC | 11 ms | 256 KB |
subtask1_18.txt | AC | 25 ms | 256 KB |
subtask1_19.txt | AC | 39 ms | 256 KB |
subtask1_20.txt | AC | 40 ms | 256 KB |
subtask1_21.txt | AC | 40 ms | 256 KB |
subtask1_22.txt | AC | 37 ms | 256 KB |
subtask1_23.txt | AC | 40 ms | 256 KB |
subtask1_24.txt | AC | 40 ms | 256 KB |
subtask1_25.txt | AC | 41 ms | 384 KB |
subtask1_26.txt | AC | 40 ms | 256 KB |
subtask1_27.txt | AC | 40 ms | 256 KB |
subtask1_28.txt | AC | 40 ms | 256 KB |
subtask1_29.txt | AC | 40 ms | 256 KB |
subtask1_30.txt | AC | 40 ms | 256 KB |
subtask1_31.txt | AC | 40 ms | 256 KB |
subtask1_32.txt | AC | 40 ms | 256 KB |
subtask1_33.txt | AC | 40 ms | 256 KB |
subtask1_34.txt | AC | 40 ms | 256 KB |
subtask1_35.txt | AC | 40 ms | 256 KB |
subtask1_36.txt | AC | 40 ms | 256 KB |
subtask1_37.txt | AC | 40 ms | 256 KB |
subtask1_38.txt | AC | 40 ms | 256 KB |
subtask1_39.txt | AC | 43 ms | 256 KB |