省赛真题
蒟蒻的ACMer
2014界大学新生
展开
-
sdut 3567 Memory Leak 模拟
题意:模拟c++的输入,如果输入的字符串大于声明的空间就会寻找下一个字符串直到找到'\0'坑点:gets name 的第一个空格后都是输入的内容ACcode:#include using namespace std;#define maxn 11111string name[maxn];int len1[maxn],len2[maxn];char tmp[maxn];m原创 2017-05-04 16:59:37 · 492 阅读 · 1 评论 -
山东省第一届ACM大学生程序设计竞赛 Phone Number 字典树
Phone NumberTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述We know that if a phone number A is another phone number B’s prefix, B is not able to be called. For an example, A is原创 2016-03-30 20:54:04 · 974 阅读 · 0 评论 -
山东省第一届ACM大学生程序设计竞赛 Emergency floyd变形
EmergencyTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Kudo’s real name is not Kudo. Her name is Kudryavka Anatolyevna Strugatskia, and Kudo is only her nickname.原创 2016-05-03 15:57:02 · 855 阅读 · 0 评论 -
sdut 2153 Clockwise
链接:http://acm.sdut.edu.cn/onlinejudge2/index.php/Home/Index/problemdetail/pid/2153.html题意:二维平面内给你n个点,构成n-1个向量(第i和第i+1个点构成第i个向量)问删除最少的向量,使得剩下的向量按顺序呈顺时针或逆时针。顺时针:第i个向量顺时针转【0,180)与i+1个向量重合逆时针:原创 2017-04-28 16:41:34 · 389 阅读 · 0 评论 -
sdut 2878 Circle 高斯消元
题意:在一个0~n的环上每次可以向左走或向右走求走到x的步数的期望分析:因为是环形的不好递推考虑到 dp【i】=dp【(i+1)%n】/2+dp【(i-1)%n】/2+1可以转化为 dp【i】-dp【(i+1)%n】/2-dp【(i-1)%n】/2=1所以可以列n个方程利用高斯消元来解貌似网上有别的做法表示看不懂orzACcode:#include #in原创 2016-05-23 20:41:52 · 767 阅读 · 0 评论 -
山东第7届省赛 G Triple Nim 找规律
Triple NimTime Limit: 2000MS Memory limit: 65536K题目描述Alice and Bob are always playing all kinds of Nim games and Alice always goes first. Here is the rule of Nim game: There are som原创 2016-06-10 19:55:02 · 846 阅读 · 0 评论 -
山东第7届省赛 J题 Execution of Paladin
没玩过炉石,不想看这题,做的太晚了,应该早点做的。Execution of PaladinTime Limit: 2000MS Memory limit: 65536K题目描述Murloc is a powerful race in Hearthstone. In the set League of Explorers, a new Paladin abil原创 2016-06-10 19:50:12 · 966 阅读 · 0 评论 -
山东第7届省赛 K题 Reversed Words
Reversed WordsTime Limit: 2000MS Memory limit: 131072K题目描述Some aliens are learning English. They have a very strange way in writing that they revered every word in the sentence but keep原创 2016-06-10 19:40:49 · 511 阅读 · 0 评论 -
山东省第7届ACM省赛 F题 Feed the monkey dp
傻逼记忆化搜索 可是比赛时候我没去敲 赛后1A什么的还是退坑的好Feed the monkeyTime Limit: 2000MS Memory limit: 131072K题目描述Alice has a monkey, she must feed fruit to the monkey every day.She has three原创 2016-06-10 19:35:49 · 1167 阅读 · 2 评论 -
山东省第7届省赛 E题 The Binding of Isaac
The Binding of IsaacTime Limit: 2000MS Memory limit: 65536K题目描述Ok, now I will introduce this game to you...Isaac is trapped in a maze which has many common rooms…Li原创 2016-06-10 19:31:41 · 688 阅读 · 0 评论 -
山东省第7届省赛 B题 Fibonacci
FibonacciTime Limit: 2000MS Memory limit: 131072K题目描述Fibonacci numbers are well-known as follow: Now given an integer N, please find out whether N can be represented as the sum of se原创 2016-06-10 19:27:38 · 717 阅读 · 0 评论 -
山东省第7届省赛 A题 Julyed
JulyedTime Limit: 2000MS Memory limit: 65536K题目描述 Julyed is preparing for her CET-6. She has N words to remember, but there is only M days left. If she can’t remember all these words,原创 2016-06-10 19:22:12 · 444 阅读 · 0 评论 -
山东省第一届ACM大学生程序设计竞赛 Greatest Number 二分查找
Greatest NumberTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Saya likes math, because she think math can make her cleverer.One day, Kudo invited a very simple game原创 2016-05-03 13:31:45 · 1031 阅读 · 0 评论 -
山东省第一届ACM大学生程序设计竞赛 hello world! 水模拟
Hello World!Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述We know that Ivan gives Saya three problems to solve (Problem F), and this is the first problem.“We need a programmer原创 2016-03-31 13:42:35 · 1051 阅读 · 0 评论 -
sdut 2161 Simple Game 博弈
题意:N堆石子,每堆有ai个,轮流取,每次最多从3堆石子中取(可以取不同)。问先手是否能必胜分析:最普通的尼姆游戏是从1堆中取,本题是从3堆中取,推广成k堆呢?对于尼姆博弈我们的做法是把所有的数异或最后判断最后值是否大于0对于本题的必败态有:1 1 1 1 2 2 2 2 3 3 3 3 1 2 3 3 3 1 3 4 4 4原创 2017-05-02 18:22:33 · 420 阅读 · 0 评论 -
山东省第一届ACM大学生程序设计竞赛 Balloons dfs搜索
BalloonsTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Both Saya and Kudo like balloons. One day, they heard that in the central park, there will be thousands of people fly bal原创 2016-03-31 20:01:17 · 866 阅读 · 0 评论 -
山东第五届acm省赛总结:
angry_birds_again_and_again积分 解题报告Circle概率dp or 高斯消元 解题报告Colorful Cupcakesdp 解题报告Devour Magic线段树 解题报告Factorial10以内的阶乘 Full Binary Tree二叉树 代码:#include #incl原创 2017-05-03 21:05:48 · 559 阅读 · 0 评论 -
山东第四届acm省赛总结:
Rescue The Princess计算几何,数学 解题报告Thrall’s Dream图的连通性 解题报告A^X mod P 打表 解题报告Rubik’s cube二阶魔方爆搜 Mountain Subsequencesdp lis 解题报告Alice and Bob二进制,找规律 解题报告A-Number and原创 2017-05-03 20:44:18 · 413 阅读 · 0 评论 -
sdut 2624 Contest Print Server
按题意模拟就好ACcode:#include #include #include #include #include #include #include #include #define maxn 1000using namespace std;int main(){ int t,need; char str[maxn]; char team[m原创 2017-05-03 20:43:40 · 369 阅读 · 0 评论 -
sdut 2608 Alice and Bob 二进制
题意:一个多项式:(a0*x^(2^0)+1) * (a1 * x^(2^1)+1)*.......*(an-1 * x^(2^(n-1))+1). 给出ai ,n 问x^q的系数分析:展开多项式会发现q可以表示成二进制那么x^q的系数就是q二进制位为1的ai的连乘ACcode:#include #define maxn 102#define mod 2原创 2017-05-03 15:16:21 · 516 阅读 · 0 评论 -
sdut 2604 Thrall’s Dream bfs
题意:给你n个点m个单向边,问是否任意2点是否联通分析:对每个点跑bfs最后判读has【i】【j】||has【j】【i】的值ACcode:#include #define maxn 2001using namespace std;struct N{int to,next;}my[maxn];int head[maxn],tot;void init(){memset(h原创 2017-05-03 14:04:41 · 351 阅读 · 0 评论 -
山东第二届acm省赛总结:
链接&题解:Simple GameN堆石子每次最多取3堆 解题报告The Android University ACM Team Selection Contest模拟 Identifiers模拟Binomial Coeffcients递推Crack Mathmen打表模拟Manhattan3维曼哈顿距离Mathm原创 2017-05-03 11:57:35 · 389 阅读 · 0 评论 -
sdut 2170 The Largest SCC
题意:给出一个点数n≤1000 边数m≤20000 的有向图,一共Q≤20000 次询问,询问相互独立,每次询问如果将第x(1≤x≤m)条边变为无向边时,图中最大的强连通分量所包含的点数为多少分析:先缩点,如果加的边(a,b)本来就在同一个强连通内,那么答案就是原图的答案,否则枚举a,b能到达的边,把他们所在的强连通累加就是答案ACcode:#include #原创 2017-05-03 11:56:46 · 337 阅读 · 0 评论 -
sdut 2168 Mathmen 贪心
题意:给你n个点代表n个不同的城市,m种交通工具,每种交通工具有不同的消耗和行驶距离。从一个城市到另一个城市只能用一个交通工具问从1到n是否存在最优的走法,即消耗最小分析:1到n就是有n-1段路,对于每段路肯定是选取满足行驶距离大于该段路中的交通工具中消耗最小的那个用优先队列搞搞就okACcode:#include #define ll long long#defi原创 2017-05-03 11:01:45 · 319 阅读 · 0 评论 -
山东第一届acm省赛总结:
链接&题解Phone Number 字符串求前缀,字典树or暴力 解题报告Balloons 2个dfs 解题报告Clockwise 计算几何加dp 解题报告Shopping原创 2017-04-29 09:13:02 · 554 阅读 · 0 评论 -
SDUT 2167 Mathman Bank 模拟
题意:大模拟,模拟银行操作。分析:按题意一个一个操作的进行就好了ACcode:#include #include #define maxn 1000005#define ll long longusing namespace std;mapvis;struct N{ string id,ps; ll v; void init(){///不初始原创 2017-05-02 21:37:17 · 376 阅读 · 0 评论 -
sdut 3256 BIGZHUGOD and His Friends II
BIGZHUGOD and His Friends IITime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述BIGZHUGOD and his three friends are playing a game in a triangle ground.The number of BIG原创 2016-05-21 20:51:45 · 572 阅读 · 0 评论 -
sdut 3262 Circle of Friends tarjan
Circle of FriendsTime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Nowadays, "Circle of Friends" is a very popular social networking platform in WeChat. We can share our原创 2016-05-21 11:08:49 · 579 阅读 · 0 评论 -
sdut 3257 Cube number
Cube NumberTime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述In mathematics, a cube number is an integer that is the cube of an integer. In other words, it is the produc原创 2016-05-20 20:00:04 · 711 阅读 · 0 评论 -
sdut 2609 A-Number and B-Number
A-Number and B-NumberTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述 Tom is very interested in number problem. Nowadays he is thinking of a problem about A-number and B-numb原创 2016-05-24 19:13:46 · 468 阅读 · 0 评论 -
sdut 2884 Painting Cottages 计算几何
Painting CottagesTime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述The new cottage settlement is organized near the capital of Flatland. The construction company that is原创 2016-05-24 14:25:55 · 464 阅读 · 0 评论 -
山东省第四届ACM大学生程序设计竞赛 The number of steps 概率dp
The number of stepsTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述 Mary stands in a strange maze, the maze looks like a triangle(the first layer have one room,the second lay原创 2016-04-16 09:16:41 · 640 阅读 · 0 评论 -
sdut 2880 Devour Magic 线段树 区间更新和区间替换
题意:给你一个1~n的区间,每过一个单位时间区间值加一现在有一个操作 t l r 表示在t时间把 l--->r的值累加为ans然后清零分析:就是成段更新和成段替换 替换的优先级高于成段替换ACcode:#include #include #define ll long longusing namespace std;#define maxn 100010#defi原创 2016-05-24 11:15:05 · 655 阅读 · 0 评论 -
山东省第四届ACM大学生程序设计竞赛 Mountain Subsequences dp
Mountain Subsequences Time Limit: 1000MS Memory limit: 65536K 题目描述Coco is a beautiful ACMer girl living in a very beautiful mountain. There are many trees and flowers on the mountain, an原创 2016-04-11 20:49:59 · 617 阅读 · 0 评论 -
山东省第四届ACM大学生程序设计竞赛 Rescue The Princess
Rescue The Princess Time Limit: 1000MS Memory limit: 65536K 题目描述 Several days ago, a beast caught a beautiful princess and the princess was put in prison. To rescue the princess, a pr原创 2016-04-09 10:18:48 · 595 阅读 · 0 评论 -
山东省第五届ACM大学生程序设计竞赛 Colorful Cupcakes
Colorful CupcakesTime Limit: 2000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Beaver Bindu has N cupcakes. Each cupcake has one of three possible colors. In this problem we will represent th原创 2016-04-21 20:58:39 · 818 阅读 · 0 评论 -
山东省第四届ACM大学生程序设计竞赛 A^X mod P
A^X mod P Time Limit: 5000MS Memory limit: 65536K 题目描述It's easy for ACMer to calculate A^X mod P. Now given seven integers n, A, K, a, b, m, P, and a function f(x) which defined as follo原创 2016-04-12 15:11:10 · 667 阅读 · 0 评论 -
山东省第二届ACM大学生程序设计竞赛 Binomial Coeffcients 递推
Binomial CoeffcientsTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述 输入 输出 示例输入31 110 2954 723示例输出1453557658提示 来源山东省第二届ACM大学生程序设计竞赛示例程序原创 2016-04-05 13:32:26 · 501 阅读 · 0 评论 -
山东省第二届ACM大学生程序设计竞赛 The Android University ACM Team Selection Contest
The Android University ACM Team Selection Contest Time Limit: 1000MS Memory limit: 65536K 题目描述 Now it's 20000 A.D., and the androids also participate in the ACM Inter-national Collegiate P原创 2016-04-04 19:36:43 · 579 阅读 · 1 评论 -
山东省第一届ACM大学生程序设计竞赛(原题) Ivan comes again!
Ivan comes again! Time Limit: 1000MS Memory limit: 65536K 题目描述The Fairy Ivan gave Saya three problems to solve (Problem F). After Saya finished the first problem (Problem H), here comes th原创 2016-04-04 18:03:12 · 812 阅读 · 0 评论