NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #212571 | #3841. 小t做晚餐(dinner) | 13818071652 | 0 | 0ms | 0kb | C++ | 556b | 2024-10-19 11:46:25 | 2024-10-19 12:36:05 |
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
long long n,m,k=0;
int t,a[N],w[N];
int main()
{
freopen("dinner.in","r",stdin);
freopen("dinner.out","w",stdout);
ios::sync_with_stdio(0);
cin>>n>>m>>t;
for(ll i=1;i<=m;i++)
cin>>a[i];
sort(a+1,a+m+1);
for(int i=1;i<m;i++)
{
w[i]=a[m]-a[i];
n=n-(w[i]/2);
a[i]=a[i]+(w[i]/2*2);
}
sort(a+1,a+m+1);
int s=n%m;
if(n>m)
k=a[s]+(n/m)*t+s*t;
else if(n<m)
k=a[s]+s*t;
else
k=a[m]+(n/m)*t;
cout<<k<<endl;
return 0;
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 0
Dangerous Syscalls
input:
8 9 7 1 3 4 10 10 8 1 4 10
output:
result:
Test #2:
score: 0
Dangerous Syscalls
input:
10 2 7 6 6
output:
result:
Test #3:
score: 0
Dangerous Syscalls
input:
10 6 2 6 5 4 7 6 10
output:
result:
Test #4:
score: 0
Dangerous Syscalls
input:
100 21 15 62 25 1 81 79 58 24 99 15 46 63 10 11 50 19 91 56 44 56 86 35
output:
result:
Test #5:
score: 0
Dangerous Syscalls
input:
1000 68 6 11 41 86 66 92 38 15 35 77 26 21 93 35 70 36 27 77 10 46 11 17 15 35 89 14 43 74 9 59 20 3...
output:
result:
Test #6:
score: 0
Dangerous Syscalls
input:
1000 810 61 79 18 56 21 64 2 45 73 12 47 67 90 60 98 40 49 17 98 24 16 50 16 43 20 80 50 98 97 36 70...
output:
result:
Test #7:
score: 0
Dangerous Syscalls
input:
10000 3146 835 42 158 869 163 386 261 223 592 157 477 641 470 641 496 382 414 730 645 733 427 748 28...
output:
result:
Test #8:
score: 0
Dangerous Syscalls
input:
100000 93141 512 699 243 200 81 172 634 186 351 534 913 48 347 943 921 355 35 281 280 522 460 521 84...
output:
result:
Test #9:
score: 0
Dangerous Syscalls
input:
100000 80683 950 489 86 596 849 602 25 938 983 516 677 795 933 382 603 890 33 289 23 875 42 190 124 ...
output:
result:
Test #10:
score: 0
Dangerous Syscalls
input:
100000 32895 1 289 623 217 574 424 341 24 490 391 721 351 621 331 350 676 962 676 684 442 940 117 54...
