provincial专题

【XCPC笔记】2023 (ICPC) Jiangxi Provincial Contest——ABCHIJKL 做题记录

赛后gym练习及补题,gym链接:2023 (ICPC) Jiangxi Provincial Contest – Official Contest 补题顺序 L [Zhang Fei Threading Needles - Thick with Fine](https://codeforces.com/gym/104385/problem/L)题面解读参考代码 A [Drill Wood

【XCPC笔记】2023 (ICPC) Jiangxi Provincial Contest——ABCIJKL 做题记录

补题 赛后gym练习及补题,gym链接:2023 (ICPC) Jiangxi Provincial Contest – Official Contest 另外,D题我也打算找机会学习写下,C题的博弈论还需要好好理解,感觉都是比较有趣的数学问题 补题顺序如下 补题L [Zhang Fei Threading Needles - Thick with Fine](https://codef

The 2019 ACM-ICPC China Shannxi Provincial Programming Contest C.Angel's Journey

题意: T(T<=500)组样例,每组样例给出rx,ry,r,x,y(-100<=rx,ry,x,y<=100,0<r<=100) 代表被救的人在(rx,ry-r)位置,且(rx,ry)为圆心有一个半径为r的圆 你从圆外(x,y)出发,题目保证y>ry, y=ry及这条水平线以下的圆外部分是海,圆内部也是海,都不能经过 问(x,y)到(rx,ry-r)的最短距离 分析:有关切线的问题一

The 8th Zhejiang Provincial Collegiate Programming Contest / D - String Successor

返回目录   悲剧地wa了,不知道哪错,而且代码越改越恶心 不喜勿看=。= ,知道哪错的麻烦告诉我一下O(∩_∩)O... ①  未改 #include<cstdio>#include<cstring>using namespace std;inline int Rint() { int x; scanf("%d", &x); return x;}#define MAXN 11

The 8th Zhejiang Provincial Collegiate Programming Contest / M - Median

返回目录   代码: #include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;inline int Rint() {int x; scanf("%d", &x); return x;}inline double Rd() {double x; scanf("%lf

The 8th Zhejiang Provincial Collegiate Programming Contest / L - Javabeans

返回目录   代码:  #include<cstdio>#include<cstring>#define int64 long longinline int64 Rint() {int64 x; scanf("%lld", &x); return x;}int64 n;int solve(){int ans=0;while(n){n/=2;ans++;}return

The 8th Zhejiang Provincial Collegiate Programming Contest / F - Kagome Kagome

返回目录   代码: #include<cstdio>#include<cstring>#define MAXN 102char a[MAXN][22]; //0~n-1inline int Rint() {int x; scanf("%d", &x); return x;}#define Fi(n) for(int i=0; i<n; i++)int n;char b[22]

The 8th Zhejiang Provincial Collegiate Programming Contest / B - Conic Section

返回目录   代码: #include<cstdio>#include<cstring>using namespace std;void solve(){if(a!=0&&c!=0&&a==c)printf("circle/n");else if(a!=0&&c!=0&&a!=c&&a*c>0)printf("ellipse/n");else if((a==0&&c!=0

The 2023 Guangdong Provincial Collegiate Programming Contest

I. Path Planning 嗯,怎么说呢,一般二维图,数据不是很大的比如n*m*log级别允许的,如果一眼不是bfs,可以考虑结合一下二分 本题可知,只能向下或者向右,那么我们就像如果答案为x,那么一定会有一条0到x-1的路存在, 我们再想一条路肯定是先右再下,然后重复进行的,类似于一个楼梯的样子。 二分我们知道了,但是check里面如何判断才能配合二分呢,对于我们check的mid

【ZOJ3940 The 13th Zhejiang Provincial Collegiate Programming ContestE】【脑洞 STL-MAP 复杂度分析 区间运算思想 双指针】M

Modulo Query Time Limit: 2 Seconds      Memory Limit: 65536 KB One day, Peter came across a function which looks like: F(1, X) = X mod A1.F(i, X) = F(i - 1, X) mod Ai, 2 ≤ i ≤ N. Where

The 13th Zhejiang Provincial Collegiate Programming Contest (杂谈)

明天就要和大家一起出发去杭州了。此刻心情是 不安 。 第一次参加如此正式的比赛。 算起来,在CSDN写博客也差不多快一个月了。这一个月也算是有很大的进步吧。 在一个月前,自己还是连STL甚至是一些如strcmp函数都还不知道的菜鸟(虽然现在也是菜鸟。。)。 一个月前自己可能也为自己能写出一些小小的辣鸡程序而洋洋得意。现在看来,颇有一丝井底蛙的感觉。 盗用某人的话:要是我没加ACM,也许还

2019 浙江省赛部分题解(The 16th Zhejiang Provincial Collegiate Programming Contest Sponsored by TuSimple)

签到题 GLucky 7 in the Pocket Time Limit: 1 Second      Memory Limit: 65536 KB BaoBao loves number 7 but hates number 4, so he refers to an integer  as a "lucky integer" if  is divisible by 7 but