QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#407597 | #1373. Rating Problems | TheSleepyDevil# | WA | 1ms | 3888kb | C++14 | 1.7kb | 2024-05-09 05:36:24 | 2024-05-09 05:36:24 |
Judging History
answer
/*
Hell, 'til I reach Hell, I ain't scared
Mama checkin' in my bedroom, I ain't there
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Major ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define TxtIO freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define read(a,n) for(int i = 0 ; i<n ; i++) cin>>a[i];
#define write(a) for(auto x : a) cout<<x<<" ";
#define int long long
#define pb push_back
#define all(a) a.begin(),a.end()
#define el "\n"
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int inf=4e18;
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,1,0,-1,1,-1,1,-1};
const int mod=1e9+7;
const int MAX =1e6+7;
//---------------------------Function----------------------------------//
void TestCake(){
int n,m;
cin>>n>>m;
double sum=0;
for(int i=0;i<m;i++){
int x;cin>>x;
sum+=x;
}
double here=(sum)+((n-m)*-3);
here/=n;
cout<<fixed;
cout<<setprecision(2)<<here<<" ";
here=(sum)+((n-m)*3);
here/=n;
cout<<setprecision(2)<<here;
}
//------------------------------Main---------------------------//
signed main(){
Major
int T = 1;
// cin >> T;
while(T--){
TestCake();
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3808kb
input:
10 0
output:
-3.00 3.00
result:
ok 2 numbers
Test #2:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
10 10 3 2 1 0 -1 -2 -3 -2 -1 0
output:
-0.30 -0.30
result:
ok 2 numbers
Test #3:
score: 0
Accepted
time: 1ms
memory: 3852kb
input:
10 10 0 0 0 0 0 0 0 0 0 0
output:
0.00 0.00
result:
ok 2 numbers
Test #4:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
10 10 3 3 3 3 3 3 3 3 3 3
output:
3.00 3.00
result:
ok 2 numbers
Test #5:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
10 10 -3 -3 -3 -3 -3 -3 -3 -3 -3 -3
output:
-3.00 -3.00
result:
ok 2 numbers
Test #6:
score: 0
Accepted
time: 1ms
memory: 3852kb
input:
1 0
output:
-3.00 3.00
result:
ok 2 numbers
Test #7:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
1 1 2
output:
2.00 2.00
result:
ok 2 numbers
Test #8:
score: -100
Wrong Answer
time: 0ms
memory: 3812kb
input:
9 7 1 3 2 2 1 1 2
output:
0.67 2.00
result:
wrong answer 1st numbers differ - expected: '0.66667', found: '0.67000', error = '0.00333'