QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#790706#9620. osu!maniaxbzxzn#AC ✓0ms3812kbC++201.3kb2024-11-28 14:54:182024-11-28 14:54:25

Judging History

你现在查看的是最新测评结果

  • [2024-11-28 14:54:25]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3812kb
  • [2024-11-28 14:54:18]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define db long double
#define Pa pair<int,int>
using namespace std;
const int N=2e6+10,mod=1e9+7;
db eps = 1e-12;
db cmp(db a, db b) {
    db del = a - b;
    if (del < eps) return 0;
    else if (del > 0) return 1;
    else return -1;
}
void solve(){
    db ppmax, a, b, c, d, e, f;
    std::cin >> ppmax >> a >> b >> c >> d >> e >> f;

    db acc = (db)(30000) * (a + b) + 20000 * c + 10000 * d + 5000 * e;
    acc /= 3 * (a + b + c + d + e + f);
    acc+=0.5+eps;
    int aa=acc;

    int res1=aa/100,res2=aa%100;
    if(res2<10){
        cout<<res1<<".0"<<res2<<"% ";
    }
    else{
        cout<<res1<<'.'<<res2<<"% ";
    }
//    cout<<acc/100<<' '<<acc%100;
//    std::cout << acc << "% ";

    db pp = 320 * a + 300 * b + 200 * c + 100 * d + 50 * e;
    pp /= 320 * (a + b + c + d + e + f);
    pp *= 100;
    pp -= 80;
    if (cmp(pp, 0) <= 0) {
        pp = 0;
    } else {
        pp = pp * 5 * ppmax;
        pp /= 100;
    }
    pp+=0.5+eps;
    long long ans = pp;
    std::cout << ans << "\n";
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T=1;cin>>T;
	while(T--)solve();
}
//2
//630
//3029 2336 377 41 10 61
//3000
//20000 10000 0 0 0 0

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3812kb

input:

18
1279
4624 4458 1109 220 103 314
753
3604 3204 391 33 9 29
807
5173 3986 763 84 29 96
718
576 461 60 5 2 7
947
4058 3268 764 169 42 158
568
2660 1731 161 16 6 15
641
4181 3126 656 56 10 43
630
3029 2336 377 41 10 61
529
1991 1354 181 11 9 5
1802
8321 2335 115 19 11 27
1645
3965 1087 41 6 1 13
1688...

output:

91.54% 543
97.40% 543
95.75% 523
97.12% 513
93.38% 499
98.16% 444
96.19% 430
96.20% 423
97.74% 400
99.19% 1604
99.38% 1482
99.14% 1465
98.53% 1251
100.00% 2688
100.00% 1792
100.00% 3000
52.78% 0
0.00% 0

result:

ok 18 lines