利拉寇尔-优快云博客

原创 POJ 2251

char pic[40][40][40];bool vis[40][40][40];int dx[]={0,0,-1,1,0,0};int dy[]={-1,1,0,0,0,0};int dz[]={0,0,0,0,-1,1};int ans,l,r,c;int sx,sy,sz,ex,ey,ez;typedef struct mapnode{ int x

2017-01-22 14:05:37 285

翻译 2016 青岛大致题意

青岛Asigma 1-n ai*biB2*2*2的魔方，每个面分为4个小正方形，上面有数字，问能否通过旋转使每个面的正方形数字都相同C一根长度为L的棍子，其上一点被随机选中，从此点分成两半，取右边一半，重复此过程直到长度不大于d，求操作次数的期望值Dk种硬币，每种数量不同，正面朝上的概率也不同。投所有硬币，拿走背面朝上的，重复此过程直到只剩下一种硬币。问每种硬币留到

2016-12-02 22:19:14 271

翻译 2016 沈阳大致题意

A输入a,b,输出a+b+max(a,b)B有H,O,C三种原子,原子量分别为1,16,12,输入代表化学分子的字符串，输出分子量Cf(1)=a，f(2)=b，f(i)=2*f(i-2)+f(i-1)+i^4，求f(n)D输入A,B,Nalice有A元，bob有B元，有N件物品，对于每件物品，alice可花a元，bob可花b元，出价多的人拿到该物品，a=b时，奇数轮

2016-12-02 19:56:00 375

原创 POJ 2785

int main(){ int n; LL cnt=0;LL ans=0; LL temp; scanf("%d",&n); rep(i,n) scanf("%I64d%I64d%I64d%I64d",a+i,b+i,c+i,d+i); rep(i,n) rep(j,n) { e[cnt]=a[i]+b[j];

2016-11-28 09:26:10 567

原创 HDU 5968

int a[MAXN];int b[MAXN];int c[MAXN];int d[MAXN];int main(){ int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); rep(i,n) scanf("%d",a+i); in

2016-11-28 09:24:27 353

原创 HDU 5950

int main(){ int t; matrix ans,base; scanf("%d",&t); LL n,a,b; while(t--) { scanf("%I64d%I64d%I64d",&n,&a,&b); memset(ans.m,0,sizeof(ans.m)); ans.m[0][0

2016-11-28 09:23:52 459

原创 HDU 5969

const long long MAXN=10000+5;char tem[MAXN];int cnt[MAXN];typedef vector vci; typedef pair pii;typedef vector > vpii;LL bits[70];int main(){ bits[0]=1; for(int i=1;i<=62;i++) bits[i]=b

2016-11-28 09:23:07 239

原创 HDU 1711

#include#include#include#includetypedef long long LL;using namespace std;const int MAXN=1000005;int thenext[MAXN];int a[MAXN];int b[10005];int kmp(int a[],int b[],int la,int lb){ //a,b

2016-10-31 21:15:20 180

原创 HDU 3336

#include#include#include#includetypedef long long LL;using namespace std;const int MAXN=200005;const int MOD=10007;int thenext[MAXN];int dp[MAXN];char a[MAXN];int main(){ int n,len;

2016-10-31 21:14:55 224

原创 POJ 2752

#includeusing namespace std;const int MAXN=400000+15;int next[MAXN];int ans[MAXN];char str[MAXN];int main(){ while(scanf("%s",str+1)!=EOF) { int len=strlen(str+1); int j

2016-10-26 22:07:52 246

原创简单KMP

#includeusing namespace std;int next[1005];int kmp(char *a,char *b){ //a,b start from 1 int mx=0; int la=strlen(a),lb=strlen(b); int j=0; for(int i=2;i {

2016-10-26 20:46:58 228

原创 Codeforces Round #373 (Div. 2) A&B

半小时A两题，当时感觉C能做出来，可是后来才发现搞错题意了，要DP……A#include#include#include#include#includeusing namespace std;#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rer(i,l,u) for(int (i)=(int)(l);(i)

2016-09-23 23:07:22 371

原创 HDU 1520

#include#include#include#include#includeusing namespace std;const int MAXN=20000+5;struct node{ int v; int next;}tree[MAXN];int vis[MAXN],head[MAXN],dp[MAXN][2];int ptr

2016-09-16 19:41:31 271

原创 2014-2015 ACM-ICPC Tokyo Region Miscalculation

#include#include#include#include#includeusing namespace std;char in[500],op[100];int num[100];int main(){ int out,ans1=0,ans2=0,tem=1; int ncnt=0,ocnt=0; //freopen("test.txt","r",

2016-09-05 22:48:08 285

原创 Codeforces 201A

#include#include#include#include#includeusing namespace std;#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))#define reu(i,l,u) for

2016-09-05 22:47:19 345

原创 Codeforces 711B

#include#include#include#include#includeusing namespace std;#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))#define reu(i,l,u) for

2016-09-05 22:46:15 193

原创 POJ 3468

现在勉强能手打区间更新，Hotel 还是没学会#include#include#include#include#include//#include//#include//#includeusing namespace std;#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rel(i,n) for(int

2016-08-19 11:20:37 280

原创 HDU 1754

#include#include#include#include#include//#include//#include//#includeusing namespace std;//typedef vector vi; typedef pair pii; typedef vector > vpii; typedef long long LL;#define rep(i,n)

2016-08-18 19:46:24 286

原创 LightOJ 1112

线段树练习#include#include#include#include#includeusing namespace std;#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rel(i,n) for(int (i)=1;(i)<=(int)(n);++(i))#define rer(i,l,u) for(i

2016-08-17 20:41:46 246

原创 LightOJ 1080

线段树练习#include#include#include#include#includeusing namespace std;#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rel(i,n) for(int (i)=1;(i)<=(int)(n);++(i))#define rer(i,l,u) for(i

2016-08-17 20:16:29 334

原创 LightOJ 1082

线段树练习#include#include#include#include#includeusing namespace std;#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rel(i,n) for(int (i)=1;(i)<=(int)(n);++(i))#define rer(i,l,u) f

2016-08-17 16:31:13 208

原创 Codeforces 25C

#include#include#include#include#include#include#include#define LL long long#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rel(i,n) for(int (i)=1;(i)<=(int)(n);++(i))#define rer(i

2016-08-13 12:52:24 518

原创 Codeforces 505B

#include#include#include#include#include#include#include#define long long LL#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))#define rel(i,n) for(int (i)=1;(i)<=(int)(n);++(i))#define rer(i

2016-08-13 12:49:13 268

原创 HDU 1272（并查集）

#include#include#include#include#include#include#include#includeusing namespace std;#define rep(i,n) for(int (i)=1;(i)<=(int)(n);++(i))const int MAXN=100005;int from[MAXN],to[MAXN];int fat

2016-08-12 15:17:03 183

原创繁忙的都市

#include#include#include#include#define LL long longusing namespace std;int n,m,s,mx;int father[305];struct Edge{ int u; int v; int w;}edge[90005];int Cmp(Edge x,Edge y){ r

2016-08-11 15:11:01 298

原创 UVAL 7327

#include#include#include#define MOD (1000000000+7)char a[300005];int ans=0;long long fast_mod(int n){ if(n==0)return 1; else if(n%2==0) { long long a=fast_mod(n/2);

2016-08-10 20:57:56 325

原创 UVAL 7324(字符串)

#include#include#include#include#include#include#include#include#include#include#define LL long longusing namespace std;char str[10][130];char tem[7][6];char one[7][6]={'.','.','.','.'

2016-08-10 19:04:08 262

原创 Codeforces Round #366 (Div. 2)

第一次打完正常的CF（上一轮Div 2交一题排队几十分钟，还延时半个小时），最后做出两题705A Hulk没太多可说的，签到题#include#include#include#include#include#include#include#include#include#include#define LL long longusing namespace std;

2016-08-08 00:19:10 506

原创 Codeforces 701A+701B

701A 题意：给偶数张有点数的卡，问如何分配能使n/2个人拿到的点数一样记录输入顺序，按点数排序，每次拿首尾两张#include#include#include#include#include#include#include#include#include#include#define LL long longusing namespace std;struct

2016-08-05 20:04:06 686

原创 Codeforces 584D Dima and Lisa(质数查找)

题意：给一个奇数n (3分情况讨论:1:本身就是质数，直接输出。2:因为偶质数只有2，所以分解成2个质数的情况下只能是2和n-2，判断n-2即可。3.特殊情况:2+2+n-4=n，判断n-4即可。一般情况：奇+奇+奇=奇，从最大的质数a开始找。a范围:3~n-6(假设bc都是3)b范围:3~n-a-3(假设c是3)c:n-a-b一开始想打表，但是10

2016-08-04 16:43:35 365

原创 Codeforces 166A Rank List(二分)

#include#include#include#include#include#include#include#include#include#include#define LL long longusing namespace std;struct man{ int p; int t;}men[55];int has[55];bool cmp(m

2016-08-04 09:24:54 392

原创 POJ 3233(矩阵快速幂)

WA代码:#include#include#include#include#include#include#include#include#includeusing namespace std;int n,k,mod;struct matrix{ int m[32][32];};matrix multi(matrix a,matrix b){ ma

2016-08-02 16:48:34 277

原创二分查找模板

int lower(int l,int r,int key){ while(l<r) { int mid=l+(r-l)/2; if(a[mid]==key) r=mid; if(a[mid]>key) l=mid+1; if(a[mid]<key) r=mid; } return l;}int

2016-08-01 10:11:05 314

原创矩阵快速幂模板

#include#include#include#include#includeusing namespace std;const int MOD = 1000000;//根据需要取的末尾位数更改const int MAX=10;//根据矩阵的大小上限更改int t;struct matrix{ int m[MAX][MAX];}ans, base;matrix m

2016-08-01 09:45:22 317

转载 Binary Numbers

Representing Binary NumbersComputers operate on 1's and 0's; these are called 'bits'. A byte is a group of 8 bits, like this example: 00110101. A computer word on a 32-bit computer ('int') is 4 by

2016-07-31 16:59:06 436

A good way to get a competitive edge is to write down a game plan for what you're going to do in a contest round. This will help you script out your actions, in terms of what to do both when things go

2016-07-31 15:40:12 477

原创 CodeForces 702A Maximum Increase

注意要求的是最长递增子串，不是子序列，由于要求连续，所以只需要看是否比前一个数大

2016-07-30 16:05:28 717

转载一些DP资料

最长递增子序列(LIS)if (a[i]>a[j]) dp[i]=max(dp[i],dp[j]+1)最长公共子序列(LCS)dp[i][j]=dp[i-1][j-1]+1 (a[i]==b[j])dp[i][j]=max(dp[i-1][j],dp[i][j-1]) (a[i]!=b[j])最大连续子序列和if(dp[i-1]>0) dp[i]=dp[

2016-07-28 20:07:32 499

转载 Special LATEX symbols

TEXT Symbols✩ \$& \&# \#% \%{ \{} \}\-➯ \P➜ \S❸ \dag❹ \ddagı \i \jBB✚ \t{BB}U¨ \"{U}˙I \.{I}G˜ \~{G}A˝ \H{A}O` \‘{O}Cˆ \^{C}Cˇ \v{C}˚T \r{T}P´ \’{P}M

2016-07-20 19:54:45 2578

空空如也

空空如也