题意:
给你一个排列,长度为n(n<1e5),初始为(1,2,3,…n)。给你一个整数q(q<1e5),有两种操作:
1:给你一个整数x,把排列做next_permutation运算x次 (x<1e5)
2:给你两个整数l和r,输出排列l到r区间的和 (l,r<1e5)
思路:
x和q都是1e5的,所以暴力肯定行不通。
想一些就会发现,x*q<1e10,排列最多next_permutation 1e10次,而14!就大于1e10了,所以只需要修改排列的后14个数字就行了,
代码:
#define int ll
int n, q,sum[211111],fac[15],cnt;
void update(int n, int cnt) {
set<int> s;
for (int i = max(n - 14 + 1, 1LL); i <= n; i++)s.insert(i);
for (int i = max(n - 14 + 1, 1LL); i <= n; i++){
int now = cnt / fac[n - i];
cnt -= now * fac[n - i];
auto itr = s.begin();
for (int i = 1; i <= now; i++)itr++;
sum[i] = sum[i - 1] + *itr;
s.erase(itr);
}
}
signed main() {
fac[0] = fac[1] = 1;
for (int i = 2; i <= 14; i++)fac[i] = i * fac[i - 1];
for (int i = 1; i <= 200000; i++)sum[i] = sum[i - 1] + i;
scanf("%lld%lld", &n, &q);
bool flag = false;
for (int i = 1,l,r,x; i <= q; i++) {
scanf("%lld", &x);
if (x == 1) {
if (flag)update(n, cnt), flag = false;
scanf("%lld%lld", &l, &r);
printf("%lld\n", sum[r] - sum[l - 1]);
}
else{
scanf("%lld", &l);
cnt += l;
flag = true;
}
}
return 0;
}