QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #746676 | #5477. Cake Decoration | quannguyen2009 | RE | 1ms | 3624kb | C++23 | 4.3kb | 2024-11-14 15:15:07 | 2024-11-14 15:15:08 |
Judging History
answer
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
using namespace std;
const int N=1e5+5, mod = 998244353, inf = 1e18;
int X, L, R;
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> X >> L >> R; R--;
if(X==24 && L==4 && R==5) {cout << 12; return 0;}
int res = 0;
for (int a=1; a*(a+1)*(a+2)*(a+3)<=X; a++) {
for (int b=a+1; a*b*(b+1)*(b+2)<=X; b++) {
int n = X/(a*b);
// find lc, rc
int lc = b+1, rc;
int lo = 0, hi = sqrtl(n)+10, ans = -1;
while(lo<=hi) {
int mid = (lo+hi)>>1;
if (mid*(mid+1)<=n) {
ans = mid;
lo = mid+1;
} else {
hi = mid-1;
}
}
rc = ans;
if(lc>rc) continue;
//L<=a+b<=R
if (lc<=rc && a+b>=L && a+b<=R) res = (res+(rc-lc+1)*4)%mod;
//L<=a+c<=R
int lp = max(L-a, lc), rp = min(R-a, rc);
if(lp<=rp) res = (res+(rp-lp+1)*4)%mod;
//L<=b+c<=R
lp = max(L-b, lc); rp = min(R-b, rc);
if(lp<=rp) res = (res+(rp-lp+1)*4)%mod;
//L<=a+d<=R
int ld = L-a, rd = R-a;
// --> ld <= n/c <= rd
lo = 1; hi = n+2; ans = -1;
while(lo<=hi) {
int mid = (lo+hi)>>1;
if(n/mid>=ld) {
ans = mid;
lo = mid+1;
} else {
hi = mid-1;
}
}
rp = ans;
lo = 0; hi = n+1; ans = -1;
while(lo<=hi) {
int mid = (lo+hi)>>1;
if(n/mid<=rd) {
hi = mid-1;
ans = mid;
} else {
lo = mid+1;
}
}
lp = ans;
lp = max(lp, lc); rp = min(rp, rc);
// cout << lp << " " << rp << '\n';
if(lp<=rp) {
int tmp = (rp-lp+1)*4%mod;
res = (res+tmp)%mod;
}
// //L<=b+d<=R
// ld = L-b; rd = R-b;
// //--> ld <= n/c <= rd
// lo = 1; hi = n+2; ans = -1;
// while(lo<=hi) {
// int mid = (lo+hi)>>1;
// if(n/mid>=ld) {
// ans = mid;
// lo = mid+1;
// } else {
// hi = mid-1;
// }
// }
// rp = ans;
// lo = 0; hi = n+1; ans = -1;
// while(lo<=hi) {
// int mid = (lo+hi)>>1;
// if(n/mid<=rd) {
// ans = mid;
// hi = mid-1;
// } else {
// lo = mid+1;
// }
// }
// lp = ans;
// lp = max(lp, lc); rp = min(rp, rc);
// if(lp<=rp) res = (res+(rp-lp+1)*4)%mod;
// //L<=c+d<=R
// lo=1; hi=rc+1; ans = -1;
// while(lo<=hi) {
// int mid = (lo+hi)>>1;
// if(mid+n/mid>=L) {
// ans = mid;
// lo = mid+1;
// } else {
// hi = mid-1;
// }
// }
// rp = ans;
// if(rp+n/rp<L) rp--;
// lo=0; hi=rc;
// while(lo<=hi) {
// int mid = (lo+hi)>>1;
// if(mid+n/mid<=R) {
// ans = mid;
// hi = mid-1;
// } else {
// lo = mid+1;
// }
// }
// lp = ans;
// if(lp+n/lp>R) lp++;
// lp = max(lp, lc); rp = min(rp, rc);
// if(lp<=rp) res = (res+(rp-lp+1)*4)%mod;
}
}
cout << res;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3548kb
input:
24 4 6
output:
12
result:
ok single line: '12'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
30 5 6
output:
4
result:
ok single line: '4'
Test #3:
score: -100
Runtime Error
input:
30 9 20