2020牛客暑期多校训练营（第二场）

最新推荐文章于 2022-01-30 00:47:36 发布
最新推荐文章于 2022-01-30 00:47:36 发布
阅读量256 收藏
点赞数
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/lingran_1/article/details/107377310
版权

文章目录

A All with Pairs

题目链接
题目大意

在这里插入图片描述
给定n个字符串，字符串s,t的最长相同的前缀后缀为f(s,t)。

大致思路
对所有后缀求hash，用map来存储。然后对一个字符串的每一个前缀求出hash值，对应的map[hash[i]]就是相同后缀数量。但可能出现重复计数的情况。例如aba,后缀aba包含a,计算a是多计数了一次。所以要求出nxt数组,减去重复计数的即可。
完整代码

//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
template<class T>
void read(T& x)
{
	T res = 0, f = 1; char c = getchar();
	while (!isdigit(c)) {
		if (c == '-')f = -1; c = getchar();
	}
	while (isdigit(c)) {
		res = (res << 3) + (res << 1) + c - '0'; c = getchar();
	}
	x = res * f;
}
const ll N = 100000 + 10;
int n,nxt[N*10],num[N*10];
ll ans = 0, mod = 998244353;
string a[N];
map<ull, int>pls;
void getkmp(string a)
{
	int j = -1;
	nxt[0] = -1;
	for (int i = 1; i < a.size(); i++)
	{
		while (j != -1 && a[i] != a[j + 1])j = nxt[j];
		if (a[i] == a[j + 1])j++;
		nxt[i] = j;
	}
}
void Hash(string a)
{
	ull t = 0,base=1;
	for (int i = a.size() - 1; i >= 0; i--)
	{
		t = t + (a[i] - 'a' + 1) * base;
		base *= 2333;
		pls[t]++;
	}
}
void getnum(string a)
{
	ull t = 0;
	for (int i = 0; i < a.size(); i++)
	{
		t = t * 2333 + (a[i] - 'a' + 1);
		num[i] = pls[t];
	}
}
void getans(string a)
{
	for (int i = 0; i < a.size(); i++)
	{
		if (nxt[i] != -1)
		{
			num[nxt[i]] -= num[i];
		}
	}
	for (ll i = 0; i < a.size(); i++)
	{
		ans = (ans + num[i] * (i+1)*(i+1)) % mod;
	}
	
}
int main()
{
	//ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("182.txt", "r", stdin);
#endif // ONLINE_JUDGE
	read(n);
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		Hash(a[i]);
	}
	for (int i = 1; i <= n; i++)
	{
		getnum(a[i]);
		getkmp(a[i]);
		getans(a[i]);
	}
	printf("%lld\n", ans);
	return 0;
}

B Boundary(待补)

C Cover the Tree

题目链接
题目大意
在这里插入图片描述
求一棵树的最小链覆盖，并输出每条链的两端节点编号。

大致思路

是个结论题，最小链覆盖是叶子节点数/2向上取整。比赛的时候我不知道怎么去输出结果，队友写出来了，dfs序将叶子节点放入数组，然后i和i+size/2的点匹配。正确性题解是这样解释的
在这里插入图片描述
完整代码

//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
using namespace std;
template<class T>
void read(T& x)
{
	T res = 0, f = 1; char c = getchar();
	while (!isdigit(c)) {
		if (c == '-')f = -1; c = getchar();
	}
	while (isdigit(c)) {
		res = (res << 3) + (res << 1) + c - '0'; c = getchar();
	}
	x = res * f;
}
const ll N = 200000 + 10;

int n, head[N], sumline,du[N];
vector<int>pls;
struct line
{
	int nxt, to;
}p[N*10];
void add(int x, int y)
{
	p[++sumline] = line{ head[x],y };
	head[x] = sumline;
}
void dfs(int f, int u)
{
	if (du[u] == 1)pls.push_back(u);
	for (int i = head[u]; i; i = p[i].nxt)
	{
		int to = p[i].to;
		if (to == f)continue;
		dfs(u, to);
	}
}

