QieQiemin

codeforces

ACM刷题之旅(9) ACM常用知识(7) Atcoder/洛谷(83) a牛客网/comet OJ(200) HDU/POJ/BZOJ/计蒜客(108) STL(2) 二分(1) 二分/三分(2) 几何（计算几何，解析几何）(7) 分治/偏序(2) 动态规划DP(18) 图的全家桶/ 最短路/Tarjan强连通/MST/拓扑(7) 字符串处理/ hash(5) 字符串的高级算法/ACM(1) 思维(5) 搜索系列/BFS/DFS(2) 数学/MATH/ 组合数学/(5) 数据结构/线段树/树状数组(12) 数论(7) 暴力/状态压缩/二进制枚举(2) 未归档(4) 构造/技巧(7) 树的全家桶/ 树形DP/ LCA/MST/树链剖分(6) 模拟/实现(2) 模板(19) 组队赛训练记录(2) 规律/打表/结论题(2) 贪心(1) 题解(1) 高精/大数(6)

/ 注册

全部文章 / codeforces （共323篇）

Educational Codeforces Round 37 G. List Of Integers （二分，容斥定律，数论）

G. List Of Integers time limit per test 5 seconds memory limit per test 256 megabytes input standard input output standard output Let's denot...

2019-10-02

0 454

Educational Codeforces Round 37-F.SUM and REPLACE （线段树，线性筛，收敛函数）

F. SUM and REPLACE time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Let D(x) be the number o...

2019-10-02

0 347

Educational Codeforces Round 37-F.SUM and REPLACE （线段树，线性筛，收敛函数）

F. SUM and REPLACE time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Let D(x) be the number o...

2019-10-02

0 406

Codeforces 920E-Connected Components? （set，补图，连通块）

Connected Components? CodeForces - 920E You are given an undirected graph consisting of n vertices and edges. Instead of giving you the edges that...

2019-10-02

0 338

Codeforces 920E-Connected Components? （set，补图，连通块）

Connected Components? CodeForces - 920E You are given an undirected graph consisting of n vertices and edges. Instead of giving you the edges that ...

2019-10-02

0 737

Persistent Bookcase CodeForces - 707D （dfs 离线处理有根树模型的问题&&Bitset）

Persistent Bookcase CodeForces - 707D time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard o...

2019-10-01

0 366

Persistent Bookcase CodeForces - 707D （dfs 离线处理有根树模型的问题&&Bitset）

Persistent Bookcase CodeForces - 707D time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard ou...

2019-10-01

0 421

Pursuit For Artifacts CodeForces - 652E （Tarjan+dfs）

Pursuit For Artifacts CodeForces - 652E Johnny is playing a well-known computer game. The game are in some country, where the player can freely tra...

2019-09-23

0 466

Pursuit For Artifacts CodeForces - 652E （Tarjan+dfs）

Pursuit For Artifacts CodeForces - 652E Johnny is playing a well-known computer game. The game are in some country, where the player can freely trav...

2019-09-23

0 744

D - Nested Segments CodeForces - 652D (离散化+树桩数组)

D - Nested Segments CodeForces - 652D You are given n segments on a line. There are no ends of some segments that coincide. For each segment find t...

2019-09-20

0 356