csust-8.13早训CF之1000-1700分

最新推荐文章于 2020-10-22 08:32:17 发布
最新推荐文章于 2020-10-22 08:32:17 发布
阅读量338 收藏
点赞数
分类专栏： csust暑训
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_43906000/article/details/99436703
版权

目录

 

A - An abandoned sentiment from past

B - An express train to reveries

C - An impassioned circulation of affection

D - Karen and Morning

E - Karen and Coffee

F - Karen and Game

A - An abandoned sentiment from past

 CodeForces - 814A 

题目链接https://codeforces.com/problemset/problem/814/A

#include <bits/stdc++.h>
using namespace std;
int a[120], b[120];
int main()
{
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	for (int i = 1; i <= m; i++)
		scanf("%d", &b[i]);
	int p = -1, nb = m;
	sort(b + 1, b + 1 + m);
	for (int i = 1; i <= n; i++) {
		if (a[i] < p && a[i] != 0) {
			printf("Yes\n"); return 0;
		}
		if (a[i] == 0) {
			int mark = 0;
			for (int j = 1; j <= m; j++) {
				if (b[j] < a[i - 1]) {
					mark = 1;
					printf("Yes\n"); return 0;
				}
			}
			if (!mark) a[i] = b[nb--];
		}
		p = a[i];
	}
	for (int i = 2; i <= n; i++) {
		if (a[i] < a[i - 1]) {
			printf("Yes\n"); return 0;
		}
	}
	printf("No\n");
	return 0;
}

B - An express train to reveries

 CodeForces - 814B 

题目链接https://codeforces.com/problemset/problem/814/B

#include <bits/stdc++.h>
using namespace std;
const int mac = 1e3 + 10;
int a[mac], b[mac], vis[mac], c[mac];
int main()
{
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		vis[a[i]]++;
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", &b[i]);
	}
	for (int i = 1; i <= n; i++) {
		if (a[i] == b[i]) c[i] = a[i];
		else {
			if (vis[a[i]] > 1) {
				if (!vis[b[i]]) c[i]=b[i],vis[a[i]]--;
				else c[i] = a[i];			
			}
			else c[i] = a[i];
		}
	}
	memset(vis, 0, sizeof vis);
	for (int i = 1; i <= n; i++) vis[c[i]]++;
	for (int i = 1; i <= n; i++) {
		if (vis[c[i]] > 1) {
			if (a[i] != b[i]) {
				for (int j = 1; j <= n; j++)
					if (!vis[j]) { c[i] = j; break; }
			}
		}
	}	
	for (int i = 1; i < n; i++)
		printf("%d ", c[i]);
	printf("%d\n", c[n]);
	return 0;
}

C - An impassioned circulation of affection

 CodeForces - 814C 

题目链接https://codeforces.com/problemset/problem/814/C

法一：

#include <bits/stdc++.h>
using namespace std;
const int mac = 2e3 + 10;
char s[mac];
int dp[30][mac];
int serch(char x);
int n, q, m;
int main()
{
	scanf("%d", &n);
	scanf("%s", s);
	scanf("%d", &q);
	char st[5];
	for (int i = 1; i <= q; i++) {
		scanf("%d%s", &m, st);
		printf("%d\n", serch(st[0]));
	}
	return 0;
}
int serch(char x)
{
	int l = 0, r = 0, sum = 0, ans = 0, same = 0;
	while (l < n && r < n) {
		while ((s[r] == x || sum < m) && r < n) {
			if (s[r] != x) sum++;
			r++;
		}
		ans = max(ans, r - l);
		while (s[l] == x && l < n) {
			l++;
		}
		l++;
		sum--;
	}
	return ans;
}

法二：

#include <bits/stdc++.h>
using namespace std;
const int mac = 2e3 + 10;
char s[mac];
int dp[30][mac], sum[30][mac];
int n, q, m;
int main()
{
	int n, q, x;
	scanf("%d", &n);
	scanf("%s", s+1);
	scanf("%d", &q);
	char st[5];
	for (int i = 0; i < 26; i++) {
		for (int j = 1; j <= n; j++) {
			if (s[j] != 'a' + i) sum[i][j] = sum[i][j - 1] + 1;
			else sum[i][j] = sum[i][j - 1];
		}
	}
	for (int i = 0; i < 26; i++) {
		for (int j = 1; j <= n; j++) {
			for (int l = 1; l <= n; l++) {
				int r = upper_bound(sum[i] + l, sum[i] + n + 1, sum[i][l-1] + j) - sum[i] - 1;
				dp[i][j] = max(dp[i][j], r - l + 1);
			}
		}
	}
	for (int i = 1; i <= q; i++) {
		scanf("%d%s", &x, st);
		printf("%d\n", dp[st[0] - 'a'][x]);
	}
	return 0;
}

