1)小圆前辈去上学:将小数四舍五入,签到题,无价值。
2)小圆前辈的素数:暴力优化。能使用暴力尽量使用暴力。
3)小圆前辈的排列组合:签到提。
4)小圆前辈的数组:倍增,二分
题意:给一个数组,问有多少个连续子序列之和为k的平方而且大于z。
题解:看到题直接无脑倍增,都没多想一下更简单的做法emmm。
大佬代码(玛德,竟然没想到还可以这么做,白写了一个小时倍增——倍增还很不熟练啊):
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
using ll = long long;
vector<int> e[N];
ll a[N];
ll s[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
vector<int> qq{1, 2, 3, 4};
ll n, k, z;
cin >> n >> k >> z;
e[0].emplace_back(0);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
s[i] = s[i - 1] + a[i];
e[s[i] % k].emplace_back(i);
}
ll ans = 0;
for (int i = 0, j = 1; i < n; ++i) {
auto x = s[i] % k;
for (; j <= n && s[j] - s[i] < z; ++j)
;
if (j > n)
break;
ans += end(e[x]) - lower_bound(begin(e[x]), end(e[x]), j);
}
cout << ans;
}
我的代码:
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mst(a, i) memset(a, i, sizeof(a))
#define dbg(x) cout << #x << "===" << x << endl
#define read(x) scanf("%lld", &x)
#define print(a, c) printf("%lld%c", a, c)
using namespace std;
const double eps = 1e-8;
const int maxn = 1e5 + 10;
const int mod = 998244353;
const int inf = 1e18;
int n, k, z, f[maxn][30];
int a[maxn], sum[maxn];
signed main() {
read(n), read(k), read(z);
for (int i = 1; i <= n; i++) read(a[i]), sum[i] = sum[i - 1] + a[i];
sum[n + 1] = 1e18;
int cnt = 0, l = 1;
for (int i = 1; i <= n; i++) {
cnt += a[i];
if (cnt % k == 0) f[l][0] = i + 1, l = i + 1;
}
if (!f[l][0]) f[l][0] = n + 2; //表示没有了
for (int i = 2; i <= n; i++) {
cnt = 0, l = i;
if (f[l][0] > 0) continue;
for (int j = i; j <= n; j++) {
if (f[l][0]) break;
cnt += a[j];
if (cnt % k == 0)
f[l][0] = j + 1, l = j + 1;
else if (j == n && !f[l][0])
f[l][0] = n + 2;
}
}
for (int i = 0; i <= 20; i++) f[n + 1][i] = n + 2, f[n + 2][i] = n + 2;
for (int j = 1; j <= 20; j++)
for (int i = 1; i <= n; i++) f[i][j] = f[f[i][j - 1]][j - 1];
int ans = 0;
for (int i = 1; i <= n; i++) {
cnt = 0, l = i;
//以下的f[l][j]<=n+1很重要
for (int j = 20; j >= 0; j--)
if (cnt + sum[f[l][j] - 1] - sum[l - 1] < z && f[l][j] <= n + 1)
cnt += sum[f[l][j] - 1] - sum[l - 1], l = f[l][j];
l = f[l][0];
if (l <= n + 1) ans++;
for (int j = 20; j >= 0; j--)
if (f[l][j] <= n + 1) ans += (1 << j), l = f[l][j];
}
print(ans, '\n');
return 0;
}
5)小圆前辈的博弈:字典树,哈希,字符串(实在是一个坑壁题)
题意:给定两个长度分别为n,m(1<=n,m<=2000)的两个字符串a,b。求从a中任意取出的一个子串,在b种没有相同的子串的子串总数(a="abab",01,23位置的字串认为是两个子串)。
题解:暴力解法很容易想到,先枚举b中出现的子串,然后枚举a中没有在b中出现的子串,很容易想到用哈希可以做(字典树挺久没用忘了emmm)。
哈希解法:被坑惨了,能不用哈希就不用哈希!!,尽量不用哈希,除非实在不知道怎么解决了(不过应该不会出现这种情况)。
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
const double PI = acos(-1.0);
const double eps = 0.000001;
#define mod 100000000000007;
int n, m;
unordered_map<ll, int> m1;
int main() {
cin >> n >> m;
string s, s1;
cin >> s >> s1;
ll num = 0;
for (int i = 0; i < m; i++) {
ll p = 0;
for (int j = i; j < m; j++) {
p = (p * 233 + (s1[j] - 'a' + 1)) % mod;
m1[p] = 1;
}
}
for (int i = 0; i < n; i++) {
ll p = 0;
for (int j = i; j < n; j++) {
p = (p * 233 + (s[j] - 'a' + 1)) % mod;
if (m1[p] != 1) {
num += n - j;
break;
}
}
}
cout << num << endl;
}
字典树解法:
#include <bits/stdc++.h>
// #define int long long
#define pb push_back
#define mst(a, i) memset(a, i, sizeof(a))
#define dbg(x) cout << #x << "===" << x << endl
#define read(x) scanf("%d", &x)
#define print(a, c) printf("%d%c", a, c)
using namespace std;
const int maxn = 2e3 + 10;
const int maxm = 4e6 + 10;
int n, m;
char a[maxn], b[maxn];
int trie[maxm][30], cnt; //注意trie数组大小为点的个数
//这种截取字符串的方式,很方便!!!
void insert(char *s, int l, int r) {
int p = 0;
for (int i = l; i <= r; i++) {
int x = s[i] - 'a';
if (!trie[p][x]) trie[p][x] = ++cnt;
p = trie[p][x];
}
}
bool query(char *s, int l, int r) {
int p = 0;
for (int i = l; i <= r; i++) {
int x = s[i] - 'a';
if (!trie[p][x]) return false;
p = trie[p][x];
}
return true;
}
signed main() {
read(n), read(m);
scanf("%s%s", a, b);
for (int i = 0; i < m; i++) insert(b, i, m - 1);
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
if (!query(a, i, j)) ans++;
}
}
print(ans, '\n');
return 0;
}
6)小圆前辈的暴力枚举:暴力,思维(找规律),排列组合。
题意:给定一个n*m的迷宫,可以放任意个东西进去,但是任意两个不能在同一行或者同一列。问最多有多少种放法,最后答案对998244353取余。
题解:之前做过这种题,dfs。没想到还能这么做(学到了)——排列组合。
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mst(a, i) memset(a, i, sizeof(a))
#define dbg(x) cout << #x << "===" << x << endl
using namespace std;
void read(int &x) {
int res = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
res = (res << 3) + (res << 1) + (c - '0'), c = getchar();
x = f * res;
}
void OUT(int x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) OUT(x / 10);
putchar(x % 10 + '0');
}
void print(int a, char c) { OUT(a), putchar(c); }
const double eps = 1e-8;
const int maxn = 1e3 + 10;
const int mod = 998244353;
const int inf = 1e18;
int n, m;
int re[maxn], inv[maxn], fac[maxn];
void init(int n) {
re[0] = inv[1] = fac[0] = re[1] = fac[1] = 1;
for (int i = 2; i <= n; ++i) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
re[i] = re[i - 1] * inv[i] % mod;
}
}
int C(int a, int b) { return fac[a] * re[b] % mod * re[a - b] % mod; }
int pow(int a, int p, int mod) {
int ans = 1;
while (p) {
if (p & 1) ans = ans * a % mod;
p >>= 1, a = (a * a) % mod;
}
return ans;
}
signed main() {
read(n), read(m);
if (n < m) swap(n, m);
init(n);
int ans = 0, f = 1, x = m;
for (int i = 0; i <= m; i++) {
if (i > 0) f = f * x % mod, x--;
ans = (ans + C(n, i) * f) % mod;
// cout << i << " " << C(n, i) << " " << f << endl;
}
print(ans, '\n');
return 0;
}