QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#750446#9620. osu!manialibantian#AC ✓0ms3540kbC++231005b2024-11-15 14:34:592024-11-15 14:35:07

Judging History

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

  • [2024-11-15 14:35:07]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3540kb
  • [2024-11-15 14:34:59]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define fi first
#define se second
#define double long double
#define all(_a) _a.begin(), _a.end()

void solve(){
    int ppmax,a,b,c,d,e,f;
    cin>>ppmax>>a>>b>>c>>d>>e>>f;
    int p=(300*a+300*b+200*c+100*d+50*e+0*f)*100000/(300*(a+b+c+d+e+f));
    if(p%10>=5)p=(p/10)+1;
    else p=p/10;
    cout<<p/100<<".";
    if(p%100>9)cout<<p%100;
    else cout<<'0'<<p%100;
    cout<<"%"<<" ";
    int up=(10*(320*a+300*b+200*c+100*d+50*e)-8*320*(a+b+c+d+e+f))*5*ppmax*10;
    up=max((int)0,up);
    int down=10*320*(a+b+c+d+e+f);
     int res=up/down;
    if(res%10>=5)cout<<res/10+1<<endl;
    else cout<<res/10<<endl;

}
signed main(){
    // ios::sync_with_stdio(false);
    // cin.tie(nullptr), cout.tie(nullptr);
    // cout << setiosflags(ios::fixed) << setprecision(15);
    int T;
    T=1;
    cin>>T;
    while(T--)solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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