QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#400860#5117. Find Maximumsuibian_xiaozhaoWA 1ms3652kbC++231.2kb2024-04-27 17:04:022024-04-27 17:04:04

Judging History

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

  • [2024-04-27 17:04:04]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3652kb
  • [2024-04-27 17:04:02]
  • 提交

answer

#include "bits/stdc++.h"

using namespace std;

#ifndef ONLINE_JUDGE

#include "test.h"

#else
#define debug(...) 42
#define debug_assert(...) 42
#endif


#define IOS ios::sync_with_stdio(0),cin.tie(0)

using ll = long long;
using ull = unsigned long long;

#define endl '\n'
#define int ll

using VI = vector<int>;
using VII = vector<VI>;
using PII = pair<int, int>;
const int inf = 1e18;
const int mod = 1e9 + 7;

void init() {

}


map<pair<int, int>, int> mp;

int get(int l, int r) {
 
    if (l == 0 && r == 0)return 1ll;
    if (l / 3 == r / 3) {
        int ans = get(l / 3, r / 3) + 1 + r % 3;
        if (r < 3)ans--;
   
        return ans;
    }
    if (l > r)return 0ll;

    int ls = get(l / 3, l / 3) + 3;
    if(l<3)ls--;
    int rs = get(r / 3, r / 3)  +1+ r % 3;
    if(r<3)rs--;
    l = l / 3 + 1;
    r = r / 3 - 1;
    return max({ls, rs, get(l, r)});
}

void solve() {
    int l, r;
    cin >> l >> r;


    int ans = get(l, r);
    cout << ans << endl;
}

signed main() {
    IOS;
    init();
    // debug(1);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}
//3
// 3
// 4
// 5
// 3
// 4
// 5
// 4
// 5
// 5


Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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
6
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
8
8
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
9
9
9
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
6
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'