QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#747578#9622. 有限小数IllusionaryDominance#WA 403ms3736kbC++201.0kb2024-11-14 17:34:542024-11-14 17:35:00

Judging History

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

  • [2024-11-14 17:35:00]
  • 评测
  • 测评结果:WA
  • 用时:403ms
  • 内存:3736kb
  • [2024-11-14 17:34:54]
  • 提交

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 upd(ll c_, ll d_) {
    ll y = __gcd(c_, d_);
    if (c_ / y < c && d_ / y <= INF) {
        c = c_ / y; d = d_ / y;
    }
}

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 (s > INF) return ;
    ll tmp = s / g * a;
    ll t = (tmp - 1) / (b / g) + 1;
    ll c_ = b / g * t - tmp;
    if (t % 10 == 4) {
        upd(c_ + (b / g) * 3, x);
    }else if (t % 10 == 5) {
        upd(c_ + (b / g) * 2, x);
    }else if (~ t & 1) {
        upd(c_ + (b / g), x);
    }else {
        upd(c_, 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 = b - a; d = b;
        vis.clear(); dfs(1);
        cout << c << ' ' << d << '\n';
    }
    
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3568kb

input:

4
1 2
2 3
3 7
19 79

output:

0 1
1 3
1 14
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 403ms
memory: 3736kb

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 402653184
1 939524096
1 231680000
23 3936
1 36096000
5 326
1 633600000
0 1
1 31232
1 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 1
1 304
0 1
1 25937500
1 19328000
1 765000000
1 475136000
1 608
1 72192
3 812646400
1...

result:

wrong answer Jury found better answer than participant's 0 < 1 (Testcase 12)