2016年04月_yamiedie_

原创 bzoj 1023 [SHOI2008]cactus仙人掌图

#include #include #include #include #include #include using namespace std;#define eps 1e-8#define N 100020#define M 400020#define LL long longint fst[N], nxt[M], vv[M], e;int n, m;int

2016-04-19 16:53:19 378

原创 ICPCCamp 2016 Day3 - G Random Arighmetic (dp)

#include #include #include using namespace std;#define N 2020#define inf 0x3f3f3f3f#define mod 1000000007int qpow(int x, int k) { int ret = 1; while(k) { if(k & 1) ret = 1LL * ret * x %

2016-04-15 15:36:28 553

原创 ICPCCamp 2016 Day 3 - F Similar Subsequence (dp)

#include #include #include using namespace std;#define N 520#define inf 0x3f3f3f3fint n, m, a[N], b[N];int dp[N][N];int main() { scanf("%d%d", &n, &m); for(int i = 1; i <= n; ++i) {

2016-04-15 14:51:41 373

原创 ICPCCamp 2016 Day 1 - F Data Structure You've Never Heard Of (sqrt(n))

#include #include #include #include using namespace std;#define N 202000#define M 200020#define LL long long#define B 1024#define mod 1000000007#define D 8int n, a[N], d;char s[18];int

2016-04-14 15:11:40 939

原创 ICPCCamp 2016 Day 1 - B All Pair Shortest Path (bitset)

#include #include #include #include using namespace std;#define N 2020#define M 200020#define LL long longstruct bs {#define K 40#define B 60 LL a[K]; void reset() { for(int i = 0; i

2016-04-14 14:07:55 464

原创 ICPCCamp 2016 Day 1 - A Aho-Corasick Automaton (主席树)

#include #include #include #include using namespace std;#define N 200020#define M 200020int fst[N], nxt[M], vv[M], e;void init() { memset(fst, -1, sizeof fst); e = 0;}void add(int u, in

2016-04-14 13:45:45 498

原创 hdu 1533 Going Home (zkw + spfa和slf优化)

#include #include #include #include #include #include #include using namespace std;#define N 1002#define M 500020#define inf 0x3f3f3f3f#define eps 1e-8#define inf 0x3f3f3f3fint n;in

2016-04-07 14:46:52 543

原创 hdu 1533 Going Home(zkw费用流)

#include #include #include #include #include #include using namespace std;#define N 1002#define M 500020#define inf 0x3f3f3f3f#define eps 1e-8#define inf 0x3f3f3f3fint n;int m;char

2016-04-07 13:03:29 352

原创单纯形模板

#include #include #include #include #include #include using namespace std;#define N 1002#define M 1020#define inf 0x3f3f3f3f#define eps 1e-8struct SIMPLEX { // AX <= B // minimize C^T

2016-04-05 19:54:18 624

原创 bzoj 3265 志愿者招募加强版 (单纯形)

这里对原问题进行了对偶求解#include #include #include #include #include #include using namespace std;#define N 520#define M 200020#define inf 0x3f3f3f3f#define eps 1e-8double A[10100][1020], b[10100

2016-04-05 19:10:31 439

原创 Codeforces 44I Toys (构造)

#include using namespace std;#define N 122#define mod 1000000007#define vvi vector >#define vi vector#define pb push_backint n;int p[N];bool vis[12];void output(vi &s) { memset(vis, 0,

2016-04-01 16:39:37 365

原创 Codeforces 217D Bitonix' Patrol (dfs + bitset)

#include using namespace std;#define N 122#define mod 1000000007bool vis[N];int cnt[N], x[N];int n, m, k;bitset s[8];int ans;int getAns(int d) { int ret = 1; for(int i = 1; i < d; ++i)

2016-04-01 15:25:07 501

原创 Codeforces 135E Weak Subsequence(组合计数)

#include #include #include using namespace std;#define N 1000030#define mod 1000000007int qpow(int x, int k) { int ret = 1; while(k) { if(k & 1) ret = 1LL * ret * x % mod; k >>= 1; x

2016-04-01 13:42:51 449

yamiedie_