Submission #1607588


Source Code Expand

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define VSORT(v) sort(v.begin(), v.end())
#define DVSORT(v) sort(v.begin(), v.end(),greater<int>())
#define SORT(v, n) sort(v, v+n)
#define DSORT(v,n) sort(v, v+n,greater<int>())
#define vi vector<int>
#define pb push_back
#define P pair<int,int>
 
 
template <class T> void chmin(T&a, const T&b) { a = min(a,b); }
template <class T> void chmax(T&a, const T&b) { a = max(a,b); }
 
const double EPS =1e-9;
const long INF =2147483647;//32bit 2*1e+9
const long MOD =1000000007; //10^9+7
#define PI 3.14159265258979
 
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
 
int main(void){	
	double N,A,B,score,P1,Q1,ave=0.0;
	double max=1,min=INF;

	cin>>N>>A>>B;
	REP(i,N){
		cin>>score;
		chmax(max,score);
		chmin(min,score);
		ave+=score;
	}
	ave/=N;

	if(max-min==0) puts("-1");
	else{
		P1=B/(max-min);
		Q1=A-ave*P1;
		printf("%.11lf %.11lf\n",P1,Q1);
	}
	return 0; 
}

Submission Info

Submission Time
Task A - 点数変換
User stnae678
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1229 Byte
Status AC
Exec Time 64 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 23 ms 256 KB
subtask1_02.txt AC 46 ms 256 KB
subtask1_03.txt AC 38 ms 256 KB
subtask1_04.txt AC 10 ms 256 KB
subtask1_05.txt AC 58 ms 256 KB
subtask1_06.txt AC 42 ms 256 KB
subtask1_07.txt AC 59 ms 256 KB
subtask1_08.txt AC 38 ms 256 KB
subtask1_09.txt AC 15 ms 256 KB
subtask1_10.txt AC 18 ms 256 KB
subtask1_11.txt AC 28 ms 256 KB
subtask1_12.txt AC 58 ms 256 KB
subtask1_13.txt AC 20 ms 256 KB
subtask1_14.txt AC 3 ms 256 KB
subtask1_15.txt AC 38 ms 256 KB
subtask1_16.txt AC 38 ms 256 KB
subtask1_17.txt AC 16 ms 256 KB
subtask1_18.txt AC 38 ms 256 KB
subtask1_19.txt AC 58 ms 256 KB
subtask1_20.txt AC 60 ms 256 KB
subtask1_21.txt AC 60 ms 256 KB
subtask1_22.txt AC 57 ms 256 KB
subtask1_23.txt AC 60 ms 256 KB
subtask1_24.txt AC 61 ms 256 KB
subtask1_25.txt AC 61 ms 256 KB
subtask1_26.txt AC 60 ms 256 KB
subtask1_27.txt AC 60 ms 256 KB
subtask1_28.txt AC 60 ms 256 KB
subtask1_29.txt AC 60 ms 256 KB
subtask1_30.txt AC 60 ms 256 KB
subtask1_31.txt AC 61 ms 256 KB
subtask1_32.txt AC 61 ms 256 KB
subtask1_33.txt AC 60 ms 256 KB
subtask1_34.txt AC 60 ms 256 KB
subtask1_35.txt AC 60 ms 256 KB
subtask1_36.txt AC 61 ms 256 KB
subtask1_37.txt AC 60 ms 256 KB
subtask1_38.txt AC 60 ms 256 KB
subtask1_39.txt AC 64 ms 256 KB