oFAST

P5743 【深基7.习8】猴子吃桃

输入格式无输出格式无输入输出样例输入4输出22#pragmaGCCoptimize(3,"Ofast")#includeusingnamespacestd;intmain(){intn,i=1,j=
bupt_sanqing·2020-08-25 01:49

Birdwatching

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongus
青烟绕指柔!·2020-08-24 23:30

LUK-Triumphal arch

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusing
青烟绕指柔!·2020-08-24 11:35

URAL - 1651

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;co
青烟绕指柔!·2020-08-24 11:34

URAL - 1742

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-24 11:34

Codeforces - D. Nature Reserve

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusing
青烟绕指柔!·2020-08-24 11:03

Codeforces Round #514 (Div. 2)

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-24 07:51

牛牛的等差数列

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include#defineintlonglong#definemid(l+r>>1)usingnamespacestd
青烟绕指柔!·2020-08-24 07:51

饥饿的奶牛

题目链接：饥饿的奶牛很显然的dp、AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd
青烟绕指柔!·2020-08-23 08:12

Codeforces Round #495 (Div. 2)

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;intn
青烟绕指柔!·2020-08-23 03:03

洛谷P1853 投资的最大效益 动态规划

本金为背包空间，投资额为消耗的空间，利息为价值#pragmaGCCoptimize(3)#pragmaGCCoptimize("Ofast","inline")#include#include#include
天亮就睡觉·2020-08-20 21:12

洛谷 O2优化源码

#pragmaGCCoptimize(3)#pragmaGCCoptimize("Ofast")#pragmaGCCoptimize("inline")#pragmaGCCoptimize("-fgcse
天亮就睡觉·2020-08-20 21:06

学习笔记~矩阵快速幂~

为了防止这种事再次发生，特把相关心得记下，下次方便查阅矩阵快速幂=快速幂+矩阵乘法矩阵快速幂就是把快速幂的函数内容换成3层循环的矩阵乘法就这样，完事留一个模板方便下次看#pragmaGCCoptimize("Ofast
狐佑 怜·2020-08-20 11:11

线段树（点查询、区间查询、区间修改）模板

#pragmaGCCoptimize(3,"Ofast","inline")#include#include#include#include#include#include#include#include
昵称很长很长真是太好了·2020-08-18 10:03

HDU - 5102

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defin
青烟绕指柔!·2020-08-18 09:46

Codeforces - Pencils and Boxes

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlo
青烟绕指柔!·2020-08-18 09:46

Codeforces - Inna and Dima

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-18 09:46

HDU - 5215

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlon
青烟绕指柔!·2020-08-18 09:45

Codeforces - Colonial Mansions

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd
青烟绕指柔!·2020-08-18 09:45

HDU - 6430 TeaTree

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-18 09:45

codeforces 1391D 状压dp

之后就是对n=2和n=3的分类讨论，运用到状压dp的知识，我dp是真的菜代码如下：#pragmaGCCoptimize("Ofast","inline","-ffast-math")#pragmaGCCtarget
acm123456789ctf·2020-08-17 21:17

EOJ2020.7C 二维前缀和+差分

#pragmaGCCoptimize("Ofast","inline","-ffast-math")#pragmaGCCtarget("avx,sse2,sse3,sse4,mmx")#inclu
acm123456789ctf·2020-08-17 21:17

cf1333C 思维题+前缀和

代码如下：#pragmaGCCoptimize("Ofast","inline","-ffast-math")#pragmaGCCtarget("avx,sse
acm123456789ctf·2020-08-17 21:17

科大讯飞杯 迷宫

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;co
青烟绕指柔!·2020-08-15 12:36

Codeforces - Fragile Bridges

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include#defineintlong
青烟绕指柔!·2020-08-14 08:13

HDU - 5410

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-14 08:13

展胜地的鲤鱼旗

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-14 08:13

Codeforces - Chloe and pleasant prizes

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-14 08:13

[JXOI2017]加法

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingn
青烟绕指柔!·2020-08-14 06:01

双塔问题

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-13 22:23

HDU - 5977

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-13 22:23

【队伍训练】Codeforces Round #660 (Div. 2)

