2020年09月_放浪曲蘖

原创寒假作业

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<map>#include<vector>#include<set>#include<queue>#include<stack>#include<cmath>using namespace std;typedef.

2020-09-27 18:01:20 42

原创方格填数

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<map>#include<vector>#include<set>#include<queue>#include<stack>#include<cmath>using namespace std;typedef.

2020-09-27 16:47:28 97

原创生日蜡烛

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<map>#include<vector>#include<set>#include<queue>#include<stack>#include<cmath>using namespace std;typedef.

2020-09-27 11:52:55 71

原创水下探测器

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<map>#include<vector>#include<set>#include<queue>#include<stack>#include<cmath>using namespace std;typedef.

2020-09-27 11:31:02 434

原创 2020中国大学生程序设计竞赛（CCPC） - 网络选拔赛 Express Mail Taking

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<map>#include<vector>#include<set>#include<queue>#include<stack>#include<cmath>using namespace std;typedef.

2020-09-22 11:19:32 829

原创 2020中国大学生程序设计竞赛（CCPC） - 网络选拔赛 Reports

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<map>#include<vector>#include<set>#include<queue>#include<stack>#include<cmath>using namespace std;typedef.

2020-09-21 17:26:52 257

原创序列划分

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<map>#include<vector>#include<set>#include<queue>#include<stack>#include<cmath>using namespace std;typedef.

2020-09-21 17:23:57 427

原创集合操作

#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<map>#include<vector>#include<set>#include<queue>#include<stack>#include<cmath>using namespace std;typedef.

2020-09-21 17:21:42 76

