QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#768717 | #5117. Find Maximum | fosov | WA | 11ms | 3588kb | C++14 | 1.2kb | 2024-11-21 13:57:03 | 2024-11-21 13:57:04 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lll __int128
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define N 5050
int f(ll x) {
if (!x) return 1;
if (x%3) return f(x-1)+1;
return f(x/3)+1;
}
int main() {
#ifdef TEST
freopen("zz.in", "r+", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t; cin >> t;
while (t --) {
ll l, r; cin >> l >> r;
vector<int> a;
for (int i = r; i; i /= 3) a.emplace_back(i%3);
reverse(all(a));
int res = 0;
for (int i = 0; i < a.size(); ++ i) {
ll x = 0;
for (int j = 0; j < i; ++ j) {
x = 3 * x + a[j];
}
x = 3 * x + a[i] - 1;
for (int j = i + 1; j < a.size(); ++ j) {
x = 3 * x + 2;
}
if (x >= l) res = max(res, f(x));
}
cout << max(res, max(f(l), f(r))) << '\n';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3516kb
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: 0
Accepted
time: 2ms
memory: 3448kb
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:
ok 5050 numbers
Test #3:
score: -100
Wrong Answer
time: 11ms
memory: 3588kb
input:
10000 2924776299390853 348932224550662831 638290869233943020 897334616745111026 210780034220004669 279345354637770906 20574264013277469 387573622060864735 39441497975868873 806211034038773415 19845198891021950 243636832211738144 298454268109304380 988142879006387197 613847475002049291 86666797163210...
output:
72 76 79 72 70 83 75 81 71 71 76 77 84 75 81 85 78 70 75 79 73 78 80 79 78 80 73 74 79 76 83 79 78 76 77 73 73 78 80 72 78 76 69 74 73 74 76 72 75 80 76 81 78 72 80 79 73 73 78 79 76 88 73 73 74 75 85 75 72 78 71 88 83 76 78 72 82 85 77 87 74 72 83 73 80 75 80 78 85 77 80 71 81 81 74 76 80 84 83 82 ...
result:
wrong answer 1st numbers differ - expected: '110', found: '72'