申屠志刚

分类

ACM(1) C(128) C++(380) C.++(1) CTF(44) C语言(34) DP(4) JAVA(2) Python(1) 博弈论(1) 并查集(2) 最小生成树(1) 最短路(2) 未归档(435) 浙江理工大学2018年10月赛(2) 生成树(1) 申屠志刚的ACM之路(37) 申屠志刚的CTF之路(2) 矩阵(1) 线段树(1) 经典问题(1) 背包问题(1) 语法(1)

/ 注册

全部文章（共26篇）

Magic Powder - 2

https://codeforces.com/contest/670/problem/D2 The term of this problem is the same as the previous one, the only exception — increased restrictions. ...

C 二分

2018-11-03

0 533

Magic Powder - 1

https://codeforces.com/contest/670/problem/D1 This problem is given in two versions that differ only by constraints. If you can solve this problem in...

C 二分

2018-11-03

0 601

Cup

The WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height? The...

C 二分高精度

2018-11-04

0 857

4 Values whose Sum is 0

The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D...

C 二分

2018-11-05

0 543

Can you find it?

Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, whic...

C 二分

2018-11-04

0 511

River Hopscotch

Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The exciteme...

C 二分

2018-11-04

0 429

Aggressive cows

Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1,...,xN (0...

C 二分

2018-11-05

0 577

楼房重建

小A的楼房外有一大片施工工地，工地上有N栋待建的楼房。每天，这片工地上的房子拆了又建、建了又拆。他经常无聊地看着窗外发呆，数自己能够看到多少栋房子。　　为了简化问题，我们考虑这些事件发生在一个二维平面上。小A在平面上(0,0)点的位置，第i栋楼房可以用一条连接(i,0)和(i,Hi)的线段表示，其...

C 分块二分

2018-11-05

0 597

GukiZ and GukiZiana

http://codeforces.com/problemset/problem/551/E Professor GukiZ was playing with arrays again and accidentally discovered new function, which he calle...

C 分块二分

2018-11-06

0 539

qw的表白

Description qw喜欢上了一个美丽的女孩，并勇敢向她表白。但女神喜欢算法厉害的男生，便给他出了一道题：给定包含n 个整数的数列a 和m 个询问，每个询问包含两个整数L ，R ，对于每一个询问，要求输出数列中有多少个数ai ，满足L≤a2i≤R ，即有多少个数平方后取值范围在[L,R] ...

C 二分

2018-11-10

0 464