collegiate专题

Nordic Collegiate Programming ContestNCPC 2021

Date:October 9, 2021 Dashboard - 2021-2022 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2021) - Codeforces Problem - C - Codeforces--Customs ControlsProblem - C - Codeforces- 题意:给定一个n个点，m条边

The 2024 International Collegiate Programming Contest in Hubei Province, China

目录 H. Genshin Impact Startup Forbidden III 估计还会补D，I，K H. Genshin Impact Startup Forbidden III 对于一个有鱼的池塘，有周围与自己本身五个关键位置可以捕获当前位位置的鱼。把这些位置存储到 map中。用四进制数 S 表示每块池塘中剩余的鱼的数目，dp[S] 表示达成该状态最少的炸弹数。枚

The 15th Chinese Northeast Collegiate Programming Contest K.CITY 离线单调+并查集连通+优先队列

题意 n个节点，m条边，每条边都有权重，Q次询问，每次询问附带一个正整数x代表，有规模为x的军队，能通过权重>=x的路。如果两个节点能互相到达，则算一个有效对，求针对军队规模为x，有几个有效对。解析很容易的发现每次询问附带的军队规模x具有单调性，x如果越大，答案越小，反之答案越大。那么可以离线存储询问，对询问的规模进行排序，从规模大开始计算，然后越来越小，答案递增。对于一个确定大小为

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$

The 2023 Guangdong Provincial Collegiate Programming Contest

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

International Collegiate Programming Contest, Egyptian Collegiate Programming Contest (ECPC 2018)

International Collegiate Programming Contest, Egyptian Collegiate Programming Contest (ECPC 2018) D. The Millennium Prize Problems 求有公约数x的所有数对之积，那么最大公约数为x的乘积只需要约数有x减掉最大公约数为2x,3x的数对之积。 E. Count Perm

Gym - 101808E Floods ACM ICPC, Damascus University Collegiate Programming Contest(2018)-E

传送门：http://codeforces.com/gym/101808/problem/E E-Floods You probably heard and even saw the heavy rains that flooded the streets of Damascus recently. Shahhoud is wondering if he should go to unive

【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

2020 China Collegiate Programming Contest, Weihai Site 补题

文章目录 C - RencontreG - Caesar Cipher 补题链接 C - Rencontre 题目描述：给出一棵 n n n 个节点的带权树，现在有三组数量分别为 m i m_i mi 的点集，现在从每组中等概率的从中各选一个点（三组相互独立），得到一个三元组 ( a , b , c ) (a,b,c) (a,b,c)，并在树上找一个点 u u u

The 13th Zhejiang Provincial Collegiate Programming Contest （杂谈）

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

Codeforces GYM 100548 I - International Collegiate Routing Contest 2014 ACM Xian Regional Contest

比赛的时候愣是没看懂这一题是啥意思，最后队友写完了觉得有问题也木有submit== 前面说了一大串反转路由表，in short之后就是说取个当前子网集合的补集，全集是整个IPV4地址空间。我当时一直纠结main routing table as small as possible是为何，现在觉得是防止两个子网可以用一个子网代替的case吧，比如11100000.0.0.0/4+11110000.0

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