QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#694956 | #7111. Press the Button | Mine_King# | WA | 1ms | 3948kb | C++14 | 1.1kb | 2024-10-31 19:01:25 | 2024-10-31 19:01:27 |
Judging History
answer
// 長い夜の終わりを信じながら
// Think twice, code once.
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;
int T, a, b, c, d;
long long v, t;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d%d%d%d%lld%lld", &a, &b, &c, &d, &v, &t);
long long lcm = a / __gcd(a, c) * c;
long long res = 0, ans = 0;
for (int i = 1; i < lcm / a; i++) res += (long long)i * a % c <= v;
for (int i = 1; i < lcm / c; i++) res += (long long)i * c % a <= v;
res += lcm / a * (b - 1) + lcm / c * (d - 1) + 1;
ans = res * (t / lcm) + (t / lcm - 1) * (min(a, c) <= v);
t %= lcm;
ans += (min(a, c) <= v) + b + d - 1;
for (int i = 1; i < lcm / a; i++)
if ((long long)i * a <= t) ans += ((long long)i * a % c <= v) + b - 1;
for (int i = 1; i < lcm / c; i++)
if ((long long)i * c <= t) ans += ((long long)i * c % a <= v) + d - 1;
printf("%lld\n", ans);
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3908kb
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: 1ms
memory: 3948kb
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:
67 216 52 16 38 22 7 102 30 499 55 75 98 54 84 44 148 80 20 179 44 4 463 139 56 30 45 127 204 121 41 69 38 98 63 121 25 138 17 75 24 171 114 40 32 11 29 84 35 7 66 49 492 49 48 14 17 53 406 161 91 27 21 135 71 92 33 275 57 300 18 89 155 55 10 219 203 377 28 50 66 213 26 18 27 19 128 101 117 54 46 15...
result:
wrong answer 1st numbers differ - expected: '71', found: '67'