QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#627744#5117. Find Maximumdaoqi#WA 306ms91020kbC++20627b2024-10-10 17:00:442024-10-10 17:00:44

Judging History

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

  • [2024-10-10 17:00:44]
  • 评测
  • 测评结果：WA
  • 用时：306ms
  • 内存：91020kb
查看
  • [2024-10-10 17:00:44]
  • 提交

answer

#include<bits/stdc++.h>

using i64 = long long;

std::unordered_map<i64, i64> mp;

i64 fun(i64 x) {
    if (mp.count(x)) return mp[x];
    if (x == 0) return mp[x] = 1;
    if (x % 3 == 0) return mp[x] = fun(x / 3) + 1;
    return mp[x] = fun(x - 1) + 1;
}

void DAOQI() {
    i64 l, r;
    std::cin >> l >> r;
    i64 ans = 0;
    for (i64 i = r; i >= std::max(l, r - 100); i--) ans = std::max(ans, fun(i));
    std::cout << ans << "\n";
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    std::cin >> T;
    while (T--) DAOQI();
    return 0;
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

10
1 2
1 3
1 4
1 5
2 3
2 4
2 5
3 4
3 5
4 5

output:

3
3
4
5
3
4
5
4
5
5

result:

ok 10 numbers

Test #2:

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

input:

5050
1 1
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
1 61...

output:

2
3
3
4
5
5
5
6
6
6
6
6
6
7
7
7
8
8
8
8
8
8
8
8
8
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
10
10
10
10
10
10
10
10
10
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
11
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
12
3
3
4
5
5
5
6
6
6
6
6
6
7
7
7
8
8
8
8
8
8
8...

result:

ok 5050 numbers

Test #3:

score: -100
Wrong Answer
time: 306ms
memory: 91020kb

input:

10000
2924776299390853 348932224550662831
638290869233943020 897334616745111026
210780034220004669 279345354637770906
20574264013277469 387573622060864735
39441497975868873 806211034038773415
19845198891021950 243636832211738144
298454268109304380 988142879006387197
613847475002049291 86666797163210...

output:

73
85
80
76
71
85
79
81
77
76
79
79
86
76
88
86
81
69
83
83
77
80
82
85
83
86
79
77
82
85
84
81
81
76
80
75
76
82
79
73
81
80
68
76
75
80
82
74
72
78
81
83
81
75
83
82
76
74
84
78
77
80
78
76
80
81
89
76
70
73
76
93
85
75
82
79
82
78
78
78
76
74
89
74
83
77
84
69
79
79
82
77
89
84
77
78
81
80
84
85
...

result:

wrong answer 1st numbers differ - expected: '110', found: '73'
English 繁體中文 简体中文

Server Time: 2024-12-02 17:41:29 | OpenSource Project