QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#617152 | #5117. Find Maximum | mhw# | WA | 2ms | 3780kb | C++20 | 1.1kb | 2024-10-06 14:08:24 | 2024-10-06 14:08:25 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
void solve()
{
int l, r;
cin >> l >> r;
vector<int> a, b;
while(l){
a.push_back(l % 3);
l /= 3;
}
while(r){
b.push_back(r % 3);
r /= 3;
}
int f2 = 0, f1 = 0;
for(auto x:b){
if(x == 2){
f2++;
}else if(x == 1) f1++;
}
int ans = 0, ans1 = 0, ans2 = 0;
while(a.size() < b.size()) a.push_back(0);
int n = b.size();
for(int i = n - 1; i >= 0; --i){
if(a[i] != b[i]){
//先试试r
for(int j = i - 1; j >= 0; --j){
ans1 += b[j] + 1;
ans2 += 3;
}
ans1 += b[i] + 1;
if(i != n - 1) ans2 += 1;
break;
}
ans += a[i] + 1;
}
cout << ans + max(ans1, ans2) << '\n';
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int T = 1; cin >> T;
while (T--) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3780kb
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: 3748kb
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 6 6 6 6 6 7 6 7 8 6 6 7 6 7 8 7 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 9 9 9 9 9 9 9 9 10 9 9 9 9 9 10 9 10 11 9 9 10 9 10 11 10 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 4 5 6 6 6 6 6 6 7 6 7 8 6 6 7 6 7 8 7 8 9 9 9 9 9 9 9 9 9 ...
result:
wrong answer 6th numbers differ - expected: '5', found: '4'