ICPCCamp
文章平均质量分 73
yamiedie_
这个作者很懒,什么都没留下…
展开
-
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 · 516 阅读 · 0 评论 -
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 · 477 阅读 · 0 评论 -
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 · 949 阅读 · 0 评论 -
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 · 388 阅读 · 0 评论 -
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 · 566 阅读 · 0 评论