D - Karen and Morning

 CodeForces - 816A 

题目链接https://codeforces.com/problemset/problem/816/A

#include <bits/stdc++.h>
using namespace std;
const int mac = 1e3 + 10;
int a[mac], b[mac], vis[mac], c[mac];
char s[10];
int check(int x);
int main()
{
	scanf("%s", s);
	for (int i = 0; i <= 24 * 60; i++) {
		if (check(i)) {
			printf("%d\n", i); return 0;
		}
	}
	return 0;
}
int check(int x)
{
	int mi = (s[3] - '0') * 10 + s[4] - '0';
	mi += x;
	int hou = (s[0] - '0') * 10 + s[1] - '0';
	while (mi >= 60) hou++, mi -= 60;
	while (hou>=24) hou-=24; 
	int arr[10];
	arr[1] = hou / 10; arr[2] = hou % 10;
	arr[3] = mi / 10; arr[4] = mi % 10;
	if (arr[1] == arr[4] && arr[3] == arr[2]) return 1;
	return 0;
}

E - Karen and Coffee

 CodeForces - 816B 

题目链接https://codeforces.com/problemset/problem/816/B

#include <bits/stdc++.h>
using namespace std;
const int mac = 2e5 + 10;
int tree[mac << 2];
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define lc rt<<1
#define rc rt<<1|1
int n, k, q;
int nb[mac << 2], f[mac << 2];
void update(int l, int r, int rt, int L, int R);
void update1(int l, int r, int rt);
int query(int l, int r, int rt, int L, int R);
int main()
{
	int l, r;
	scanf("%d%d%d", &n, &k, &q);
	for (int i = 1; i <= n; i++) {
		scanf("%d%d", &l, &r);
		update(1, mac, 1, l, r);
	}
	update1(1, mac, 1);
	for (int i = 1; i <= q; i++) {
		scanf("%d%d", &l, &r);
		int ans = query(1, mac, 1, l, r);
		printf("%d\n", ans);
	}
	return 0;
}
void update(int l, int r, int rt, int L, int R)
{
	if (l >= L && r <= R) {
		tree[rt]++; f[rt]++;
		return;
	}
	if (f[rt]) {
		tree[lc] += f[rt]; tree[rc] += f[rt];
		f[lc] += f[rt]; f[rc] += f[rt];
		f[rt] = 0;
	}
	int mid = (l + r) >> 1;
	if (mid >= L) update(lson, L, R);
	if (mid < R) update(rson, L, R);
}
int query(int l, int r, int rt, int L, int R)
{
	int ans = 0;
	if (l >= L && r <= R) {
		return nb[rt];
	}
	int mid = (l + r) >> 1;
	if (mid >= L) ans += query(lson, L, R);
	if (mid < R) ans += query(rson, L, R);
	return ans;
}
void update1(int l, int r, int rt)
{
	if (l == r) {
		if (tree[rt] >= k) nb[rt] = 1;
		else nb[rt] = 0;
		return;
	}
	if (f[rt]) {
		tree[lc] += f[rt]; tree[rc] += f[rt];
		f[lc] += f[rt]; f[rc] += f[rt];
		f[rt] = 0;
	}
	int mid = (l + r) >> 1;
	update1(lson);
	update1(rson);
	nb[rt] = nb[lc] + nb[rc];
}

F - Karen and Game

 CodeForces - 816C 

题目链接https://codeforces.com/problemset/problem/816/C

