2136: 统帅三军! Submit Page   Summary   Time Limit: 1 Sec     Memory Limit: 128 Mb     Submitted: 55     Solved: 11 Description Wells最近迷上了一款攻城的策略游戏,点就去就能当大元帅统帅三军! 游戏界面主要是一个平面(坐标可以为浮点数),然而Wells发现这游戏是个骗局,其实只给了一个军队. Wells初始有一个军队,仅包含n个士兵,每个士兵有一个初始位置(x,y)和一个劳…

Contest2073 - 湖南多校对抗赛(2015.04.06) Problem A: (More) Multiplication Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 85  Solved: 47[Submit][Status][Web Board] Description Educators are always coming up with new ways to teach math to students. In 2011, a…

Contest2071 - 湖南多校对抗赛(2015.03.28) 本次比赛试题由湖南大学ACM校队原创 http://acm.csu.edu.cn/OnlineJudge/contest.php?cid=2071 Problem A: Rectangle Time Limit: 1 Sec  Memory Limit: 256 MBSubmit: 210  Solved: 48[Submit][Status][Web Board] Description Now ,there are some…

Problem E: Swipe Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 100  Solved: 15[Submit][Status][Web Board] Description 德鲁伊在炉石传说中是一个很稳定的职业,主流的卡组套路有咆哮德,城墙德以及让人很无奈的疲劳德.然而,大部分的卡组总都包括“横扫”这张德鲁伊的职业法术卡.       我们假定战场上的敌人数目不定,敌人的血量已知,我们想知道最少使用多少张“横扫”能消灭战场上所有敌人…

Aquarium Tank Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 15  Solved: 4[Submit][Status][Web Board] Description You just bought an “artistic” aquarium tank that has an interesting shape, and you poured L litres of water into the tank. How high is t…

Problem H: Heaps Time Limit: 2 Sec  Memory Limit: 128 MBSubmit: 48  Solved: 9[Submit][Status][Web Board] Description Zuosige always has bad luck. Recently, he is in hospital because of pneumonia. While he is taking his injection, he feels extremely b…

给四个数 问能不能算出24点...我的方法比较烂...920ms 差点TLE.应该有更好的方法. #include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> using namespace std; ], ff[], n; ][], yy[]; int sum; double get(double x, double y, int fu) { ) return x + y…

并查集.从后往前加边. #include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> using namespace std; + ; int father[maxn], u[maxn], v[maxn], Q, q[maxn], ans[maxn], ff[maxn]; int find(int x) { if (x != father[x]) father[x] = f…

