csust-8.5组队训练-Gym - 101972(三星题）

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

目录

 

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 - Even Numbers

K - Cyclic Shift

。。。。B题还不会，会了就补QAQ。。。

A - Multiplication Dilemma

 Gym - 101972A 

题目链接https://codeforces.com/gym/101972/problem/A

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int a[maxn],b[maxn];
std::vector<pair<int,int> > v;

int main(int argc, char const *argv[])
{
    int t;
    cin >> t;
    while(t--){
        int x,y;
        memset(a,0,sizeof a);
        memset(b,0,sizeof b);
        v.clear();
        cin >> x >> y;
        int n = x , m = y;
        int cnt1 = 0 , cnt2 = 0;
        while(n){
            cnt1 ++;
            a[cnt1] = n % 10;
            a[cnt1] *= pow(10,cnt1-1);
            n /= 10;
        }
        while(m){
            cnt2 ++;
            b[cnt2] = m % 10;
            b[cnt2] *= pow(10,cnt2 - 1);
            m /= 10;
        }
        for(int i = 1;i <= 10;i ++){
            if(a[i] == 0) continue;
            for(int j = 1;j <= 10;j ++){
                if(b[j] == 0) continue;
            
            v.push_back(make_pair(a[i],b[j]));
        }
        }
        for(int i = 0;i < v.size();i ++){
            if(i == v.size()  - 1){
                cout << v[i].first << " x " << v[i].second << endl;

            }
            else 
                 cout << v[i].first << " x " << v[i].second << " + " ;
        }
    }
    return 0;
}

B - Updating the Tree

 Gym - 101972B 

题目链接https://codeforces.com/gym/101972/problem/B

C - Shortest Path!

 Gym - 101972C 

题目链接https://codeforces.com/gym/101972/problem/C

/**Today you do things people will not do,
tomorrow you will do things people can not do.**/

#include<bits/stdc++.h>
#define ll long long
#define lson l,m,cnt<<1
#define rson m+1,r,cnt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
//priority_queue <int,vector<int>,greater<int> > Q;//优先队列递增
//priority_queue<int>Q;//递减
using namespace std;
const int maxn = 15;
const int mod = 1e8;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        double a,b,c,x;
        scanf("%lf%lf%lf%lf",&a,&b,&c,&x);
        double s=sqrt((a*a)+(b+2*c)*(b+2*c));
        double d=b/100*x;
        double e=a/100*x;
        s+=sqrt(d*d+e*e)+sqrt((b-d+2*c)*(b-d+2*c)+(a-e)*(a-e));
        printf("%.9lf\n",s);
    }
}

D - Wooden Fence

 Gym - 101972D 

题目链接https://codeforces.com/gym/101972/problem/D

/**Today you do things people will not do,
tomorrow you will do things people can not do.**/

#include<bits/stdc++.h>
#define ll long long
#define lson l,m,cnt<<1
#define rson m+1,r,cnt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
//priority_queue <int,vector<int>,greater<int> > Q;//优先队列递增
//priority_queue<int>Q;//递减
using namespace std;
const int maxn = 15;
const int mod = 1e8;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,a,b;
        scanf("%d%d%d",&n,&a,&b);
        int ans=n/2;
        if(a>=ans+1&&b>=ans)
            printf("YES\n");
        else
            printf("NO\n");
    }
}

E - Stupid Submissions

 Gym - 101972E 

题目链接https://codeforces.com/gym/101972/problem/E

/**Today you do things people will not do,
tomorrow you will do things people can not do.**/

#include<bits/stdc++.h>
#define ll long long
#define lson l,m,cnt<<1
#define rson m+1,r,cnt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
//priority_queue <int,vector<int>,greater<int> > Q;//优先队列递增
//priority_queue<int>Q;//递减
using namespace std;
const int maxn = 1e4+5;
const int mod = 1e8;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
int s[maxn];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m,k,ans=0;
        scanf("%d %d %d",&n,&m,&k);
        char c[10];
        for(int i=1;i<=n;i++)
        {
            scanf("%s",c);
            if(c[0]=='S') s[i]=0;
            else s[i]=1;
        }
        for(int i=1;i<=m;i++)
        {
            scanf("%s",c);
            if(c[0]=='W')
            {
                int a;
                scanf("%d",&a);
                if(s[a]==0&&a<=k) ans++;
                k=max(a,k);
            }
            else if(c[0]=='A') k=n;
        }
        printf("%d\n",ans);
    }
}

