QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#748623 | #5117. Find Maximum | Mocic1 | WA | 1ms | 3768kb | C++14 | 1001b | 2024-11-14 20:53:44 | 2024-11-14 20:53:45 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define int long long
#define pb push_back
#define ff first
#define ss second
typedef pair<int, int> PII;
const int N = 300007;
const int inf = 1e18;
const int mod = 1e9+7;
mt19937_64 rng(time(0));
int bl[80],br[80];
void solve() {
int l,r;
cin>>l>>r;
int cl=0,cr=0;
for(int i=0;i<80;i++)bl[i]=0;
while(l){
bl[++cl]=l%3;
l/=3;
}
while(r){
br[++cr]=r%3;
r/=3;
}
int ans=0,cnt=0;
for(int i=cr;i>=1;i--){
if(br[i]==2){
cnt=max(cnt,ans+2+(i-1)*3);
}
else if(br[i]==1){
if(i==cr)cnt=max(cnt,ans+(i-1)*3);
else cnt=max(cnt,ans+1+(i-1)*3);
}
ans+=1+br[i];
}
cout<<max(ans,cnt)<<'\n';
}
signed main() {
ios;
int _ = 1;
cin >> _;
while (_--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3768kb
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: 3656kb
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:
wrong answer 491st numbers differ - expected: '4', found: '5'