#include <bits/stdc++.h>
using namespace std;
const int mac = 1e3 + 10;
const int inf = 1e8 + 10;
int a[mac][mac], b[mac][mac];
int op1[mac], op2[mac], op[mac];
int n, m;
int find(int x);
int find1(int x);
int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			scanf("%d", &a[i][j]);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++) b[i][j] = 0;
	int num = 0;
	if (n <= m) {
		for (int i = 1; i <= n; i++) {
			int x = find(i);
			if (x == 0) continue;
			for (int j = 1; j <= m; j++) b[i][j] = x;
			op1[++num] = 1; op2[num] = i, op[num] = x;
		}
		for (int i = 1; i <= m; i++) {
			if (a[1][i] != b[1][i]) {
				int x = a[1][i] - b[1][i];
				op1[++num] = 2; op2[num] = i, op[num] = x;
				for (int j = 1; j <= n; j++) b[j][i] += x;
			}
		}
	}
	else {
		for (int i = 1; i <= m; i++) {
			int x = find1(i);
			if (x == 0) continue;
			for (int j = 1; j <= n; j++) b[j][i] = x;
			op1[++num] = 2; op2[num] = i, op[num] = x;
		}
		for (int i = 1; i <= n; i++) {
			if (a[i][1] != b[i][1]) {
				int x = a[i][1] - b[i][1];
				op1[++num] = 1; op2[num] = i, op[num] = x;
				for (int j = 1; j <= m; j++) b[i][j] += x;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i][j] != b[i][j]) {
				printf("-1\n"); return 0;
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= num; i++) ans += op[i];
	printf("%d\n", ans);
	for (int i = 1; i <= num; i++) {
		while (op[i]) {
			if (op1[i] == 1) printf("row %d\n", op2[i]);
			else printf("col %d\n", op2[i]);
			op[i]--;
		}
	}
	return 0;
}
int find(int x)
{
	int mi = inf;
	for (int i = 1; i <= m; i++) mi = min(mi, a[x][i]);
	return mi;
}
int find1(int x)
{
	int mi = inf;
	for (int i = 1; i <= n; i++) mi = min(mi, a[i][x]);
	return mi;
}

 

