Submission #1433024
Source Code Expand
#include<bits/stdc++.h> using namespace std; const long long INF = 1e7 + 1; const long long MOD = 1000000007; const long double PI = 3.1415926; #define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++) #define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define RALL(x) x.rbegin(),x.rend() typedef long long int ll; typedef vector<ll> vi; typedef vector < pair<ll, ll > > vp; typedef vector <string> vs; typedef vector <char> vc; typedef list <ll> lst; ll n, m, k, ans = 0, sum = 0, cnt = 0; string s; char c; #define Endl endl /*--------------------template--------------------*/ int main() { ll a, b; cin >> n >> a >> b; vi v(n); REP(i, n) cin >> v[i], sum += v[i]; sort(ALL(v)); double p = (double)b / (v.back() - v.front()); double q = ((double)a*n - p*sum) / n; if (p > INF || q > INF) { cout << -1 << endl; } else { cout << p << ' ' << q << endl; } }
Submission Info
Submission Time | |
---|---|
Task | A - 点数変換 |
User | tettchan |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1001 Byte |
Status | WA |
Exec Time | 47 ms |
Memory | 1024 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 | 18 ms | 512 KB |
subtask1_02.txt | AC | 36 ms | 768 KB |
subtask1_03.txt | WA | 32 ms | 768 KB |
subtask1_04.txt | AC | 8 ms | 384 KB |
subtask1_05.txt | WA | 45 ms | 1024 KB |
subtask1_06.txt | WA | 32 ms | 768 KB |
subtask1_07.txt | WA | 45 ms | 1024 KB |
subtask1_08.txt | WA | 30 ms | 768 KB |
subtask1_09.txt | WA | 12 ms | 384 KB |
subtask1_10.txt | WA | 14 ms | 512 KB |
subtask1_11.txt | WA | 22 ms | 640 KB |
subtask1_12.txt | AC | 39 ms | 1024 KB |
subtask1_13.txt | WA | 15 ms | 512 KB |
subtask1_14.txt | WA | 2 ms | 256 KB |
subtask1_15.txt | WA | 29 ms | 768 KB |
subtask1_16.txt | WA | 29 ms | 768 KB |
subtask1_17.txt | WA | 12 ms | 384 KB |
subtask1_18.txt | WA | 29 ms | 768 KB |
subtask1_19.txt | WA | 45 ms | 1024 KB |
subtask1_20.txt | WA | 46 ms | 1024 KB |
subtask1_21.txt | WA | 47 ms | 1024 KB |
subtask1_22.txt | AC | 42 ms | 1024 KB |
subtask1_23.txt | WA | 46 ms | 1024 KB |
subtask1_24.txt | AC | 47 ms | 1024 KB |
subtask1_25.txt | WA | 47 ms | 1024 KB |
subtask1_26.txt | WA | 47 ms | 1024 KB |
subtask1_27.txt | WA | 46 ms | 1024 KB |
subtask1_28.txt | WA | 47 ms | 1024 KB |
subtask1_29.txt | WA | 47 ms | 1024 KB |
subtask1_30.txt | AC | 47 ms | 1024 KB |
subtask1_31.txt | WA | 46 ms | 1024 KB |
subtask1_32.txt | AC | 42 ms | 1024 KB |
subtask1_33.txt | WA | 47 ms | 1024 KB |
subtask1_34.txt | WA | 47 ms | 1024 KB |
subtask1_35.txt | WA | 47 ms | 1024 KB |
subtask1_36.txt | WA | 46 ms | 1024 KB |
subtask1_37.txt | WA | 46 ms | 1024 KB |
subtask1_38.txt | WA | 47 ms | 1024 KB |
subtask1_39.txt | AC | 44 ms | 1024 KB |