Problem H: Clock Pictures Time Limit: 3 Sec  Memory Limit: 128 MBSubmit: 73  Solved: 18[Submit][Status][Web Board] Description Input Output Sample Input 6 1 2 3 4 5 6 7 6 5 4 3 1 Sample Output impossible HINT 题意:给你角度,问你通过旋转a图和b图能否重合: 思路:KMP:(比赛的时候,忘记…

2130: Permutations Submit Page   Summary   Time Limit: 1 Sec     Memory Limit: 128 Mb     Submitted: 79     Solved: 33 Description 给定两个1~n的排列A, B.每次可以把A的最后一个数取出,插入到A的任何一个位置(最前面或者任何两个数中间). 问最少几次可以把A转化为B. Input 第一行为一个整数n. 第二行为1~n的一个排列,表示A. 第三行为1~n的一个排列…

第一场多校就打的这么惨,只能说自己太菜了,还需继续努力啊- 题目链接: GYM链接:https://codeforces.com/gym/101933 CSU链接:http://acm.csu.edu.cn:20080/csuoj/contest/problemset?cid=2178 A题: 题意: 有n只青蛙掉到了井里,然后可以靠叠罗汉和向上跳逃离水井,每只青蛙有三个属性分别为跳高值,体重(承重能力),身高,问最多能有多少只青蛙能够逃离水井. 思路: 因为每只青蛙的承重能力是有限的,因此我们…

Problem C: Catalan Square Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 42  Solved: 16[Submit][Status][Web Board] Description Input Output Sample Input 0 Sample Output 1 HINT import java.util.*; import java.math.*; public class Main{ BigInteger[] Ca…

E:Eulerian Flight Tour 题意: 给你一张无向图,要你给这个图加边使得其形成一个欧拉回路 题解: 首先使得所有节点的度都为偶数,然后将这个图联通起来 对于度为奇数的点,将将他和他的父节点连接起来 连接完后如果这个图是联通的,那么就直接输出结果 如果这个图有多个联通块: 分类讨论: 如果有2个联通块,两个联通块对着连成一个环 如果有多个联通块,用一个环将这几个联通块连起来即可 代码: # E:Eulerian Flight Tour ## 题意: 给你一张无向图,要你给这个图加…

B:Arithmetic Progressions 题意: 给你一个长度为n的序列,问你这个序列中长度最长的等差数列长度为多少 题解: 方法一:将数组从小到大排序,n方扫,枚举出公差d,然后二分找有多少个满足等差序列的值即可,emmm虽然说不知道为什么这种最差复杂度为n^3*logn的暴力能过,可能是csuoj太快了吧. 代码: #include <bits/stdc++.h> #define eps 1e-8 #define INF 0x3f3f3f3f #define PI acos(-1…

Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1770    Accepted Submission(s): 1089 Problem Description Alice and Bob are playing a game.The game is played on a set of positive integers fr…

Swaps and Inversions Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3588    Accepted Submission(s): 976 Problem Description Long long ago, there was an integer sequence a.Tonyfang think this se…

Balanced Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1320    Accepted Submission(s): 316 Problem Description Chiaki has n strings s1,s2,…,sn consisting of '(' and ')'. A string of t…

Distinct Values Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1311    Accepted Submission(s): 398 Problem Description Chiaki has an array of n positive integers. You are told some facts about…

Triangle Partition Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 304    Accepted Submission(s): 170Special Judge Problem Description Chiaki has 3n points p1,p2,…,p3n. It is guaranteed that n…

Maximum Multiple Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 494    Accepted Submission(s): 215 Problem Description Given an integer n, Chiaki would like to find three positive integers x, y…

Time Zone Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 495    Accepted Submission(s): 162 Problem Description Chiaki often participates in international competitive programming contests. The…

Description A multi-digit column addition is a formula on adding two integers written like this:…

Description The Barareh village is on fire due to the attack of the virtual enemy. Several places are already on fire and the fire is spreading fast to other places. Khorzookhan who is the only person remaining alive in the war with the virtual enemy…

解题过程 开场shl过B,C,然后lfw写J,J WA了以后shl写A,但是因为OJ上空间开小WA了,而不是MLE?,J加了特判过了.之后一直在检查A错哪了,直到qt发现问题改了空间,浪费许多时间,但是拿到A一血,shl和byf推出K,不会写组合数而抄了板子,  但是WA, shl想出E题拿到一血了,byf和 shl以为板子错了,让lfw重写K题 lfw重写K题的时候公式复制了之前的代码,又WA了,lfw看出I题,开始写,然后因为高精度加法时c[i]=a[i]+b[i]而不是c[i]+=a[i]…

1909: Perfect Chocolate Submit Page   Summary   Time Limit: 3 Sec     Memory Limit: 128 Mb     Submitted: 90     Solved: 42 Description There is a chocolate, is composed of black and white small pieces. Xiao Ming is very fond of this chocolate, and t…

引入 前几天参加湖南多校的比赛,其中有这样一道题,需要使用高精度,同时需要排序,如果用c++实现的话,重载运算符很麻烦,于是直接学习了一发怎样用Java写大数,同时也算是学习Java基本常识了 题目 Description Today the Intergalactic Council of Pebble Coins (ICPC) conducted an intergalactic auction of the Neutronium Chaos Pebble Coin (NCPC). This…

1968: Permutation Descent Counts Submit Page   Summary   Time Limit: 1 Sec     Memory Limit: 128 Mb     Submitted: 123     Solved: 96 Description Given a positive integer, N, a permutation of order N is a one-to-one (and thus onto) function from the…

Team members StarHai binarycopycode Fly_White Caution 读题 数组第一维的访问速度比其他维速度快. 清空数组 乘法运算取模里面涉及到减法注意变为负数的情况,应该 ans=((ans-num)%mod + mod)%mod; 模板要自己想明白,不要总是怀疑模板抄错,有可能是非模板部分写错. DP时初始化时边界的处理 set最多只能1e6个元素,空间不是线性的 long long 不能用 %d读入 字符串处理用ch[10];  cin.getlin…

传送门:http://acm.csu.edu.cn:20080/csuoj/problemset/problem?pid=2279 题意: 代码: #include <set> #include <map> #include <deque> #include <queue> #include <stack> #include <cmath> #include <ctime> #include <bitset>…

A: Decimal Time Limit: 1 Sec   Memory Limit: 128 MB Submit: 99   Solved: 10 [ Submit][ Status][ Web Board] Description 任意一个分数都是有理数,对于任意一个有限小数,我们都可以表示成一个无限循环小数的形式(在其末尾添加0),对于任意一个无限循环小数都可以转化成一个分数.现在你的任务就是将任意一个无限循环小数转化成既约分数形式.所谓既约分数表示,分子和分母的最大公约数是1. Inp…