Submission #2246923


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;

#define Rep(b, e, i) for(int i = b; i <= e; i++)
#define rep(n, i) Rep(0, n-1, i)

typedef long long ll;
typedef pair<ll, ll> llP;
typedef pair<int, int> intP;
typedef std::priority_queue<int> IntPrioQueue; //Z->A
typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue; //A->Z

const int MAX = 200000;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<31-1;
const int MOD = 1000000007;

vector <int> v;

void solve(void){
    int N, A, B; ll sum = 0LL;
    cin >> N >> A >> B;
    rep(N, i) {
        int A; scanf("%d\n", &A);
        v.push_back(A);
        sum += A;
    }
    sort(v.begin(), v.end());
    double p, q;
    if (v[0] == v[N-1]) cout << -1 << '\n';
    else {
        p = (double)B / (v[N-1]-v[0]);
        q = (A*N - sum*p) / N;
        cout << p << ' ' << q << endl;
    }
}

int main(void){
  solve();
  return 0;
}

Submission Info

Submission Time
Task A - 点数変換
User sifi_border
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1241 Byte
Status WA
Exec Time 20 ms
Memory 892 KB

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:38:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         int A; scanf("%d\n", &A);
                                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 11
WA × 34
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 8 ms 640 KB
subtask1_02.txt AC 12 ms 892 KB
subtask1_03.txt WA 13 ms 640 KB
subtask1_04.txt WA 4 ms 384 KB
subtask1_05.txt WA 20 ms 892 KB
subtask1_06.txt WA 14 ms 892 KB
subtask1_07.txt WA 20 ms 892 KB
subtask1_08.txt WA 13 ms 640 KB
subtask1_09.txt WA 6 ms 512 KB
subtask1_10.txt WA 6 ms 512 KB
subtask1_11.txt WA 10 ms 640 KB
subtask1_12.txt AC 15 ms 892 KB
subtask1_13.txt WA 7 ms 512 KB
subtask1_14.txt WA 2 ms 256 KB
subtask1_15.txt WA 12 ms 640 KB
subtask1_16.txt WA 13 ms 640 KB
subtask1_17.txt WA 6 ms 512 KB
subtask1_18.txt WA 13 ms 640 KB
subtask1_19.txt WA 20 ms 892 KB
subtask1_20.txt WA 20 ms 892 KB
subtask1_21.txt WA 20 ms 892 KB
subtask1_22.txt AC 15 ms 892 KB
subtask1_23.txt WA 20 ms 892 KB
subtask1_24.txt WA 20 ms 892 KB
subtask1_25.txt WA 20 ms 892 KB
subtask1_26.txt WA 20 ms 892 KB
subtask1_27.txt WA 20 ms 892 KB
subtask1_28.txt WA 20 ms 892 KB
subtask1_29.txt WA 20 ms 892 KB
subtask1_30.txt WA 20 ms 892 KB
subtask1_31.txt WA 20 ms 892 KB
subtask1_32.txt AC 15 ms 892 KB
subtask1_33.txt WA 20 ms 892 KB
subtask1_34.txt WA 20 ms 892 KB
subtask1_35.txt WA 20 ms 892 KB
subtask1_36.txt WA 20 ms 892 KB
subtask1_37.txt WA 20 ms 892 KB
subtask1_38.txt WA 20 ms 892 KB
subtask1_39.txt AC 16 ms 892 KB