1004 I love counting
题意:给定一个长度为n的序列,序列元素c≤n。总共有Q个询问,每个询问都有一个区间(l,r)和两个参数a、b,求这个区间有多少种元素c满足 c⨁a≤b,其中⨁是二进制按位异或运算。
数据范围:n≤100000,1≤c≤n,Q≤100000,1≤l≤r≤n,a≤n+1,b≤n+1
方法1:莫队+字典树
对于每个询问,在区间调整过程中向字典树插入元素或从字典树中删除元素,维护一个v数组,确保区间每种元素只插入一次或删除一次,再维护一个cnt数组记录字典树每个节点扩展到该节点的元素个数。调整完区间后,进行字典树搜索更新答案。由于添加和删除操作都要遍历字典树导致时间复杂度过高,实测程序在超时边缘徘徊(1900+ms)。
// 莫队+字典树 2s左右
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, q, siz, c[maxn], v[maxn], ans[maxn];
int cnt[maxn << 4], tr[maxn << 4][2];
struct Q {
int l, r, a, b, id;
bool operator<(const Q &q) const {
return l / siz == q.l / siz ? ((l / siz) & 1 ? r < q.r : r > q.r) : l < q.l;
}
} a[maxn];
void add(int x) {
static int tot = 1;
int p = 1;
for (int i = 16; i >= 0; i--) {
int y = (x >> i) & 1;
if (tr[p][y] == 0) tr[p][y] = ++tot;
p = tr[p][y];
cnt[p]++;
}
}
void del(int x) {
int p = 1;
for (int i = 16; i >= 0; i--) {
int y = (x >> i) & 1;
p = tr[p][y];
cnt[p]--;
}
}
int update(int a, int b) {
int p = 1;
int sum = 0;
for (int i = 16; i >= 0; i--) {
int x = (a >> i) & 1;
int y = (b >> i) & 1;
if (y) sum += cnt[tr[p][x]], p = tr[p][!x];
else p = tr[p][x];
if (cnt[p] == 0) break;
}
return sum += cnt[p];
}
int main() {
scanf("%d", &n);
siz = sqrt(n);
for (int i = 1; i <= n; i++) scanf("%d", c + i);
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d%d%d%d", &a[i].l, &a[i].r, &a[i].a, &a[i].b);
a[i].id = i;
}
sort(a, a + q);
for (int i = 0, l = 1, r = 0; i < q; i++) {
while (l > a[i].l) if (v[c[--l]]++ == 0) add(c[l]);
while (r < a[i].r) if (v[c[++r]]++ == 0) add(c[r]);
while (l < a[i].l) if (v[c[l++]]-- == 1) del(c[l - 1]);
while (r > a[i].r) if (v[c[r--]]-- == 1) del(c[r + 1]);
ans[a[i].id] = update(a[i].a, a[i].b);
}
for (int i = 0; i < q; i++) printf("%d\n", ans[i]);
return 0;
}
方法2:莫队+分块
该方法将插入和删除操作时间复杂度将至O(1),其寻找答案的方法与方法1基本相同。该方法将序列元素映射为分块的下标,更新答案时转换为区间求和。
// 莫队+分块
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
int n, q, siz, c[maxn], b[maxn], v[maxn], sum[maxn], ans[maxn];
struct Q {
int l, r, a, b, id;
bool operator<(const Q &q) const {
return l / siz == q.l / siz ? ((l / siz) & 1 ? r < q.r : r > q.r) : l < q.l;
}
} a[maxn];
void add(int x, int y) {
sum[x / siz] += y;
b[x] += y;
}
int ask(int l, int r) {
int bl = l / siz, br = r / siz, ans = 0;
if (bl == br) for (int i = l; i <= r; i++) ans += b[i];
else {
for (int i = l; i < bl * siz + siz; i++) ans += b[i];
for (int i = br * siz; i <= r; i++) ans += b[i];
for (int i = bl + 1; i < br; i++) ans += sum[i];
}
return ans;
}
int main() {
scanf("%d", &n);
siz = sqrt(n);
for (int i = 1; i <= n; i++) scanf("%d", c + i);
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d%d%d%d", &a[i].l, &a[i].r, &a[i].a, &a[i].b);
a[i].id = i;
}
sort(a, a + q);
for (int i = 0, l = 1, r = 0; i < q; i++) {
while (l > a[i].l) if (v[c[--l]]++ == 0) add(c[l], 1);
while (r < a[i].r) if (v[c[++r]]++ == 0) add(c[r], 1);
while (l < a[i].l) if (v[c[l++]]-- == 1) add(c[l - 1], -1);
while (r > a[i].r) if (v[c[r--]]-- == 1) add(c[r + 1], -1);
int now = 0;
for (int j = 16; j >= 0; j--) {
if (a[i].b >> j & 1) {
int l = now;
if (a[i].a >> j & 1) l |= 1 << j;
ans[a[i].id] += ask(l, l | (1 << j) - 1);
}
if ((a[i].a ^ a[i].b) >> j & 1) now |= 1 << j;
}
ans[a[i].id] += b[a[i].a ^ a[i].b];
}
for (int i = 0; i < q; i++) printf("%d\n", ans[i]);
return 0;
}
1010 I love permutation
题意:给定一个奇素数P和一个小于P的正整数a,构造一个长度为P-1的序列b , 其中bx = x * a % P ( 1 <= x <= p - 1) 。求序列b中逆序对个数,结果对2取模。
分析:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll qmul(ll a, ll b, ll p) {
ll c = (long double)a / p * b;
ll res = (ull)a * b - (ull)c * p;
return (res + p) % p;
}
ll qpow(ll a, ll b, ll p) {
ll res = 1;
while (b) {
if (b & 1) res = qmul(res, a, p);
a = qmul(a, a, p);
b >>= 1;
}
return res;
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
ll a, p;
scanf("%lld%lld", &a, &p);
ll sgn = qpow(a, (p - 1) / 2, p);
puts(sgn == 1 ? "0" : "1");
}
return 0;
}