QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#545617 | #5117. Find Maximum | ucup-team1329# | WA | 1ms | 3700kb | C++20 | 827b | 2024-09-03 15:34:47 | 2024-09-03 15:34:48 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
using A2 = std::array<i64, 2>;
#define Fast_IOS std::ios::sync_with_stdio(false), std::cin.tie(0), std::cout.tie(0)
const i64 mod = 998244353;
class WORK {
public:
int N;
WORK() {}
void solve() {
i64 L, R;
std::cin >> L >> R;
i64 l = L, r = R, calr = 0, lenr = 0;
while (r) {
calr += r % 3;
lenr++;
r /= 3;
}
r = R;
i64 cnt = 0, ans = 0;
while (r) {
if (l / 3 != r / 3) {
ans = cnt * 2 + r % 3 - 1;
r /= 3;
while (r) {
ans += r % 3;
r /= 3;
}
break;
}
l /= 3;
r /= 3;
cnt++;
}
std::cout << std::max(ans, calr) + lenr << '\n';
}
};
int main() {
Fast_IOS;
WORK work;
int T = 1;
std::cin >> T;
while (T--) {
work.solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3696kb
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: 3700kb
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 4 5 6 4 5 6 5 6 7 6 7 8 5 6 7 6 7 8 7 8 9 5 6 7 6 7 8 7 8 9 6 7 8 7 8 9 8 9 10 7 8 9 8 9 10 9 10 11 6 7 8 7 8 9 8 9 10 7 8 9 8 9 10 9 10 11 8 9 10 9 10 11 10 11 12 6 7 8 7 8 9 8 9 10 7 8 9 8 9 10 9 10 11 8 9 3 3 4 5 4 5 6 4 5 6 5 6 7 6 7 8 5 6 7 6 7 8 7 8 9 5 6 7 6 7 8 7 8 9 6 7 8 7 8 9 8 ...
result:
wrong answer 6th numbers differ - expected: '5', found: '4'