A思维#pragmaGCCtarget("avx,sse2,sse3,sse4,popcnt")#pragmaGCCoptimize("O2,O3,Ofast,inline,unroll-all-loops
zha_zha_wei·2020-08-13 18:49

Codeforces - Zuma

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-11 00:25

P1233-木棍加工

1#pragmaGCCoptimize("Ofast")2#include3#definemaxn130034#define_for(i,a,b)for(inti=(a);i=10)write(x/10
weixin_30276935·2020-08-10 22:14

Codeforces - Ants in Leaves

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd
青烟绕指柔!·2020-08-09 15:30

Codeforces - Ant colony

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamesp
青烟绕指柔!·2020-08-09 15:29

HDU - 5495

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-09 04:10

HDU - 4858

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-09 04:10

HDU - 5637

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-09 04:10

Codeforces - Weights Division

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#inclu
青烟绕指柔!·2020-08-09 04:38

[WC2006]水管局长 时间倒流LCT维护MST

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingna
青烟绕指柔!·2020-08-09 01:10

2020牛客暑期多校训练营（第七场）D.Fake News

的和是否是一个平方数解题思路通过打表得出只有n=1n=1n=1或n=24n=24n=24的时候，12+22+…+n21^2+2^2+…+n^212+22+…+n2的和才是平方数附上代码#pragmaGCCoptimize("-Ofast
Fiveneves·2020-08-07 23:45

“科大讯飞杯”第18届上海大学程序设计联赛春季赛暨高校网络友谊赛 C.最长非公共子序列

最长非公共子序列题目链接-C.最长非公共子序列解题思路贪心贪心贪心因为要求最长非公共子序列，所以若两个字符串一样输出-1，否则就输出两个串中长度最长的长度即可附上代码//#pragmaGCCoptimize("-Ofast
Fiveneves·2020-08-07 23:44

“科大讯飞杯”第18届上海大学程序设计联赛春季赛暨高校网络友谊赛 E.美味的序列

2n×(n−1)/2即可即ans=sum−∑i=1n(n−i)ans=sum-\sum_{i=1}^n(n-i)ans=sum−∑i=1n(n−i)附上代码//#pragmaGCCoptimize("-Ofast
Fiveneves·2020-08-07 23:44

“科大讯飞杯”第18届上海大学程序设计联赛春季赛暨高校网络友谊赛 D.最大字符集

2时，集合可以是{0，11}或{1，00}n>2n>2n>2时，集合中元素都应100…001的结构，即{11，101，1001，…}具体操作见代码附上代码//#pragmaGCCoptimize("-Ofast
Fiveneves·2020-08-07 23:07

AcWing 刷题计划：0x00基础算法——AcWing 117. 占卜DIY

4.代码：//AcWing117.占卜DIY//#include//#pragmaGCCoptimize(3,"Ofast","inline")#include#include#include#include
Jetiaime·2020-08-04 21:02

数据结构[单链表]操作大全（初始化，创建，插入，查询，删除，长度，输出）c++代码实现

今晚上干了许久的链表看见指针就头大的我真的是头皮发麻了一晚上代码中写有注释，虽然不是太详细，但是了指针熟练的同学应该可以看懂main函数中请自由发挥#pragmaGCCoptimize(3,"Ofast
昵称很长很长真是太好了·2020-08-04 08:43

Codeforces Round #626 Div. 2

CodeforcesRound#626Div.2补题A思路：水题#pragmaGCCoptimize(3,"Ofast","inline")//G++#include#defineTESTfreopen
岛屿失梦°·2020-08-03 02:58

ACM卡常优化模板（C++/Java）

一、C++部分1.编译优化#pragmaGCCoptimize(2)#pragmaGCCoptimize(3)#pragmaGCCoptimize("Ofast")#pragmaGCCoptimize(
nefu_ljw·2020-08-03 01:07

Codeforces - Maximum White Subtree

AC代码：#pragmaGCCoptimize("-Ofast","-funroll-all-loops")#include//#defineintlonglongusingnamespacestd;constintN
青烟绕指柔!·2020-08-01 06:23
上一页 1 2 3 4 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他