随笔分类 - 思维
摘要：cpp include include using namespace std; int n, uu, m; bool a[4500005], vis[4500005][2]; void dfs(int x, int y){ if(vis[x][y]) return ; vis[x][y] = tr
阅读全文
摘要："set做法" ~~正解是trie……~~ 主要是要学会 $a\ \mathrm{xor}\ b \leq a+b$ 这种操作 cpp include include include using namespace std; int q, opt, uu, vv, ww; set se[100005
阅读全文
摘要：挺简单的，从 $n$ 到 $1$ 探讨是否能被加入。要加入的话必定是加入一条链，倍增以下看看要加多少，能不能加就可以了。 cpp include include include using namespace std; int n, k, hea[1000005], cnt, uu, vv, dep
阅读全文
摘要："ref" cpp include include include include using namespace std; typedef long long ll; typedef pair pir; int n, a, b, uu, vv, ww; map mp1; map mp2; int
阅读全文
摘要："ref" cpp include include include include include using namespace std; int n; char su[2005], sv[2005]; vector vec; void shift(int x){ if(x==0) return
阅读全文
摘要："qaq" cpp include include include using namespace std; typedef long long ll; int n, a, b; ll ans, tmp; struct Node{ ll hp, dm; }nd[200005]; bool cmp(N
阅读全文
摘要："ref" cpp include include include include using namespace std; int n, d[305], deg[1005]; vector vec; int main(){ cin n; for(int i=1; i
阅读全文
摘要："ref" cpp include include using namespace std; int a[100005], n, l, ans=0x3f3f3f3f; int main(){ cin n l; for(int i=1; i
阅读全文
摘要：呸，大傻逼题，我更傻逼 "ref" cpp include using namespace std; typedef long long ll; ll n, k, m, d, ans; int main(){ cin n k m d; for(int i=1; i
阅读全文
摘要：越靠近叶子越优先删掉
阅读全文
摘要：考虑在位置 $p$ 的青蛙。 如果 $p$ 是奇数，答案显然是 $(p+1)/2$。 否则，由于未跳时 $p$ 左边有 $p/2$ 只，则 $p$ 右边有 $n p/2$ 只，则这青蛙是从 $p+n p/2$ 处跳过来的。
阅读全文
浙公网安备 33010602011771号