Submission #1305836
Source Code Expand
#include <iostream> #include <algorithm> #include <climits> #include <iomanip> int N = 0, A = 0, B = 0; int S = 0; int main(void){ int sum = 0; int max = 0; 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 << "\n"; }else{ double P = 1.*B/(max-min); double Q = A - ave*P; std::cout << std::fixed << std::setprecision(7) << P << " " << Q << "\n"; } }
Submission Info
Submission Time | |
---|---|
Task | A - 点数変換 |
User | b1464296 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 634 Byte |
Status | WA |
Exec Time | 58 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 20 ms | 256 KB |
subtask1_02.txt | AC | 40 ms | 256 KB |
subtask1_03.txt | WA | 33 ms | 256 KB |
subtask1_04.txt | WA | 9 ms | 256 KB |
subtask1_05.txt | WA | 53 ms | 256 KB |
subtask1_06.txt | WA | 36 ms | 256 KB |
subtask1_07.txt | WA | 52 ms | 256 KB |
subtask1_08.txt | WA | 34 ms | 256 KB |
subtask1_09.txt | WA | 14 ms | 256 KB |
subtask1_10.txt | WA | 16 ms | 256 KB |
subtask1_11.txt | WA | 25 ms | 256 KB |
subtask1_12.txt | AC | 51 ms | 256 KB |
subtask1_13.txt | WA | 18 ms | 256 KB |
subtask1_14.txt | WA | 3 ms | 256 KB |
subtask1_15.txt | WA | 33 ms | 256 KB |
subtask1_16.txt | WA | 33 ms | 256 KB |
subtask1_17.txt | WA | 14 ms | 256 KB |
subtask1_18.txt | WA | 34 ms | 256 KB |
subtask1_19.txt | WA | 51 ms | 256 KB |
subtask1_20.txt | WA | 54 ms | 256 KB |
subtask1_21.txt | WA | 53 ms | 256 KB |
subtask1_22.txt | AC | 57 ms | 256 KB |
subtask1_23.txt | WA | 53 ms | 256 KB |
subtask1_24.txt | WA | 54 ms | 256 KB |
subtask1_25.txt | WA | 54 ms | 256 KB |
subtask1_26.txt | WA | 53 ms | 256 KB |
subtask1_27.txt | WA | 54 ms | 256 KB |
subtask1_28.txt | WA | 53 ms | 256 KB |
subtask1_29.txt | WA | 54 ms | 256 KB |
subtask1_30.txt | WA | 53 ms | 256 KB |
subtask1_31.txt | WA | 53 ms | 256 KB |
subtask1_32.txt | AC | 53 ms | 256 KB |
subtask1_33.txt | WA | 54 ms | 256 KB |
subtask1_34.txt | WA | 53 ms | 256 KB |
subtask1_35.txt | WA | 54 ms | 256 KB |
subtask1_36.txt | WA | 53 ms | 256 KB |
subtask1_37.txt | WA | 54 ms | 256 KB |
subtask1_38.txt | WA | 52 ms | 256 KB |
subtask1_39.txt | AC | 58 ms | 256 KB |