二分+bfsclass Solution {public: /** * @param arr: the map * @return: the smallest target that satisfies from the upper left corner (0, 0) to the lower right corner (n-1, n-1) */int n;struct P{ int x, y, w;};bool v[1003][1003];.

2020-09-19 18:58:23 105

原创 Educational Codeforces Round 95 C Mortal Kombat Tower

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<queue>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 200003, M = 1000.

2020-09-17 11:02:18 70

原创 Educational Codeforces Round 95 B Negative Prefixes

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N = 103;int a[N], l[N], b[N];//将能动的从大到小开始放即可int main(){ int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i.

2020-09-17 10:48:17 95

原创 Educational Codeforces Round 95 A. Buying Torches

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<queue>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 1000003, M = 100.

2020-09-17 10:47:25 81

原创 327.玉米田

#include<iostream>#include<cstring>#include<algorithm>#include<vector>using namespace std;const int N = 15, M = 1 << 12;const int mod = 1e8;typedef long long ll;int mp[N][N];int n, m;ll line[N],h[M];ll f[N][M];//f.

2020-09-15 18:14:20 135

原创火柴排队（状态机）

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N = 5005, mod = 998244353;typedef long long ll;ll a[N], fac[N], infac[N];ll f[N][N][2];//从前i项中选j项增加d结果不变的方案数ll qmi(ll a, int k, int p)//return.

2020-09-14 20:51:40 86

原创 1064.小国王

#include<iostream>#include<cstring>#include<algorithm>#include<vector>using namespace std;const int N = 13, M = 1 << 10, K = 103;typedef long long ll;ll f[N][K][M];//前N行已经放了K个国王且最后一行的状态是Svector<int> state;//存储.

2020-09-12 21:06:55 98

原创 1058.股票买卖

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<queue>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 100003, M = 1000.

2020-09-12 17:05:46 65

原创时间复杂度

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<queue>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 100003, M = 1003.

2020-09-12 16:16:36 117

原创划分

#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int N = 100005;typedef long long ll;const int inf = 0x3f3f3f3f;int a[N];ll p[N];//容易看出每次取的是前i*j个最大的数int main(){ int n; cin >> n; for (i.

2020-09-12 16:16:01 129

原创 Codeforces Round #669 (Div. 2)C. Chocolate Bunny

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<queue>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 500003, M = 1000.

2020-09-12 16:14:58 67

原创旅行（生成树模板）

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N = 500005, mod = 1e9 + 7;typedef long long ll;int f[N];struct E{ int u, v, w;}ed[N];int find(int x){ if (x != f[x]) return f[x]=find(f[.

2020-09-12 10:30:36 72

原创 Codeforces Round #669 (Div. 2)A. Ahahahahahahahaha

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<queue>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 100003, M = 1003.

2020-09-11 17:38:56 56

原创 Codeforces Round #669 (Div. 2)B. Big Vova

#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int N = 1005;typedef long long ll;const int inf = 0x3f3f3f3f;int a[N],res[N];inline int gcd(int a, int b){ return b ? gcd(b, a % b) : a;}//最大的数.

2020-09-11 17:27:36 79

原创智斗恶龙

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<queue>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 100003, M = 1003.

2020-09-11 12:36:57 138

原创 Codeforces Round #665 (Div. 2)C. Mere Array

#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int N = 100005;typedef long long ll;const int inf = 0x3f3f3f3f;int a[N],b[N];//只要是能被最小的数整除的数之间的位置都是可以任意变化的，所以对数组直接排序//对于不能整除的数，如果他们的位置没有变化，则说明可以，反之.

2020-09-11 12:11:10 138

原创 Codeforces Round #665 (Div. 2)B. Ternary Sequence

#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int N = 3005;typedef long long ll;const int inf = 0x3f3f3f3f;int main(){ int t; cin >> t; while (t--) { int x1, y1, z1, x2, y2, z2; c.

2020-09-11 12:08:42 64

原创 Codeforces Round #665 (Div. 2)A. Distance and Axis

#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int N = 3005;typedef long long ll;const int inf = 0x3f3f3f3f;int main(){ int t; cin >> t; while (t--) { int n, k; cin >> n >.

2020-09-11 12:03:32 53

原创 Codeforces Round #665 (Div. 2)D. Maximum Distributed Tree

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N = 100005, mod = 1e9 + 7;typedef long long ll;ll h[N], e[N * 2], ne[N * 2], idx;ll p[N], a[N], siz[N];int n, m, cnt;void add(int a, int b){ .

2020-09-11 12:01:36 47

原创能量水晶

#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int N = 3005;typedef long long ll;//这个题会爆intll f[N][N], w[N], s[N];//f[i][j]:从前i个中选能量和恰好为j的集合/*我们要让水晶不能再释放下一个法术,那么也就是说要让剩下的能量,不足以去施展剩下的消耗最小的那个法术,我.

2020-09-10 17:12:20 412

原创 1057.股票买卖

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N = 100005, inf = 0x3f3f3f3f;int f[N][105][2], w[N];//f[i][j][k]:前i个股票中进行j次交易的集合//f[i][j][0]:表示当前手中的股票已经抛出，第j次交易已经进行完了//f[i][j][1]:表示当前手中的股票还未抛出，.

2020-09-10 10:47:14 114

原创 873.欧拉函数

#include<iostream>#include<cstring>#include<algorithm>using namespace std;//欧拉函数：1-N中与N互质的数的个数=N*(1-1/p1)*(1-1/p2)*...*(1-1/pm)int main(){ int n; cin >> n; while (n--) { int a; cin >> a; int res = a; //质因数.

2020-09-08 22:36:12 96

原创超级码力在线编程大赛初赛第3场 3.字符串游戏（反nim游戏）

class Solution {public: /** * @param s: a string for this game * @return: return whether Alice can win this game必胜态：①有偶数堆且每堆的数目都是1 ②至少有一堆数量大于0且异或和不等于0 */ bool stringGame(string &s) { // Write your code he.

2020-09-05 15:57:46 72

原创 1094.大盗阿福

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 100003, M = 103, inf = 0x3f3f3f3f;typ.

2020-09-04 11:49:45 57

原创 1094.大盗阿福（状态机）

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 100003,M=103, inf = 0x3f3f3f3f;typede.

2020-09-04 11:46:50 50

原创 487.金明的预算方案

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 63, inf = 0x3f3f3f3f;typedef pair<.

2020-09-03 22:03:27 68

原创 734.能量石

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 10003, inf = 0x3f3f3f3f;typedef pair&.

2020-09-03 20:09:28 60

原创 poj2100 Graveyard Design（尺取法）

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 10003, inf = 0x3f3f3f3f;typedef pair&.

2020-09-03 17:01:46 120

原创 poj2793 Sum of Consecutive Prime Numbers（尺取法）

#include<iostream>#include<algorithm>#include<cstring>#include<vector>#include<set>#include<stack>#include<map>#include<cmath>using namespace std;const int N = 10003, inf = 0x3f3f3f3f;typedef pair&.

2020-09-03 16:28:35 39

原创线性筛

#include<bits/stdc++.h>using namespace std;const int N = 1000005;int prime[N], cnt;bool vis[N];void get_prime(int n){ for (int i = 2; i <= n; i++) { if (!vis[i]) prime[cnt++] = i; for (int j = 0; prime[j] <= n / i; j++) { v.

2020-09-03 16:06:12 59

原创 10.有依赖的背包问题

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N=103;int n,m;int h[N],v[N],ne[N],e[N],w[N],idx;int f[N][N];//f[i][j]:以i为根的子树,体积不超过j的集合void add(int a,int b){ e[idx]=b; ne[idx]=h[a]...

2020-09-03 15:44:35 128

空空如也

空空如也