QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#545723 | #5117. Find Maximum | ucup-team1329# | WA | 2ms | 3828kb | C++20 | 878b | 2024-09-03 16:37:50 | 2024-09-03 16:37:50 |
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;
std::vector<int> l, r;
i64 ans = 0, ansr = 0;
while (R) {
r.push_back(R % 3);
ansr += R % 3;
R /= 3;
}
while (l.size() < r.size()) {
l.push_back(L % 3);
L /= 3;
}
for (int i = r.size() - 1; i >= 0; i--) {
if (l[i] != r[i]) {
ans += r[i] - 1 + i * 2;
if (i == r.size() - 1 && r[i] == 1) ans--;
break;
}
ans += r[i];
}
std::cout << std::max(ans, ansr) + r.size() << '\n';
}
};
int main() {
Fast_IOS;
WORK work;
int T = 1;
std::cin >> T;
while (T--) {
work.solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3744kb
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: 2ms
memory: 3828kb
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 6 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 9 9 9 9 9 10 9 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 6 7 8 8 8 8 8 8 8 8 8 9...
result:
wrong answer 15th numbers differ - expected: '7', found: '6'