QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#746677#9622. 有限小数IllusionaryDominance#WA 216ms3680kbC++20777b2024-11-14 15:15:272024-11-14 15:15:27

Judging History

你现在查看的是最新测评结果

  • [2024-11-14 15:15:27]
  • 评测
  • 测评结果:WA
  • 用时:216ms
  • 内存:3680kb
  • [2024-11-14 15:15:27]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll INF = 1e9;

ll a, b, c, d;
set <ll> vis;

void dfs(ll s) {
    if (vis.find(s) != vis.end()) return ;
    vis.insert(s);
    ll g = __gcd(s, b);
    ll x = b / g * s;
    if (x > INF) return ;
    ll tmp = s / g * a;
    ll t = (tmp - 1) / (b / g) + 1;
    ll c_ = b / g * t - tmp;
    assert(c_ >= 0);
    if (c_ < c) {
        c = c_;
        d = x;
    }
    dfs(s << 1);
    dfs(s * 5);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    int T;
    cin >> T;
    while (T --) {
        cin >> a >> b;
        c = 1e18;
        vis.clear();
        dfs(1);
        cout << c << ' ' << d << '\n';
    }
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3652kb

input:

4
1 2
2 3
3 7
19 79

output:

0 2
1 3
1 14
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 216ms
memory: 3680kb

input:

10000
11 12
28 53
17 60
2 35
17 181
80 123
68 141
79 163
71 99
13 64
33 61
15 32
16 61
11 86
33 74
128 143
40 53
7 23
30 31
5 6
86 181
73 91
13 23
71 81
1 2
7 38
117 160
33 83
129 151
88 153
25 58
16 19
19 141
95 124
43 96
71 139
11 59
106 109
93 152
34 43
17 99
1 57
20 159
16 25
5 73
159 170
172 17...

output:

1 12
1 54272
1 251658240
1 734003200
1 231680000
23 3936
1 36096000
5 326
1 633600000
0 64
1 31232
0 32
1 4880
1 44032
1 757760000
1 11714560
1 53000000
1 2944
1 31
1 6
1 289600000
1 455000
1 120586240
1 331776000
0 2
1 304
0 671088640
1 25937500
1 19328000
1 765000000
1 475136000
1 608
1 72192
3 81...

result:

wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)