QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#750936#5117. Find Maximumnahida_qaqWA 1ms3608kbC++231.3kb2024-11-15 16:25:572024-11-15 16:25:58

Judging History

你现在查看的是最新测评结果

  • [2024-11-15 16:25:58]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3608kb
  • [2024-11-15 16:25:57]
  • 提交

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=0;
    vector<int>q(cnt);
    int res=0;
    for(int i=cnt;i>=0;i--)
    {
        res=0;
        for(int j=0;j<i;j++)q[j]=2;
        for(int j=i;j<cnt;j++)q[j]=rr[j],res+=q[j];
        int tmp=0;
        for(int j=cnt-1;j>=0;j--)
        {
            if(q[j]<ll[j])
            {
                tmp=1;
                break;
            }
            if(q[j]>ll[j])break;
        }
        for(int j=cnt-1;j>=0;j--)
        {
            if(q[j]>rr[j])
            {
                tmp=1;
                break;
            }
            if(q[j]<rr[j])break;
        }
        if(tmp)continue;
        ans=max(ans,2*i+res);
    }
    cout<<ans+cnt<<'\n';
}
signed main()
{
    io;
    int t=1;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3520kb

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: 3608kb

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'