2018年01月_我的妹妹syf

原创 AtCoder Grand Contest 017 D - Game on Tree

#include#define N 200100using namespace std;int beg[N],to[N],nex[N];int sg[N];int len,n;inline void Add(int a,int b){ nex[++len]=beg[a],beg[a]=len,to[len]=b; nex[++len]=beg[b],beg[b]=len,to[le

2018-01-13 21:05:07 246

原创 AtCoder Regular Contest 077 E - guruguru

#include#define N 100100using namespace std;typedef long long LL;inline void read(int &a){ a=0;char ch=getchar(); while(ch'9') ch=getchar(); while(ch='0') a=a*10+ch-'0',ch=getchar();}int a[N]

2018-01-13 20:58:53 237

原创 AtCoder Grand Contest 003 D - Anticube

#include#define N 100100using namespace std;typedef long long LL;int prime[2200],len;int n,m,ans;LL l[N],r[N];map ma;int main(){ for(int i=2;i<2200;i++){ int fla=1; for(int j=2;j<i;j++)

2018-01-13 14:56:30 442

原创 wannafly 挑战赛 7

A整个矩阵被划分成4个子矩阵，分别计算这4个子矩阵能不能被覆盖，需要几次即可。#includeusing namespace std;long long t,n,m,r,c,k;inline long long w(long long a,long long b){ if(!a||!b) return 0; if(a<k||b<k) return -1e18; return

2018-01-06 21:14:59 843

原创 AtCoder Grand Contest 002 E - Candy Piles

#include#define N 100100using namespace std;int a[N],n,sg=1;int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); sort(a+1,a+n+1); reverse(a+1,a+n+1); for(int i=1;i<=n;i++){

2018-01-04 20:55:03 443

原创 AtCoder Grand Contest 002 D - Stamp Rally

道理我都懂，可是看了一眼其他题解为什么那么长啊。。。#include#define N 100100using namespace std;struct Node{int x,y,z,l,r,las,ord;}q[N];int n,m,Q;int fa[N],siz[N],ans[N];int a[N],b[N];int find_fa(int a){ return fa[a]

2018-01-04 19:53:12 284

原创 agc001E

#includeusing namespace std;inline void read(int &a){ a=0;char ch=getchar(); while(ch'9') ch=getchar(); while(ch='0') a=a*10+ch-'0',ch=getchar();}const int MOD=1e9+7;int dp[4010][4010],fac[801

2018-01-02 10:15:08 297

原创 agc001D

#include#define N 1010using namespace std;int n,m;int a[N];vector s,w;int main(){ scanf("%d%d",&n,&m); for(int i=0;i<m;i++){ scanf("%d",&a[i]); if(a[i]&1) s.push_back(a[i]); else w.push_

2018-01-02 09:19:17 285

流水的博客