lonely_wind_
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
get-csust-info-helper
06-02
"get-csust-info-helper" 是一个专门为长沙理工大学学生设计的工具，主要功能是帮助学生查询校园信息，包括课程表和图书馆的借阅信息。这个工具最初由用户yinbro开发，并在Gitcafe上进行了分享。后来，该项目被其他...
CSUST_:长沙理工大学——校园客户端
05-26
"CSUST_"，即长沙理工大学的校园客户端，旨在提供一个便捷、全面的服务平台，帮助师生更好地融入校园生活。这款客户端是用Java编程语言开发的，充分体现了Java在跨平台应用开发中的优势。 首先，我们来探讨一下Java...
训练 CF 1700分 题解
yangzijiangac的博客
10-22 353
CodeForces264BCodeForces 264BCodeForces264B GoodSequencesGood SequencesGoodSequences 思路： 质因数分解后，求当前数的质因数种出现的最大次数，然后当前数的所有质因数赋值当前的最大，进行dpdpdp即可，时间复杂度 O(nlogn)O(nlogn)O(nlogn) /* * @Author: vain * @Date: 2020 * @LastEditTime: 2020-10-06 13:40:49 * @Last
csust-8.10早训CF之700-1700分
孤风的博客
08-10 280
目录 A - Anton and Danik B - Anton and Digits C - Anton and Making Potions D - Ostap and Grasshopper E - Urbanization F - Tennis Championship A - Anton and Danik CodeForces - 734A 题目链接http...
2016-2017 ACM-ICPC, Egyptian Collegiate Programming Contest (ECPC 16)
qq_24664053的博客
11-17 1499
我带了大表（哥）？ 两人组帮集训队测比赛，这场三星GYM做挂了。。。 GG然后看到q AK了。。。 当时熊神过了一大堆题，我才把A 过了。。。 然后熊神又过了一大堆题，我还没有做出J 。。。 然后赛后发现，J题读错题了。。。。。。。。。。。A 有G堆石子，每一堆有n个，每次可以从一堆中取 b^0..b^1..b^2……b^m （<=n）个，判断先手胜负诶，一开始就看到这题，然后刚好
csust-8.12早训CF之1000-1600分
孤风的博客
08-13 316
目录 A - Straight «A» B - Summer sell-off C - Do you want a date? D - Sagheer and Crossroads E - Sagheer, the Hausmeister F - Sagheer and Nubian Market A - Straight «A» CodeForces - 810A 题...
csust-8.14早训CF之1000-2000分
孤风的博客
08-14 596
目录 A - Treasure Hunt B - Makes And The Product C - Really Big Numbers D - Diplomas and Certificates E - Permutation Game F - Sofa Thief A - Treasure Hunt CodeForces - 817A 题目链接https://co...
csust-8.8早训CF之1000-1800分
孤风的博客
08-09 305
目录 A - Checking the Calendar B - Batch Sort C - Ray Tracing D - Interview with Oleg E - Spotlights F - Road to Cinema A - Checking the Calendar CodeForces - 724A 题目链接https://codeforces.c...
csust-8.7早训CF之800-1600分
孤风的博客
08-07 410
目录 A - Text Document Analysis B - Polycarp at the Radio C - Lakes in Berland D - Transformation: from A to B E - Bill Total Value F - The New Year: Meeting Friends A - Text Document Analysis...
csust-8.11早训CF之1100-1500分
孤风的博客
08-11 307
目录 A - Nearest Minimums B - Two Cakes C - Three Garlands D - Div. 64 E - Cubes for Masha F - Solution for Cube A - Nearest Minimums CodeForces - 911A 题目链接https://codeforces.com/problemse...
计算机网络原理实验报告---Wireshark实验:HTTP协议分析
01-20
**实验报告概述** ... ... ...它基于TCP/IP协议栈，以请求/响应模型进行交互。...2. **请求头部**：包含了关于客户端环境和请求正文的元数据，如"Host"（主机地址）、"User-Agent"（用户代理信息）、"Connection"（连接管理，...
yolov5的道路交通标志检测系统源码+训练好的模型+交通标志数据集（期末大作业）.zip
10-04
yolov5的道路交通标志检测系统源码+训练好的模型+交通标志数据集（期末大作业）.zip代码完整下载可用，98分的期末大作业项目。 交通标志的目标检测算法在计算机视觉领域一直属于热点研究问题，改进的优化算法不断...
2013ACM多校联合(1)_CSUST(标程+数据)第一次修改
03-17
标题 "2013ACM多校联合(1)_CSUST(标程+数据)第一次修改" 暗示这是一个关于ACM（国际大学生程序设计竞赛，International Collegiate Programming Contest）的比赛资料集，包含了2013年3月17日某场赛事的题目解析、...
csust-8.3组队训练-Gym 101853(二星题）全题解
孤风的博客
08-03 761
目录 A - Zero Array B - New Assignment C - Intersections D - Balloons E - Maximum Sum F - Working Time G - Hard Equation H - Cube I - Circles J - Smallest Difference K - Citations A - Zer...
csust-8.5组队训练-Gym - 101972(三星题）
孤风的博客
08-05 649
目录 A - Multiplication Dilemma B - Updating the Tree C - Shortest Path! D - Wooden Fence E - Stupid Submissions F - I'm Bored! G - Minimax H - Beautiful Substrings I - Secret Project J - E...
csust-8.10组队训练- 第九届福建省大学生程序设计竞赛-重现赛
孤风的博客
08-10 549
目录 A - Uint47 calculator B - Human life C - Alice and Bob D - Number theory E - Traffic jam F - Prefix G - IoU H - Chosen by god I - Necklace J - Mind control K - Book A - Uint47 calcul...
csust-8.7组队训练-Gym - 101968（三星题）
孤风的博客
08-09 508
目录 A - Tree Game B - Rectangles C - Function D - Two Sequences E - Connecting Components F - Mirror G - TeddyBearsDay H - Win Strategy I - Tours J - Restricted Vertex Cover A - Tree Game...
csust-8.12组队训练- Gym - 101466
孤风的博客
08-12 413
目录 A - Gaby And Addition B - Maximum Tree C - Planet Communcation D - Double it E - Text Editor F - Polygon Triangles G - Generative Model H - Logo I - Math Class J - Jeronimo's List K -...
yolov5交通标志识别GTSRB
最新发布
12-11
git clone https://github.com/csust7zhangjm/CCTSDB.git git clone https://github.com/ultralytics/yolov5.git ``` 2. 将CCTSDB数据集转换为YOLOv5所需的格式 ```shell cd CCTSDB python3 cctsdb2yolo.py `...

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

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

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值