QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#319489 | #7111. Press the Button | Djangle162857# | WA | 2ms | 3684kb | C++14 | 1.0kb | 2024-02-02 17:11:46 | 2024-02-02 17:11:46 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
typedef long long ll;
const int mod = 1000000007;
const int inf = 2147483647;
const int N = 200020;
void solve() {
ll a, b, c, d, v, t;
cin >> a >> b >> c >> d >> v >> t;
if (v >= max(a, c)) {
ll ans = (t / a + 1) * b + (t / c + 1) * d;
cout << ans-1 << endl;
return;
}
ll sum = b + d - 1;
ll len = a * c / __gcd(a, c);
for (ll i = a; i < len; i += a) {
sum += b;
if (i % c > v)
sum--;
}
for (ll i = c; i < len; i += c) {
sum += d;
if (i % a > v)
sum--;
}
ll ans = (t / len) * sum;
ll res = t % len;
ans += b + d - 1;
for (ll i = a; i < res; i += a) {
ans += b;
if (i % c > v)
ans--;
}
for (ll i = c; i < res; i += c) {
ans += d;
if (i % a > v)
ans--;
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int 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: 3600kb
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: 2ms
memory: 3684kb
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:
65 216 52 16 38 22 6 95 30 499 52 75 98 54 84 43 148 80 20 179 44 4 463 135 56 30 41 127 204 121 41 63 38 96 63 121 25 136 17 75 24 167 108 40 28 11 29 84 28 7 66 49 492 48 48 14 13 53 401 153 90 27 20 127 71 92 33 270 48 300 18 89 149 55 10 219 203 364 28 50 61 213 26 18 27 19 128 101 116 49 42 15 ...
result:
wrong answer 1st numbers differ - expected: '71', found: '65'