F - I'm Bored!

 Gym - 101972F 

题目链接https://codeforces.com/gym/101972/problem/F

/**Today you do things people will not do,
tomorrow you will do things people can not do.**/

#include<bits/stdc++.h>
#define ll long long
#define lson l,m,cnt<<1
#define rson m+1,r,cnt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
//priority_queue <int,vector<int>,greater<int> > Q;//优先队列递增
//priority_queue<int>Q;//递减
using namespace std;
const int maxn = 35;
const int mod = 1e8;
const ll INF = 1e18;
const double PI = acos(-1.0);
const double eps = 1e-6;
ll a[maxn];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        ll n1=0,n2=0,sum=0;
        ll minn=INF;
        for(int i=1;i<=26;i++)
        {
            scanf("%lld",&a[i]);
            if(a[i]==1) n1++;
            if(a[i]>=2)
            {
                n2++;
                minn=min(minn,a[i]/2);
            }
        }
        ll ans=n2*2,res;
        if(n1>0) ans++,res=min(minn,n1);
        else res=minn;
        if(minn==INF) res=n1;
        printf("%lld %lld\n",ans,res);
    }
}

G - Minimax

 Gym - 101972G 

题目链接https://codeforces.com/gym/101972/problem/G

/**Today you do things people will not do,
tomorrow you will do things people can not do.**/

#include<bits/stdc++.h>
#define ll long long
#define lson l,m,cnt<<1
#define rson m+1,r,cnt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
//priority_queue <int,vector<int>,greater<int> > Q;//优先队列递增
//priority_queue<int>Q;//递减
using namespace std;
const int maxn = 505;
const int mod = 1e8;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
int a[maxn][maxn], n, m;
int dp1[maxn][maxn], dp2[maxn][maxn], dp3[maxn][maxn], dp4[maxn][maxn];
void init()
{
	memset(dp1, 0, sizeof(dp1));
	memset(dp2, 0, sizeof(dp2));
	memset(dp3, 0, sizeof(dp3));
	memset(dp4, 0, sizeof(dp4));
	memset(a, 0, sizeof(a));
}
void Getmax()
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			int maxx = max(dp1[i - 1][j], dp1[i][j - 1]);
			dp1[i][j] = max(dp1[i][j], maxx);
		}
	}
	for (int i = n; i >= 1; i--)
	{
		for (int j = 1; j <= m; j++)
		{
			int maxx = max(dp2[i + 1][j], dp2[i][j - 1]);
			dp2[i][j] = max(dp2[i][j], maxx);
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = m; j >= 1; j--)
		{
			int maxx = max(dp3[i - 1][j], dp3[i][j + 1]);
			dp3[i][j] = max(dp3[i][j], maxx);
		}
	}
	for (int i = n; i >= 1; i--)
	{
		for (int j = m; j >= 1; j--)
		{
			int maxx = max(dp4[i + 1][j], dp4[i][j + 1]);
			dp4[i][j] = max(dp4[i][j], maxx);
		}
	}
}
int max4(int a, int b, int c, int d, int e)
{
	a = max(a, b);
	a = max(a, c);
	a = max(a, d);
	a = max(a, e);
	return a;
}
int min4(int a, int b, int c, int d, int e)
{
	a = min(a, b);
	a = min(a, c);
	a = min(a, d);
	a = min(a, e);
	return a;
}
int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int ans = 0x3f3f3f3f;
		init();
		scanf("%d %d", &n, &m);
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= m; j++)
			{
				scanf("%d", &a[i][j]);
				dp1[i][j] = a[i][j];
				dp2[i][j] = a[i][j];
				dp3[i][j] = a[i][j];
				dp4[i][j] = a[i][j];
			}
		}
		Getmax();
		for (int i = 2; i < n; i++)
		{
			for (int j = 2; j < m; j++)
			{
				int maxx = -1;
				int minn = 0x3f3f3f3f;
				maxx = max4(maxx, dp1[i - 1][j - 1], dp2[i + 1][j - 1], dp3[i - 1][j + 1], dp4[i + 1][j + 1]);
				minn = min4(minn, dp1[i - 1][j - 1], dp2[i + 1][j - 1], dp3[i - 1][j + 1], dp4[i + 1][j + 1]);
				ans = min(ans, maxx - minn);
			}
		}
		printf("%d\n", ans);
	}
}

