QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#64102#5117. Find MaximumDaBenZhongXiaSongKuaiDi#WA 0ms3464kbC++20813b2022-11-24 08:57:242022-11-24 08:57:27

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-11-24 08:57:27]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3464kb
  • [2022-11-24 08:57:24]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
//	freopen("in.txt", "r", stdin);
	ios::sync_with_stdio(false), cin.tie(0);
	int T;
	for(cin >> T; T; T --) {
		i64 l, r;
		cin >> l >> r;
		vector<int> L, R;
		for(i64 x = l; x; x /= 3){
			L.emplace_back(x % 3);
		}
		for(i64 x = r; x; x /= 3){
			R.emplace_back(x % 3);
		}
		int ok = L.size() < R.size(), sum = 0, mx = 0;
		for(int i = R.size() - 1; i >= 0; i --) {
			if(L.size() == R.size()) ok |= L[i] < R[i];
			if(R[i] != 0 && ok || i == 0) {
				int cur = 0;
				cur += R[i] - 1;
				cur += i * 2;
				cur += R.size();
				cur += sum;
				cur -= (i == R.size() - 1 && R[i] == 1);
				cur += (i == 0);
				mx = max(mx, cur);
			}
			sum += R[i];
		}
		cout << mx << '\n';
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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:

1
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 1st numbers differ - expected: '2', found: '1'