QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#627739#5117. Find Maximumdaoqi#WA 1ms3624kbC++20626b2024-10-10 16:59:422024-10-10 16:59:42

Judging History

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

  • [2024-10-10 16:59:42]
  • 评测
  • 测评结果：WA
  • 用时：1ms
  • 内存：3624kb
查看
  • [2024-10-10 16:59:42]
  • 提交

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 - 10); 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;
}
源文件, 语言: C++20

详细

Test #1:

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

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: -100
Wrong Answer
time: 1ms
memory: 3624kb

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
10
10
10
10
10
10
10
11
11
11
11
11
11
11
11
11
12
12
12
12
12
12
12
12
12
12
12
10
10
10
10
10
10
10
11
11
11
3
3
4
5
5
5
6
6
6
6
6
6
7
7
7
8
8
8
8
8
8
8...

result:

wrong answer 64th numbers differ - expected: '11', found: '10'
English 繁體中文 简体中文

服务器时间: 2024-12-02 20:05:06 | 开源项目