QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#751087 | #5117. Find Maximum | nahida_qaq | WA | 0ms | 3636kb | C++23 | 1.1kb | 2024-11-15 17:03:20 | 2024-11-15 17:03:21 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define io ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb push_back
using namespace std;
const int N=1e6+5,mod1=1e9+7,mod2=998244353,inf=1e18;
typedef pair<int,int> pi;
int ll[100],rr[100];
void solve()
{
int l,r;
cin>>l>>r;
int cnt=0;
while(l)
{
int x=l%3;
ll[cnt++]=x;
l/=3;
}
cnt=0;
while(r)
{
int x=r%3;
rr[cnt++]=x;
r/=3;
}
//cout<<cnt<<'\n';
int ans=cnt;
for(int i=cnt-1;i>=0;i--)ans+=rr[i];
vector<int>q(cnt);
int res=0;
for(int i=cnt-1;i>=0;i--)
{
//if(rr[i]==2||rr[i]==1)
{
q[i]=max(0ll,rr[i]-1);
//for(int j=0;j<i;j++)q[j]=2;
int num=cnt;
while(q[num-1]==0&&num)num--;
ans=max(ans,2*i+res+q[i]+num);
res+=rr[i];
//cout<<ans<<'\n';
q[i]=rr[i];
}
}
cout<<ans<<'\n';
}
signed main()
{
io;
int t=1;
cin>>t;
while(t--)
{
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3552kb
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: 0ms
memory: 3636kb
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'