QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #376408 | #6823. Coffee Overdose | wjh213 | WA | 64ms | 3664kb | C++14 | 504b | 2024-04-04 09:37:39 | 2024-04-04 09:37:41 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int n,k;
cin>>n>>k;
double a=-1.0/2*k,b=1.0/2*k*k,c=1.0/2*(n*n+n);
int dui=(int)(-b/2*a+1e-9);
dui=min(dui,n/k);
dui=max((int)0,dui);
int ans=a*dui*dui+b*dui+c+0.5;
//cerr<<ans<<" ";
int tp=(n-1)/k+1;
//cerr<<tp<<" ";
tp=(k*(k-1))/2*tp-tp*(tp-1)/2*k+(tp*k)*(tp*k+1)/2-(tp*k)*(tp*k-n);
ans=max(ans,tp);
cout<<ans<<"\n";
}
signed main(){
int T;
cin>>T;
while(T--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3664kb
input:
4 1 2 2 1 10 4 172800 172800
output:
2 3 63 29859840000
result:
ok 4 tokens
Test #2:
score: -100
Wrong Answer
time: 64ms
memory: 3540kb
input:
100000 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 1 ...
output:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 ...
result:
wrong answer 4003rd words differ - expected: '48', found: '45'