H - Beautiful Substrings

 Gym - 101972H 

题目链接https://codeforces.com/gym/101972/problem/H

/**Today you do things people will not do,
tomorrow you will do things people can not do.**/

#include<bits/stdc++.h>
#define ll long long
#define lson l,m,cnt<<1
#define rson m+1,r,cnt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
//priority_queue <int,vector<int>,greater<int> > Q;//优先队列递增
//priority_queue<int>Q;//递减
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e8;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
char s1[maxn], s2[maxn];
int vis1[30][30], vis2[30];
int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int n1, n2, k;
		memset(vis1, 0, sizeof(vis1));
		memset(vis2, 0, sizeof(vis2));
		scanf("%d %d %d", &n1, &n2, &k);
		scanf("%s %s", s1 + 1, s2 + 1);
		for (int i = 1; i + k - 1 <= n1; i++) vis1[s1[i] - 'a'][s1[i + k - 1] - 'a'] = 1;
		ll ans = 0;
		for (int i = 1; i <= n2; i++)
		{
			int u = s2[i] - 'a';
			vis2[u]++;
			for (int j = 0; j <= 26; j++)
			{
				if (vis1[j][u]) ans += vis2[j];
			}
		}
		printf("%lld\n", ans);
	}
}

I - Secret Project

 Gym - 101972I 

题目链接https://codeforces.com/gym/101972/problem/I

#include <bits/stdc++.h>
using namespace std;
const int mac = 1e5 + 10;
#define ll long long
const int M = 1e9 + 7;
const int N = 1e5 + 7;
ll fac[N]={1,1},inv[N]={1,1},f[N]={1,1};
ll C(ll a,ll b){
    if(b>a)return 0;
    return fac[a]*inv[b]%M*inv[a-b]%M;
}
void init(){//快速计算阶乘的逆元
    for(int i=2;i<N;i++){
        fac[i]=fac[i-1]*i%M;
        f[i]=(M-M/i)*f[M%i]%M;
        inv[i]=inv[i-1]*f[i]%M;
    }
}

int main()
{
    int t;
    ll n;
    init();
    scanf("%d", &t);
    while (t--)
    {
       ll x,y;
       cin >> x >> y;
       cout << C(x,y-1) << " " << C(x-1,y-1) << endl;
    }
    return 0;
}

J - Even Numbers

 Gym - 101972J 

题目链接https://codeforces.com/gym/101972/problem/J

#include <bits/stdc++.h>
using namespace std;
const int mac = 1e5 + 10;
#define ll long long
int a[mac];
int main()
{
    int t;
    ll n;
    scanf("%d", &t);
    while (t--)
    {
        int num = 0;

        scanf("%lld", &n);
        long long sum = n;
        while (n) {
            if (n & 1) num++;
            n >>= 1;
        }
        cout << sum - 1ll * (1ll << num) + 1 << endl;
    }
    return 0;
}

K - Cyclic Shift

 Gym - 101972K 

题目链接https://codeforces.com/gym/101972/problem/K

/**Today you do things people will not do,
tomorrow you will do things people can not do.**/

