QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #482451 | #7111. Press the Button | wiseman123 | WA | 0ms | 3632kb | C++20 | 751b | 2024-07-17 19:37:25 | 2024-07-17 19:37:26 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
int a,b,c,d,p,t,v;
int lcm(int a,int b)
{
return a*b/__gcd(a,b);
}
int f(int r)
{
int x=0,y=0,flag=-1;
int now=0,ans=0;
while(now<=r)
{
if(now==x)
{
x+=a;
ans+=b-(now>flag?1:0);
flag=now+v;
}
if(now==y)
{
y+=c;
ans+=d-(now>flag?1:0);
flag=now+v;
}
now=min(x,y);
}
if(r==p-1&&flag>r) ans++;
return ans;
}
void solve()
{
cin>>a>>b>>c>>d>>v>>t;
p=lcm(a,c);
int k=t/p, res=t%p;
if(k==0)
{
cout<<f(res)<<endl;
}
else
{
cout<<f(p-1)*k+f(res);
}
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
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: 0ms
memory: 3632kb
input:
2 8 2 5 1 2 18 10 2 5 1 2 10
output:
6 4
result:
ok 2 number(s): "6 4"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3616kb
input:
1000 8 6 2 6 3 17 1 6 1 1 1 30 5 4 8 8 1 31 7 6 10 3 6 12 9 1 4 4 3 38 3 3 5 8 1 8 9 1 5 2 3 18 6 10 10 8 2 40 9 6 9 10 3 9 2 5 1 10 10 39 7 7 1 2 4 19 8 10 8 6 7 36 2 9 1 1 7 17 1 2 3 5 6 14 8 8 8 7 1 46 6 9 3 9 4 6 10 8 1 7 10 18 7 1 7 10 3 50 1 10 2 1 5 1 5 8 4 9 7 44 9 2 5 4 7 42 9 1 2 1 1 20 5 ...
output:
7121752 16 3822 7 102305006075995584441488021 17945 4463140563045 12720412142 7038 98641212514217 7624 17511440 32 11 29 85 35 7 66504934949 14 1753 4311619427 21 13571923329057 30018 891555610 21920339028 50 67213261827 19 1281021186246 15 52520 808029 1371512046557547170221232713001210429459570166...
result:
wrong answer 1st numbers differ - expected: '71', found: '7121752'