QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#847752#9868. GCDenze114514TL 18ms4220kbC++201.2kb2025-01-08 10:50:402025-01-08 10:50:40

Judging History

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

  • [2025-01-08 10:50:40]
  • 评测
  • 测评结果:TL
  • 用时:18ms
  • 内存:4220kb
  • [2025-01-08 10:50:40]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
const int mod = (int)1e9 + 7;
const ll INF = 1e18;

template<typename T>
T chmax(T a, T b){
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b){
    return a > b ? b : a;
}

const int N = (int)2e5 + 1, M = N * 2;

void solve(){
    map<pair<int, int>, int> mp;

    ll a, b, qwq = (int)1e9;
    cin >> a >> b;

    auto dfs = [&](auto& self, ll x, ll y, ll z) -> void{
        if(x == 0 || y == 0){
            qwq = chmin(qwq, z + 1);
            mp[{x, y}] = z + 1;
            return;
        }
        if(mp[{x, y}] && z >= mp[{x, y}]){
            return;
        }
        mp[{x, y}] = z;

        ll gcd = __gcd(x, y);
        x /= gcd, y /= gcd;
        self(self, x - 1, y, z + 1);
        self(self, x, y - 1, z + 1);
    };

    dfs(dfs, a, b, 0);
    cout << qwq << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    cin >> t;

    while(t--){
        solve();    
    }
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 5ms
memory: 4220kb

input:

3
3 4
12 20
114 514

output:

3
4
6

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 18ms
memory: 3584kb

input:

990
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
1 11
1 12
1 13
1 14
1 15
1 16
1 17
1 18
1 19
1 20
1 21
1 22
1 23
1 24
1 25
1 26
1 27
1 28
1 29
1 30
1 31
1 32
1 33
1 34
1 35
1 36
1 37
1 38
1 39
1 40
1 41
1 42
1 43
1 44
1 45
1 46
1 47
1 48
1 49
1 50
1 51
1 52
1 53
1 54
1 55
1 56
1 57
1 58
1 59
1 60
2 3
2 4
2...

output:

2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
2
3
4
2
3
3
2
3
4
2
3
3
2
3
4
2
3
3
2
3
4
2
3
3
2
3
4
2
3
3
2
3
4
2
...

result:

ok 990 lines

Test #3:

score: -100
Time Limit Exceeded

input:

2
4859 299556476011016293
4859 911621905353047038

output:


result: