![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
构造
囿于昼夜one
这个作者很懒,什么都没留下…
展开
-
Educational Codeforces Round 89 (Rated for Div. 2)D
思路就是构造:以下构造方法学习自heyuyyy大佬#include <iostream>#include <cstring>#include <cstdio>#include <queue>#include <algorithm>#include <cmath>#include <vector>#include <map>using namespace std;#define inf.原创 2020-07-05 11:40:20 · 2778 阅读 · 0 评论 -
Codeforces Round 647 (Div. 1)___C. Johnny and Megans Necklace —— 欧拉回路
题目大意:解题思路:#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <vector>#include <cmath>#include <set>#include <map>#include <queue>#include <iomanip>#in原创 2020-06-27 22:21:00 · 143 阅读 · 0 评论 -
CF 647E Johnny and Grandmaster
注意随意取模的那个数全程也要用那个模数,计算qpow,不然会出错#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>#include <queue>#include <vector>#include <string>#include <cmath>#include <set>#inc..原创 2020-06-24 18:00:53 · 208 阅读 · 0 评论 -
Codeforces Round #644 (Div. 3) H Binary Median
题意:给你m代表有2^m 个不同的01串,现在去掉n个,问剩下的2^m-n个串中 排序后中位的字符串. 中位计算:(id-1)/2做法:因为m只有60,考虑字符串当作longlong的整数来算。最初的中位数一定是01111形式就是2^(m-1)-1.然后n只有100,考虑对初始的中位数上下枚举100个数,然后判断小于当前数和大于当前数是否相等。至于怎么 去掉 n 的 影响。对当前数在n中二分查找大于当前数x的个数。那么大于x的个数就少了这么多。#pragma GCC optimize(2)#inc原创 2020-06-20 23:50:13 · 152 阅读 · 0 评论 -
CodeForces - 1333D Challenges in school №41(构造+模拟)
#include <iostream>#include <cstring>#include <cstdio>#include <queue>#include <vector>using namespace std;#define inf 0x7fffffffvector<int> v[3000001];char...原创 2020-04-13 16:56:51 · 126 阅读 · 0 评论