Xlint101

ACM模板

acceleration(18) java(3) kotlin(2) stars(1) 日记(1) 未归档(30) 真·随笔(10) 配置(1) 题解(1)

/ 注册

全部文章 / ACM模板（共26篇）

hash

const ull base = 233; ull hashsum[maxn]; ull pw[maxn]; void hash_init(string s) { int len=s.size(); pw[0] = 1; hashsum[0] = 1; // for ...

字符串

2020-04-12

0 183

计算几何

#include <bits/stdc++.h> #pragma GCC diagnostic error "-std=c++11" #define SIS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)...

计算几何

2020-04-05

0 249

tarjan

强连通分量 int low[maxn],dfn[maxn]; int sta[maxn];//secondary stack in SCC int point[maxn];//scc that vertices belong to bool omit[maxn];//if the vertiex ...

图论

2020-03-24

0 266

换根dp

https://codeforces.com/contest/1324/problem/F description you are given a tree, in which the vertices are all printed either black or white. , find ...

DP

2020-03-17

0 197

逆元与组合数

int add(int a,int b) { int c=(a+b); if (c>=mod) c-=mod; return c; } int mul(int a,int b) { ll c=1ll*a*b; return c-c/mod*mod; } int fpow(int x,...

数学

2020-03-14

0 212

数位dp

//https://www.luogu.com.cn/problem/P2657 #include <bits/stdc++.h> #pragma GCC diagnostic error "-std=c++11" #define SIS std::ios::sync...

DP

2020-03-09

0 229

RMQ

1 D void initRMQ(int n) { int MAX=(int)log2(n); FOR(i,1,n) { f[i][0]=a[i]; } FOR(j,1,MAX) { FOR(i,1,n) if (i+(1<<(j-1))<=n)...

RMQ

2020-02-25

0 225

kruscal

#include<bits/stdc++.h> using namespace std; const int maxn=2e5+10; int fi[maxn],ne[maxn],v[maxn],w[maxn]; struct re { int x,y,z; }; re a[maxn]...

图论

2020-02-22

0 184

dijkstra

void dijk(int sta) { FOR(i,1,n) dis[i]=inf; dis[sta]=0; priority_queue<Pair,vector<Pair>,greater<Pair> >q; q.push(MP(dis[sta],s...

图论

2020-02-22

0 203

ORIGIN

#include <bits/stdc++.h> //#define endl '\n' #define lose {printf("NO\n");return;} #define win {printf("YES\n");return;} #de...

2020-02-19

0 267