int main()
{
	//ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("182.txt", "r", stdin);
#endif // ONLINE_JUDGE
	read(n);
	for (int i = 1; i <= n - 1; i++)
	{
		int x, y;
		read(x), read(y);
		add(x, y), add(y, x);
		du[x]++, du[y]++;
	}
	dfs(0, 1);
	if (pls.size() & 1)
		pls.push_back(1);
	printf("%d\n", pls.size() / 2);
	for (int i = 1; i <= pls.size() / 2; i++)
	{
		printf("%d %d\n", pls[i - 1], pls[i - 1 + pls.size() / 2]);
	}
	return 0;
}

D Duration

题目链接
题目大意

Given two moments on the same day in the form of HH:MM:SS, print the number of seconds between the two moments.

给定两个时间，输出他们之间相差的秒数。
大致思路
将时间转换为总秒数，然后输出即可(签到题)

//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
using namespace std;
template<class T>
void read(T& x)
{
	T res = 0, f = 1; char c = getchar();
	while (!isdigit(c)) {
		if (c == '-')f = -1; c = getchar();
	}
	while (isdigit(c)) {
		res = (res << 3) + (res << 1) + c - '0'; c = getchar();
	}
	x = res * f;
}
const ll N = 200000 + 10;
struct node
{
	int h, m, s;
}p[3];
int getnum(node a)
{
	return a.h * 3600 + a.m * 60 + a.s;
}
int main()
{
	//ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("182.txt", "r", stdin);
#endif // ONLINE_JUDGE
	scanf("%02d:%02d:%02d", &p[1].h, &p[1].m, &p[1].s);
	scanf("%02d:%02d:%02d", &p[2].h, &p[2].m, &p[2].s);
	int num1 = getnum(p[1]);
	int num2 = getnum(p[2]);
	printf("%d\n", abs(num1 - num2));
	return 0;
}

E Exclusive OR(待补)

F Fake Maxpooling

题目链接
题目大意

Given a matrix of size n×mn\times mn×m and an integer k{k}k, where Ai,j=lcm(i,j)A_{i,j} = lcm(i, j)Ai,j​=lcm(i,j), the least common multiple of i{i}i and j{j}j. You should determine the sum of the maximums among all k×kk\times kk×k submatrices.

大致思路
先O(n*m)求出A数组

	read(n), read(m), read(k);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			if (!a[i][j])
				for (int k = 1; k * i <= n && k * j <= m; k++)
					a[i*k][j * k] = i * k * j;

然后，利用单调队列来求最大值。最后相加。
完整代码:

//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
using namespace std;
template<class T>
void read(T& x)
{
	T res = 0, f = 1; char c = getchar();
	while (!isdigit(c)) {
		if (c == '-')f = -1; c = getchar();
	}
	while (isdigit(c)) {
		res = (res << 3) + (res << 1) + c - '0'; c = getchar();
	}
	x = res * f;
}
const ll N = 5000 + 10;
int n, m, k,a[N][N],f[N][N];

int pls[N*2],head,tail;
int main()
{
	//ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("182.txt", "r", stdin);
#endif // ONLINE_JUDGE
	read(n), read(m), read(k);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			if (!a[i][j])
				for (int k = 1; k * i <= n && k * j <= m; k++)
					a[i*k][j * k] = i * k * j;
	for (int i = 1; i <= n; i++)
	{
		head = tail = 1;
		for (int j = 1; j <= m; j++)
		{
			while (head<tail && a[i][pls[tail-1]] < a[i][j])tail--;
			while (head<tail&& j - pls[head] + 1 > k)head++;
			pls[tail++] = j;
			if (j >= k)
				f[i][j - k + 1] = a[i][pls[head]];
		}
	}
	ll ans = 0;
	
	memset(pls, 0, sizeof(pls));
	for (int j = 1; j <= m; j++)
	{
		head = tail = 1;
		for (int i = 1; i <= n; i++)
		{
			while (head <tail && f[pls[tail-1]][j] < f[i][j])tail--;
			while (head<tail && i - pls[head] + 1 > k)head++;
			pls[tail++] = i;
			if (i >= k)
				f[i - k + 1][j] = f[pls[head]][j],ans+= f[i - k + 1][j];
		}
	}
	printf("%lld\n", ans);
	return 0;
}