#include<bits/stdc++.h>
#define ll long long
#define lson l,m,cnt<<1
#define rson m+1,r,cnt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
//priority_queue <int,vector<int>,greater<int> > Q;//优先队列递增
//priority_queue<int>Q;//递减
using namespace std;
const int maxn = 15;
const int mod = 1e8;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-6;
vector<int> G;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        string a,b;
       G.clear();
        cin>>a>>b;
        for(int i=0;i<n;i++)
        {
            if(a[i]!=b[i])
            {
                G.push_back(i);
            }
        }
        int flag=1;
        for(int i=0;i<G.size();i++)
        {
            G[i+1]=G[(i+1)%(G.size())];
            if(b[G[i]]!=a[G[i+1]])
            {
                flag=0;
                break;
            }
        }
        if(flag==1) printf("YES\n");
        else printf("NO\n");
    }}

 

lonely_wind_
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
get-csust-info-helper
06-02
"get-csust-info-helper" 是一个专门为长沙理工大学学生设计的工具，主要功能是帮助学生查询校园信息，包括课程表和图书馆的借阅信息。这个工具最初由用户yinbro开发，并在Gitcafe上进行了分享。后来，该项目被其他...
CSUST_:长沙理工大学——校园客户端
05-26
"CSUST_"，即长沙理工大学的校园客户端，旨在提供一个便捷、全面的服务平台，帮助师生更好地融入校园生活。这款客户端是用Java编程语言开发的，充分体现了Java在跨平台应用开发中的优势。 首先，我们来探讨一下Java...
Gym 101972
weixin_30824479的博客
12-07 79
F读错题wa了三个小时。自闭了，不然I题有可能能出的。。已经想到组合数也敲完组合数板子了。 A:这。。。**题吧，第一眼看的这个就秒了 1 #include<bits/stdc++.h> 2 #define pii pair<int,int> 3 #define mk(a,b) make_pair(a,b) 4 using namespace ...
gym101972
qq_40423146的博客
04-26 257
E. Stupid Submissions (暴力模拟) https://codeforces.com/gym/101972/problem/E When Abed gets a wrong answer on test x (x ≤ n), he can see all the tests up to test number x. If Abed gets accepted, he can se...
Shortest Path! Gym - 101972C
newhonor
09-27 130
https://vjudge.net/problem/Gym-101972C #include <iostream> #include <cstring> #include <queue> #include <vector> #include <algorithm> #include <cstdio> #include &...
Shortest Path! (初中数学最短路问题)Gym - 101972C
weixin_44757834的博客
02-10 205
题目链接：https://vjudge.net/problem/Gym-101972C 服了，这个题目因为读入问题和变量类型的使用wa了好几次。在这里做一下标注。 Shortest Path! Today, Husam was visiting his grandmother. Hus...
Cyclic Shift Gym - 101972K
newhonor
09-25 130
https://vjudge.net/problem/Gym-101972K #include <iostream> #include <cstring> #include <queue> #include <vector> #include <algorithm> #include <cstdio> #include ...
计算机网络原理实验报告---Wireshark实验:HTTP协议分析
01-20
**实验报告概述** ... ... ...它基于TCP/IP协议栈，以请求/响应模型进行交互。...2. **请求头部**：包含了关于客户端环境和请求正文的元数据，如"Host"（主机地址）、"User-Agent"（用户代理信息）、"Connection"（连接管理，...
HTML+CSS+Div测试习题.doc
10-20
24. 锚点链接：`<a>`标签的`href`属性可以指向锚点，如`#csust`，表示链接到文档内部ID为`csust`的位置。 这些习题反映了HTML基础结构、CSS样式规则以及它们在网页设计中的应用。掌握这些知识点对于创建和美化网页...
HTML+CSS+Div测试习题.pdf
11-26
链接的 `href` 属性可以指向 URL 或页面内部的锚点（如 `#csust`）。 了解这些基本概念后，网页设计师能够创建出符合需求、美观且易用的网页。HTML 结构清晰，CSS 样式灵活，两者结合能打造出具有吸引力的在线体验...
Gym - 101972J Even Numbers 规律
还我笑颜
12-16 378
Yousef loves playing with functions in his free time. Today, he invents the following function: Yousef will give you a list of queries, and you need to find the answers for them. For each query, yo...
G - Minimax Gym - 101972G -dp-维护子矩阵最值
BePosit的博客
11-11 318
G - Minimax  Gym - 101972G  题意：Your goal is to delete a row x (1 &lt; x &lt; n) and a column y (1 &lt; y &lt; m), after this the matrix will be divided into 4 parts. Let us define the beauty of...
Gym - 101972K - Cyclic Shift（字符串匹配）
Rotepad的博客
08-06 225
题目：戳一戳 题意：a b两个字符串，对于a, b 中不匹配的位置，能否通过滚动的方式把他们进行匹配 题解：将a字符串中不匹配的位置中的子序列提出来然后在原来的子序列后面再加一遍，那么就可以把b中不匹配的子序列跟这个a的新子序列进行匹配了 以后做字符串相对位置不变，判断匹配的问题，可以把原来的s=s+s，这样进行匹配！ 代码： #include<iostream> #inc...
C - Shortest Path! Gym - 101972C -几何-对称点距离
BePosit的博客
11-11 410
C - Shortest Path!  Gym - 101972C  题意 ：从room到grandmother room，有两次去河边接水第一次是从家出发时， 第二次时，回来时在room与grandmother-room的 直线距离的x%处去接水，所以就是求两次关于河边对称点的距离即可再加上走的那x%的距离 #include&lt;bits/stdc++.h&gt; us...
Gym - 101972B Updating the Tree （深搜+合并）
LP_Cong
11-08 464
B. Updating the Tree time limit per test 1.5 s memory limit per test 256 MB input standard input output standard output A rooted tree is a tree with a countable number of nodes, in which a pa...
Gym - 101972G Minimax 预处理+枚举
还我笑颜
12-16 378
You are given a grid consisting of n rows each of which is dived into m columns. The rows are numbered from 1 to n from top to bottom, and the columns are numbered from 1 to m from left to right. Each...
Cyclic Shift（字符串匹配水题）
永夜莫明的博客
12-16 797
You are given two strings a and b of the same length and consisting of lowercase English letters. You can pick at most one subsequence of string b and do a cyclic shift on that subsequence exactly onc...
Gym - 101291C (很有意思的最短路）
weixin_33695450的博客
07-08 182
题意： 给出一张地图和机器人还有出口的位置，地图上面有障碍。然后给出UDLR上下左右四种指令，遇到障碍物或者越界的指令会忽略，剩下的继续执行。 只要到达出口就算找到出口，然后给你一串指令，让你修改指令达到出口，删除或插入任意一个指令花费为1，问让机器人能够找到出口所花费最少。　　 思路： 感觉很有意思的一道最短路，思路是把每个点分成变成指令长度个点+1，然后就相当于有n^3个点。然后指令是...
Gym - 101972B B. Updating the Tree
长路漫漫 唯剑作伴
11-13 570
B. Updating the Tree time limit per test 1.5 s memory limit per test 256 MB input standard input output standard output A rooted tree is a tree with a countable number of nodes, in which a pa...
yolov5交通标志识别GTSRB
最新发布
12-11
为了使用YOLOv5算法进行交通标志识别，我们需要进行以下步骤： 1. 下载CCTSDB数据集和YOLOv5代码库 ```shell 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 ``` 3. 将数据集分为训练集和验证集 ```shell python3 split_train_val.py ``` 4. 在训练集上训练YOLOv5模型 ```shell cd ../yolov5 python3 train.py --img 640 --batch 16 --epochs 100 --data ../CCTSDB/cctsdb.yaml --cfg ./models/yolov5s.yaml --weights '' --name yolov5s_results ``` 5. 在验证集上测试模型性能 ```shell python3 test.py --img 640 --conf 0.001 --data ../CCTSDB/cctsdb.yaml --weights ./runs/train/yolov5s_results/weights/best.pt ``` 6. 对测试集进行预测 ```shell python3 detect.py --source ../CCTSDB/test --conf 0.001 --weights ./runs/train/yolov5s_results/weights/best.pt --save-txt ``` 7. 计算模型的精度和召回率 ```shell python3 ../CCTSDB/evaluate.py ``` 以上步骤是使用YOLOv5算法进行交通标志识别的基本流程。需要注意的是，YOLOv5算法需要较高的计算资源，因此在训练和测试时需要使用GPU。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值