目录
第一场:
J.Easy_Integration
结论是(n!)^2 / (2n+1)!。听说是用Wallis积分算的,我还是找规律吧。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5,INF=0x3f3f3f3f,MOD=998244353;
int T,n,m;
int qpower(int x,int p)
{
int ret=1,base=x;
while(p)
{
if (p&1==1) ret=(1ll*ret*base)%MOD;
base=(1ll*base*base)%MOD;
p=p>>1;
}
return ret;
}
int ans[N];
int main()
{
ans[1]=6;
for (int i=2;i<=1000000;i++)
{
ans[i]=(1ll*ans[i-1]*2*(i*2+1))%MOD;
ans[i]=(1ll*ans[i]*qpower(i,MOD-2))%MOD;
}
int x;
while(scanf("%d",&x)!=-1) printf("%d\n",qpower(ans[x],MOD-2));
return 0;
}
I.1_or_2
把每个顶点拆成d[i]个点,每条边(u,v)拆成两个点把这两个点连边,并与对应的点连边,跑一次一般图最大匹配,判断是否存在完美匹配。
存在完美匹配时,某条边拆成的两个点要么互相匹配,要么各自与对应的顶点匹配,分别对应了用和不用这条边的两种情况。且每个顶点的度数都为d[i]。
一般图最大匹配用的是带花树的板子,存个档。
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAX_N=300+5;
int n,m;
int d[MAX_N];
int N;
bool Graph[MAX_N][MAX_N];
int Match[MAX_N];
bool InQueue[MAX_N],InPath[MAX_N],InBlossom[MAX_N];
int Head,Tail;
int Queue[MAX_N];
int Start,Finish;
int NewBase;
int Father[MAX_N],Base[MAX_N];
int Count;
void CreatGraph(){
int u,v;
vector<int>V[MAX_N];
memset(Graph,false,sizeof(Graph));
int tot=1;
for (int i=1;i<=n;i++)
{
scanf("%d",&d[i]);
for (int j=1;j<=d[i];j++) V[i].push_back(tot++);
}
for (int i=1;i<=m;i++)
{
scanf("%d%d",&u,&v);
int x=tot++,y=tot++;
for (int j=0;j<d[u];j++) Graph[V[u][j]][x]=Graph[x][V[u][j]]=1;
for (int j=0;j<d[v];j++) Graph[V[v][j]][y]=Graph[y][V[v][j]]=1;
Graph[x][y]=Graph[y][x]=1;
}
N=tot-1;
}
void Push(int u){
Queue[Tail]=u;
Tail++;
InQueue[u]=true;
}
int Pop(){
int res=Queue[Head];
Head++;
return res;
}
int FindCommonAncestor(int u,int v){
memset(InPath,false,sizeof(InPath));
while(1){
u=Base[u];
InPath[u]=1;
if(u==Start)break;
u=Father[Match[u]];
}
while(1){
v=Base[v];
if(InPath[v])break;
v=Father[Match[v]];
}
return v;
}
void ResetTrace(int u){
int v;
while(Base[u]!=NewBase){
v=Match[u];
InBlossom[Base[u]]=InBlossom[Base[v]]=1;
u=Father[v];
if(Base[u]!=NewBase)Father[u]=v;
}
}
void BloosomContract(int u,int v){
NewBase=FindCommonAncestor(u,v);
memset(InBlossom,false,sizeof(InBlossom));
ResetTrace(u);
ResetTrace(v);
if(Base[u]!=NewBase)Father[u]=v;
if(Base[v]!=NewBase)Father[v]=u;
for(int tu=1;tu<=N;tu++){
if(InBlossom[Base[tu]]){
Base[tu]=NewBase;
if(!InQueue[tu])Push(tu);
}
}
}
void FindAugmentingPath(){
memset(InQueue,false,sizeof(InQueue));
memset(Father,0,sizeof(Father));
for(int i=1;i<=N;i++){
Base[i]=i;
}
Head=Tail=1;
Push(Start);
Finish=0;
while(Head<Tail){
int u=Pop();
for(int v=1;v<=N;v++){
if(Graph[u][v]&&(Base[u]!=Base[v])&&(Match[u]!=v)){
if((v==Start)||((Match[v]>0)&&Father[Match[v]]>0))BloosomContract(u,v);
else if(Father[v]==0){
Father[v]=u;
if(Match[v]>0)Push(Match[v]);
else{
Finish=v;
return;
}
}
}
}
}
}
void AugmentPath(){
int u,v,w;
u=Finish;
while(u>0){
v=Father[u];
w=Match[v];
Match[v]=u;
Match[u]=v;
u=w;
}
}
void Edmonds(){
memset(Match,0,sizeof(Match));
for(int u=1;u<=N;u++){
if(Match[u]==0){
Start=u;
FindAugmentingPath();
if(Finish>0)AugmentPath();
}
}
}
void PrintMatch(){
Count=0;
for(int u=1;u<=N;u++){
if(Match[u]>0)Count++;
}
if(Count==N)printf("Yes\n");
else printf("No\n");
}
int main(){
while(scanf("%d%d",&n,&m)==2){
CreatGraph();
Edmonds();
PrintMatch();
}
}
H.Minimum-cost_Flow
原题意是求总流量为1,每条边容量为 u v \frac{u}{v} vu时的最小花费c。
将问题转化成总流量为 v u \frac{v}{u} uv,每条边容量为1时的最小化花费c’。且有 c = c ′ ∗ u v c=c'*\frac{u}{v} c=c′∗vu。
由于每条边容量相同且为1,可知每跑一次spfa之后如果找到一条增广路,则新增的流量一定为1,且整数之间的流量与花费的增长是线性的。因此先计算出流量为整数i时的花费cost[i],然后将总流量 v u \frac{v}{u} uv拆成整数部分和分数部分来计算。
通过增广路的个数算出最大流量,若最大流量小于总流量 v u \frac{v}{u} uv则输出NaN。
#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<" : "<<x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN=2e3+5;
int top,n,m,q,x,y,f;
ll u,v;
ll cost[MAXN];
bool vis[MAXN];
int s,t,dis[MAXN],pre[MAXN],last[MAXN],flow[MAXN],maxflow,mincost;
struct Edge{
int to,next,flow,dis;
}edge[MAXN];
int head[MAXN],num_edge;
queue <int> q_SPFA;
void add_edge(int from,int to,int flow,int dis)
{
edge[++num_edge].next=head[from];
edge[num_edge].to=to;
edge[num_edge].flow=flow;
edge[num_edge].dis=dis;
head[from]=num_edge;
}
bool spfa(int s,int t)
{
memset(dis,0x7f,sizeof(dis));
memset(flow,0x7f,sizeof(flow));
memset(vis,0,sizeof(vis));
q_SPFA.push(s); vis[s]=1; dis[s]=0; pre[t]=-1;
while (!q_SPFA.empty())
{
int now=q_SPFA.front();
q_SPFA.pop();
vis[now]=0;
for (int i=head[now]; i!=-1; i=edge[i].next)
{
if (edge[i].flow>0 && dis[edge[i].to]>dis[now]+edge[i].dis)
{
dis[edge[i].to]=dis[now]+edge[i].dis;
pre[edge[i].to]=now;
last[edge[i].to]=i;
flow[edge[i].to]=min(flow[now],edge[i].flow);
if (!vis[edge[i].to])
{
vis[edge[i].to]=1;
q_SPFA.push(edge[i].to);
}
}
}
}
return pre[t]!=-1;
}
void MCMF()
{
while (spfa(s,t))
{
int now=t;
maxflow+=flow[t];
mincost+=flow[t]*dis[t];
cost[++top]=mincost;
while (now!=s)
{
edge[last[now]].flow-=flow[t];
edge[last[now]^1].flow+=flow[t];
now=pre[now];
}
}
}
int main()
{
while(scanf("%d%d",&n,&m)!=-1)
{
memset(head,-1,sizeof(head)); num_edge=-1;
s=1,t=n;
for (int i=1; i<=m; i++)
{
scanf("%d%d%d",&x,&y,&f);
add_edge(x,y,1,f); add_edge(y,x,0,-f);
}
memset(cost,0,sizeof(cost));
top=0;
mincost=0;
MCMF();
scanf("%d",&q);
for (int i=1;i<=q;i++)
{
scanf("%lld%lld",&u,&v);
if (u*top<v)
printf("NaN\n");
else
{
ll a=v/u;
ll b=v%u;
ll ans=cost[a]*u+(cost[a+1]-cost[a])*b;
ll k=__gcd(ans,v);
ans/=k,v/=k;
printf("%lld/%lld\n",ans,v);
}
}
}
return 0;
}
A.B-Suffix_Array
题解意思是根据s计算出一个数组C,满足 Ci=min{j>i && s[j]==s[i]}{j-i},对于最后的a、b设为n,并在C数组最后加一个n+1,然后对C跑一下后缀数组,答案是按顺序输出sa[i]。
然而没看懂结论也不会后缀数组。贴代码存板子。
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;
int n;
char S[MAXN];
int s[MAXN];
int last[2];
//char s[MAXN];
struct SA {
int sa[MAXN], ra[MAXN], height[MAXN];
int t1[MAXN], t2[MAXN], c[MAXN];
void build(int *str, int n, int m) {
str[n] = 0;
n++;
int i, j, p, *x = t1, *y = t2;
for (i = 0; i < m; i++) c[i] = 0;
for (i = 0; i < n; i++) c[x[i] = str[i]]++;
for (i = 1; i < m; i++) c[i] += c[i - 1];
for (i = n - 1; i >= 0; i--) sa[--c[x[i]]] = i;
for (j = 1; j <= n; j <<= 1) {
p = 0;
for (i = n - j; i < n; i++) y[p++] = i;
for (i = 0; i < n; i++) if (sa[i] >= j) y[p++] = sa[i] - j;
for (i = 0; i < m; i++) c[i] = 0;
for (i = 0; i < n; i++) c[x[y[i]]]++;
for (i = 1; i < m; i++) c[i] += c[i - 1];
for (i = n - 1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
swap(x, y);
p = 1;
x[sa[0]] = 0;
for (i = 1; i < n; i++)
x[sa[i]] = (y[sa[i - 1]] == y[sa[i]] && y[sa[i - 1] + j] == y[sa[i] + j]) ? p - 1 : p++;
if (p >= n) break;
m = p;
}
n--;
for (int i = 0; i <= n; i++) ra[sa[i]] = i;
for (int i = 0, j = 0, k = 0; i <= n; i++) {
if (k) k--;
j = sa[ra[i] - 1];
while (str[i + k] == str[j + k]) k++;
height[ra[i]] = k;
}
st_init(height, n);
}
int lg[MAXN], table[23][MAXN];
void st_init(int *arr, int n) {
if (!lg[0]) {
lg[0] = -1;
for (int i = 1; i < MAXN; i++)
lg[i] = lg[i / 2] + 1;
}
for (int i = 1; i <= n; ++i)
table[0][i] = arr[i];
for (int i = 1; i <= lg[n]; ++i)
for (int j = 1; j <= n; ++j)
if (j + (1 << i) - 1 <= n)
table[i][j] = min(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);
}
int lcp(int l, int r) {
l = ra[l], r = ra[r];
if (l > r) swap(l, r);
++l;
int t = lg[r - l + 1];
return min(table[t][l], table[t][r - (1 << t) + 1]);
}
} sa;
/*bool cmp(int i, int j) {
if (dis[i] != dis[j]) return dis[i] < dis[j];
if (i + dis[i] > n) return true;
if (j + dis[j] > n) return false;
int lcp = sa.lcp(i + dis[i], j + dis[j]);
return a[i + lcp + dis[i]] < a[j + lcp + dis[j]];
}*/
int main(){
while(scanf("%d",&n)!=-1)
{
scanf("%s",S);
last[0]=last[1]=0;
s[n]=n+1;
for (int i=n-1;i>=0;i--)
{
int now= S[i]=='a' ? 0 : 1;
if (last[now]==0) s[i]=n;
else s[i]=(last[now]-i);
last[now]=i;
}
n++;
sa.build(s,n,n+2);
for(int i = n-1;i >=1 ;i--)
printf("%d ",sa.sa[i]+1);
printf("\n");
}
return 0;
}
第二场
F.Fake_Maxpooling
两次单调队列维护k*k区间的最大值,滑动窗口问题。
#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<":"<<x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=5000+5;
int T,n,m,k;
int a[N][N],ro[N][N];
int q[N],l,r;
int now;
ll tot;
int main()
{
cin>>n>>m>>k;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
if (!a[i][j]){
a[i][j]=i*j/__gcd(i,j);
for (int k=2;k*i<=n && k*j<=n;k++)
a[i*k][j*k]=a[i][j]*k;
}
for (int i=1;i<=n;i++)
{
l=1,r=0;
for (int j=1;j<=m;j++)
{
while(l<=r && a[i][j]>=a[i][q[r]]) r--;
q[++r]=j;
if (j>=k) {
while(q[l]<=j-k) l++;
ro[i][j]=a[i][q[l]];
}
}
}
for (int j=k;j<=m;j++)
{
l=1,r=0;
for (int i=1;i<=n;i++)
{
while(l<=r && ro[i][j]>=ro[q[r]][j]) r--;
q[++r]=i;
if (i>=k) {
while(q[l]<=i-k) l++;
tot+=ro[q[l]][j];
}
}
}
printf("%lld\n",tot);
return 0;
}
C.Cover_the_Tree
选择度数>=2的点为根跑一次dfs,按顺序记录叶子结点(dfs序),叶子结点记为 l 1 , l 2 , . . . l s l_1,l_2,...l_s l1,l2,...ls,若s为偶数,则连接 ( l 1 , l s 2 + 1 ) , ( l 2 , l s 2 + 2 ) , . . . , ( l s 2 , l s ) (l_1,l_{\frac{s}{2}+1}),(l_2,l_{\frac{s}{2}+2}),...,(l_{\frac{s}{2}},l_s) (l1,l2s+1),(l2,l2s+2),...,(l2s,ls)。若s为奇数,则将正中间的点与根相连。
正确性证明:考虑任意一条边,若这条边的儿子节点中,叶子结点的区间是[L,R],
若R< s 2 \frac{s}{2} 2s,则能被 ( R , R + s 2 ) (R,R+\frac{s}{2}) (R,R+2s)覆盖
若L> s 2 \frac{s}{2} 2s,则能被 ( L − s 2 , L ) (L-\frac{s}{2},L) (L−2s,L)覆盖
若都不满足,则 s 2 \frac{s}{2} 2s在区间[L,R]中,若L>1,则该边被 ( l 1 , l s 2 + 1 ) (l_1,l_{\frac{s}{2}+1}) (l1,l2s+1)覆盖,若R<s,则该边被 ( l s 2 , l s ) (l_{\frac{s}{2}},l_s) (l2s,ls)覆盖,且必有一条件是满足的(因为根的度数>=2,所以不存在L=1且R=s的边)。
#include<bits/stdc++.h>
#define REP(i,x,y) for (auto i=(x);i<=(y);++i)
#define DEP(i,x,y) for (auto i=(x);i<=(y);++i)
#define debug(x) cerr<<#x<<":"<<x<<endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=2e5+5;
vector<int>G[N];
vector<int>ans;
int n,m,u,v,root;
void dfs(int x,int fa)
{
if (G[x].size()==1)
{
ans.push_back(x);
return;
}
for (auto to:G[x])
{
if (to!=fa)
dfs(to,x);
}
}
int main()
{
cin>>n;
if (n==2)
{
scanf("%d %d",&u,&v);
printf("1\n%d %d",u,v);
return 0;
}
REP(i,2,n) {
scanf("%d %d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
if (G[u].size()>=2 &&!root) root=u;
if (G[v].size()>=2 &&!root) root=v;
}
dfs(root,-1);
int l=0,r=(ans.size()+1)/2;
printf("%d\n",(ans.size()+1)/2);
REP(i,1,ans.size()/2) {
printf("%d %d\n",ans[l],ans[r]);
l++,r++;
}
if (ans.size()%2==1) printf("%d %d\n",root,ans[ans.size()/2]);
return 0;
}
B.Boundary
计算出每个点和原点的中垂线,两两枚举中垂线的交点,用map记录交点的重合情况。
将交点作为map键值需要重载小于号(<),判断大小关系时需要计算绝对值与eps的大小,若小于eps则视为相等,返回0(实际上任何有关浮点数的比较都必须这样操作)。
顺便备一下计算几何的板子,从求两点直线、中垂线和直线交点这些简单的开始吧。
#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<" : "<<x<<endl;
using namespace std;
const int MAXN=2e3+5;
const double eps=1e-6;
class Point {
public:
double x,y;
Point(double a=0,double b=0):x(a),y(b){}
};
class Line {
public:
bool ifk;
double k,b;
//求过两点的直线
void mkline (Point A,Point B) {
ifk=true;k=b=0;
if (A.x==B.x) {
ifk=0;
b=A.x;
} else {
if (A.y==B.y) {
k=0;
b=(A.x+B.x)/2;
} else {
k=(B.y-A.y)/(B.x-A.x);
b=A.y-k*A.x;
}
}
}
//求两点中垂线
void mkbisector (Point A,Point B) {
ifk=true;k=b=0;
if (A.x==B.x) {
k=0;
b=(A.y+B.y)/2;
} else if (A.y==B.y) {
ifk=0;
b=(A.x+B.x)/2;
} else {
k=-1/(B.y-A.y)*(B.x-A.x);
b=(A.y+B.y)/2-k*(A.x+B.x)/2;
}
}
bool operator == (Line &T) {
return (ifk==T.ifk) && fabs(k-T.k)<eps && fabs(b-T.b)<eps;
}
};
//求两直线交点
struct Intersection {
bool parallel,coincide;
double x,y;
bool operator < (const Intersection &T) const {
if (fabs(x-T.x)>eps) return x<T.x;
else if (fabs(y-T.y)>eps) return y<T.y;
else return 0;
}
};
Intersection getIntersection (Line A,Line B) {
Intersection ans;
ans.parallel=ans.coincide=0;
ans.x=ans.y=0;
if (A==B) {
ans.coincide=1;
return ans;
}
if (!A.ifk && !B.ifk || A.ifk && B.ifk && fabs(A.k-B.k)<eps) {
ans.parallel=1;
return ans;
}
if (!A.ifk && B.ifk) return getIntersection(B,A);
if (A.ifk && !B.ifk) {
ans.x=B.b;
ans.y=A.k*ans.x+A.b;
} else {
ans.x=(B.b-A.b)/(A.k-B.k);
ans.y=A.k*ans.x+A.b;
}
return ans;
}
Point p[MAXN];
Line l[MAXN];
int n,m,ans;
map<Intersection,int>CNT;
int main()
{
cin>>n;
Point ori(0,0);
for (int i=1;i<=n;i++)
{
cin>>p[i].x>>p[i].y;
l[i].mkbisector(ori,p[i]);
}
ans=1;
for (int i=1;i<=n-1;i++)
{
CNT.clear();
for (int j=i+1;j<=n;j++)
{
Intersection inter=getIntersection(l[i],l[j]);
if (!inter.coincide && !inter.parallel) CNT[inter]++;
}
for (auto it:CNT) ans=max(ans,it.second+1);
}
printf("%d\n",ans);
return 0;
}
J.Just_Shuffle
对于长度为len的环,每置换len次都会回到初始状态,因此只需要考虑t=k%len
已知{1,2,3,…,n}经过P置换k次为A,即 P t = A P^t=A Pt=A,根据题意已知A,要求出P。
令 z z z使得 ( z ∗ k ) % l e n = 1 (z*k)\%len=1 (z∗k)%len=1,可知 A z = P t ∗ z = P ( z ∗ k ) % l e n = P A^z=P^{t*z}=P^{(z*k)\%len}=P Az=Pt∗z=P(z∗k)%len=P,因此P就是A自身置换z次后的结果,且由 ( z ∗ k ) % l e n = 1 (z*k)\%len=1 (z∗k)%len=1可知z是k在mod len意义下的逆元,对于一个环,每置换一次后的结果是整体旋转一位,因此只要通过求逆元的方法求出z,并将该环整体旋转z位就能得到答案。
环与环之间是独立的,因此只要分别处理序列中每个环即可。
因为这里模数不一定是质数所以不能用费马小定理快速幂求逆元。朴素的O(n)求法和扩欧应该都可以。
#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<" : "<<x<<endl;
using namespace std;
typedef long long ll;
const int N=1e5+5;
int a[N];
int ans[N];
int n,m,k;
int main()
{
cin>>n>>k;
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
for (int i=1;i<=n;i++)
{
if (!ans[i])
{
vector<int>G;
ll now=i,cnt=0;
G.push_back(now);
now=a[now];
while(now!=i)
{
G.push_back(now);
now=a[now];
}
int sz=G.size();
if (sz==1) { ans[i]=a[i];continue; }
ll inv;
for (int i=1;i<=sz;i++)
{
if (1ll*i*k%sz==1)
{
inv=i;break;
}
}
for (int j=0;j<sz;j++)
ans[G[j]]=G[(j+inv)%sz];
}
}
for (int i=1;i<=n;i++) printf("%d ",ans[i]);
return 0;
}