比赛的时候直接O(nmlogn)过去了,st表做法:

//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
using namespace std;
template<class T>
void read(T& x)
{
	T res = 0, f = 1; char c = getchar();
	while (!isdigit(c)) {
		if (c == '-')f = -1; c = getchar();
	}
	while (isdigit(c)) {
		res = (res << 3) + (res << 1) + c - '0'; c = getchar();
	}
	x = res * f;
}
const ll N = 5000 + 10;
int a[N][N], maxm[N][N], n, m, k;
int gcd(int a, int b)
{
	return !b ? a : gcd(b, a % b);
}

int main()
{
	//ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("182.txt", "r", stdin);
#endif // ONLINE_JUDGE
	ll ans = 0;
	read(n), read(m), read(k);
	for (int i = 1; i <= 5000; i++)
		for (int j = i; j <= 5000; j++)
		{
			a[i][j] = i * j / gcd(i, j);
			a[j][i] = a[i][j];
			maxm[i][j] = a[i][j];
			maxm[j][i] = a[j][i];
		}
	if (k == 1)
	{
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
				ans += a[i][j];
		printf("%lld\n", ans);
		return 0;
	}
	
	int lastbase;
	for (int base = 1; (1 << base) <= k; base++)
	{
		int len = (1 << base);
		lastbase = len;
		for (int i = 1; i + len - 1 <= n; i++)
		{
			for (int j = 1; j + len - 1 <= m; j++)
			{
				int maxa = max(maxm[i][j], maxm[i][j + len / 2]);
				int maxb = max(maxm[i + len / 2][j], maxm[i + len / 2][j + len / 2]);
				maxm[i][j] = max(maxa, maxb);
			}
		}
	}
	
	for (int i = 1; i + k - 1 <= n; i++)
		for (int j = 1; j + k - 1 <= m; j++)
		{
			int maxa = max(maxm[i][j], maxm[i][j + k - lastbase]);
			int maxb = max(maxm[i + k - lastbase][j], maxm[i + k - lastbase][j + k - lastbase]);
			maxm[i][j] = max(maxa, maxb);
			ans += maxm[i][j];
		}


	printf("%lld\n", ans);
	return 0;
}

G Greater and Greater

题目链接
题目大意

Given a sequence A{A}A of size n{n}n and a sequence B{B}B of size m{m}m, determine the number of subintervals(called S{S}S) of size m{m}m in A{A}A satisfying ∀i∈{1,2,⋯ ,m},Si≥Bi\forall i \in \{1, 2, \cdots, m\}, S_i \ge B_i∀i∈{1,2,⋯,m},Si​≥Bi​.

对于给定的A数组问有多少个长度为m子数组满足对应的元素均大于等于B[i].

大致思路
将a,b数组排序。用bitset来维护关系，对于b[i]，如果bitset[j]为1表示a[j]大于等于b[i].

完整代码

//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
using namespace std;
template<class T>
void read(T& x)
{
	T res = 0, f = 1; char c = getchar();
	while (!isdigit(c)) {
		if (c == '-')f = -1; c = getchar();
	}
	while (isdigit(c)) {
		res = (res << 3) + (res << 1) + c - '0'; c = getchar();
	}
	x = res * f;
}
const ll N = 200000 + 10;
bitset<150010>ans, res;
pair<int, int>a[N], b[N];
int n, m;
int main()
{
	//ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
	freopen("182.txt", "r", stdin);
#endif // ONLINE_JUDGE
	read(n), read(m);
	for (int i = 1; i <= n; i++)
	{
		int x; read(x);
		a[i] = { x,i };
	}
	for (int i = 1; i <= m; i++)
	{
		int x; read(x);
		b[i] = { x,i };
	}
	sort(a + 1, a + 1 + n, greater<pair<int,int> >());
	sort(b + 1, b + 1 + m, greater<pair<int,int> >());
	int p = 1;
	ans.set();
	for (int i = 1; i <= m; i++)
	{
		while (a[p].first >= b[i].first && p <= n)
			res.set(a[p++].second);
		
		ans &= (res >> (b[i].second - 1));
	}
	printf("%d\n", ans.count());
	return 0;
}

