QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#778853 | #5117. Find Maximum | ZhZlzc | TL | 21ms | 3728kb | C++20 | 977b | 2024-11-24 16:34:37 | 2024-11-24 16:34:37 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
using LL = long long;
typedef pair<int, int> PII;
typedef unsigned long long ULL;
const int N = 1e6 + 10, M = 5010, mod = 998244353;
const int inf = 1e18;
mt19937_64 rng(time(0));
vector <int> pw;
int lim;
void solve() {
int l, r;
cin >> l >> r;
int bg = max(l, r - 1000);
int ans = 0;
for(int i = bg; i <= r; i++){
int temp = i;
int tot = 0;
int p = -1;
for(int j = lim - 1; j >= 0; j--){
int d = temp / pw[j];
if(d != 0){
tot += d;
if(p == -1) p = j;
temp -= d * pw[j];
//cout << d << " ";
}
}
p += 1;
ans = max(ans, tot + p);
}
cout << ans << "\n";
}
signed main() {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int T = 1;
cin >> T;
pw.push_back(1);
int cur = 1;
while(cur <= inf){
cur *= 3LL;
pw.push_back(cur);
}
lim = pw.size();
while(T--) {
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3728kb
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: 21ms
memory: 3612kb
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
Time Limit Exceeded
input:
10000 2924776299390853 348932224550662831 638290869233943020 897334616745111026 210780034220004669 279345354637770906 20574264013277469 387573622060864735 39441497975868873 806211034038773415 19845198891021950 243636832211738144 298454268109304380 988142879006387197 613847475002049291 86666797163210...
output:
75 85 83 81 83 88 80 82 77 79 79 80 87 80 88 86 81 74 84 85 83 87 88 85 87 87 79 78 83 85 86 84 82 77 86 80 79 85 80 74 81 80 71 77 78 83 82 76 74 81 81 84 86 77 90 85 78 75 84 83 78 80 79 76 80 81 92 81 71 74 79 93 86 75 86 79 82 81 79 80 76 74 92 74 87 80 84 74 84 81 86 82 89 86 78 79 81 85 85 86 ...