摘要:
[BZOJ3673]可持久化并查集 by zky 试题描述 n个集合 m个操作操作:1 a b 合并a,b所在集合2 k 回到第k次操作之后的状态(查询算作操作)3 a b 询问a,b是否属于同一集合,是则输出1否则输出0 0<n,m<=2*10^4 n个集合 m个操作操作:1 a b 合并a,b所 阅读全文
摘要:
[HDU5919]Sequence II 试题描述 Mr. Frog has an integer sequence of length n, which can be denoted as a1,a2,⋯,an There are m queries.In the i-th query, you 阅读全文
摘要:
[codeforces538F]A Heap of Heaps 试题描述 Andrew skipped lessons on the subject 'Algorithms and Data Structures' for the entire term. When he came to the f 阅读全文
摘要:
[codeforces538E]Demiurges Play Again 试题描述 Demiurges Shambambukli and Mazukta love to watch the games of ordinary people. Today, they noticed two men w 阅读全文
摘要:
[codeforces538D]Weird Chess 试题描述 Igor has been into chess for a long time and now he is sick of the game by the ordinary rules. He is going to think o 阅读全文
摘要:
[BZOJ4026]dC Loves Number Theory 试题描述 dC 在秒了BZOJ 上所有的数论题后,感觉萌萌哒,想出了这么一道水题,来拯救日益枯竭的水题资源。 给定一个长度为 n的正整数序列A,有q次询问,每次询问一段区间内所有元素乘积的φ(φ(n)代表1~n 中与n互质的数的个数) 阅读全文