H Happy Triangle(待补)

I Interval(待补)

J Just Shuffle(待补)

K Keyboard Free(待补)

lin_rany
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
2020牛客暑期多校集训营第二场题解.pdf
01-20
2020牛客暑期多校集训营第二场题解.pdf
2020牛客暑期多校训练营（第二场）F Fake Maxpooling（二维滑动窗口）
张洪基
07-13 315
时间限制：C/C++ 3秒，其他语言6秒 空间限制：C/C++ 262144K，其他语言524288K 64bit IO Format: %lld 题目描述 Given a matrix of size n\times mn×m and an integer {k}k, where A_{i,j} = lcm(i, j)A i,j =lcm(i,j), the least common multiple of {i}i and {j}j. You should determine the sum of th
Fake Maxpooling
Mentallyhand的博客
07-14 225
题目描述 Given a matrix of size n\times mn×m and an integer {k}k, where A_{i,j} = lcm(i, j)A i,j=lcm(i,j), the least common multiple of {i}i and {j}j. You should determine the sum of the maximums among all k\times kk×k submatrices. 输入 Only one line containing
【2020牛客多校】Fake Maxpooling 单调队列求区间最大值
weixin_46105362的博客
07-14 221
题目大意：给出三个参数n,m,k，构成元素为lcm(i,j)的n×m矩阵，求所有k×k子矩阵最大值之和。 做法：用一个长度为 k 的单调队列维护最大值，保持队列为单调递减。 压入数值之前，先将所有比之小的数值弹出（如果本身是最小且队列已满，则将队首元素弹出），然后压入数值，这样保证队首元素是该区间最大元素。 代码： #include<bits/stdc++.h> using namespace std; int lcm(int a,int b) //最小公倍数 { int ta =
【牛客】5667 F-Fake Maxpooling
weixin_43983431的博客
07-15 398
链接：https://ac.nowcoder.com/acm/contest/5667/F 来源：牛客网 题目描述 Given a matrix of size n×m and an integer k, where A[i][j]=lcm(i,j), the least common multiple of i and j. You should determine the sum of the maximums among all k×k submatrices. 输入描述: Only one line
F. Zero Remainder Sum （dp）
bok_choy_的博客
12-04 203
F. Zero Remainder Sum 题目链接 You are given a matrix aa of size n×mn×m consisting of integers. You can choose no more than ⌊m2⌋⌊m2⌋ elements in each row. Your task is to choose these elements in such a way that their sum is divisible by kk and this sum is the
2020牛客暑期多校集训营第五场题解.pdf
01-20
2020牛客暑期多校集训营第五场题解.pdf
2020牛客暑期多校集训营第六场题解.pdf
01-20
2020牛客暑期多校集训营第六场题解.pdf
2020牛客多校暑期集训营第一场题解.pdf
01-20
2020牛客多校暑期集训营第一场题解.pdf
【2020年牛客暑假第二场】F题Fake Maxpooling
狙击美佐的博客
07-14 352
【2020年牛客暑假第二场】F题Fake Maxpooling思路Codedeque模拟单调队列数组模拟单调队列 题目链接：https://ac.nowcoder.com/acm/contest/5667/F 题目描述 Given a matrix of sizen×mn×mn×mand an integerkkk,whereAi×j=lcm(i,j)A_{i\times j} = lcm(i,j)Ai×j​=lcm(i,j)the least common multiple of iii and jjj.
2020牛客多校联赛第二场 （BCDF）
cmm6666的博客
07-18 336
文章目录B：Boundary题目翻译例子大意思路代码C：Cover the Tree题目翻译例子大意思路代码D：Duration题目翻译例子大意思路代码F：Exclusive OR题目翻译例子大意思路代码 B：Boundary 题目 题目描述 Given n points in 2D plane. Considering all circles that the origin point (0,0) is on their boundries, find the one with the maximum g
SLAM学习笔记——坐标变换与eigen库
qq_21043585的博客
01-30 770
文章目录Eigen库的编译内积与外积 只涉及最基本的含义，以及如何使用 Eigen库的编译 内积与外积 参考这篇博客 内积就是投影，外积大小为absinθabsin\thetaabsinθ,方向垂直于两个向量，几何意义我也不是很明确。具体性质啥的还挺多的，但是我也用不到，了解基本的计算法则就好。 ...
视觉SLAM十四讲CH3代码解析及课后习题详解
生活如此美好，致敬每一个热爱“热爱”的人！
10-19 4958
eigenMatrix.cpp #include <iostream> using namespace std; #include <ctime> // Eigen 核心部分 #include <Eigen/Core> // 稠密矩阵的代数运算（逆，特征值等） #include <Eigen/Dense> using namespace std; using namespace Eigen; #define MATRIX_SIZE 50 ////宏
Eigen::Matrix_QTRtv
fb_941219的博客
04-29 4414
ch3_EigenRotation1、Eigen2、 EIgen简介3、eigenGeometry4、visualizeGeometry 1、Eigen #include &amp;amp;lt;iostream&amp;amp;gt; using namespace std; #include &amp;amp;lt;ctime&amp;amp;gt; // Eigen 部分 #include &amp;amp;lt;Eigen/Core&amp;amp;g
Eigen 库 常用函数总结
博客
08-02 4892
该代码来源于《视觉SLAM十四讲》 Eigen初步学习部分，主要用于方便查看 #include &amp;lt;iostream&amp;gt; using namespace std; #include &amp;lt;ctime&amp;gt; // Eigen 部分 #include &amp;lt;Eigen/Core&amp;gt; // 稠密矩阵的代数运算（逆，特征值等） #include &amp;lt;Eigen/Dense&
2020牛客多校第二场F题Fake Maxpooling
xiongyuqing的博客
07-14 247
Fake Maxpooling 题意： 一个n×m的矩阵，矩阵元素的值为行数和列数的最小公倍数(least common multiple,LCM)，求所有k×k的子矩阵里最大值的和。 思路： （正解为单调队列） 找到子矩阵里行列数互质且乘积最大的那个数。k×k的循环找到这个数肯定会超时的。从正确代码里看到一个机智做法：从子矩阵里最大的那个点也就是右下角开始dfs向上向左搜索，遇到gcd(a,b)==1就return a*b，然后取最大的再返回，这样比一行一列的k×k循环要快很多，因为最大的元素肯定更靠近右
单调队列
accrazypt的博客
07-14 164
单调队列 Given a matrix of size n\times mn×m and an integer {k}k, where A[i,j] = lcm(i, j）=lcm(i,j), the least common multiple of {i}i and {j}j. You should determine the sum of the maximums among all k\times kk×k submatrices. 输入描述: Only one line containing thr
2019牛客多校第八场——A. All-one Matrices【单调栈/思维】【不可扩大的全1子矩阵个数】
MaJorieL
08-10 530
链接：https://ac.nowcoder.com/acm/contest/888/A 题目描述 Gromah and LZR entered the great tomb, the first thing they see is a matrix of size n×mn\times mn×m, and the elements in the matrix are all 00_{}0​...
2020牛客暑期多校2 C
最新发布
10-01
具体思路是，首先确定点对的数量为叶子节点数除以2，然后通过DFS序找出叶子节点，每次选择编号为i和i+cnt/2的两个叶子节点作为点对。如果叶子节点数是奇数，则将最后一个叶子节点与根节点相连。最后输出点对的数量和...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值