今日得分:20+20+70
T1
题目大意:
题解:
然而,我成功地调了一天这个代码,死活跑不过去,随机数据下表现还挺优异。最终要了数据发现跑的次数不对,定睛一看,发现……
原代码:
bool operator <(que x,que y){if(gx[x.l]!=gx[y.l])return dfn1[gx[x.l]]<dfn1[gx[y.l]];return dfn2[gx[x.r]]<dfn2[gx[y.r]];}
改后代码:
bool operator <(que x,que y){if(gx[x.l]!=gx[y.l])return dfn1[gx[x.l]]<dfn1[gx[y.l]];return dfn2[x.r]<dfn2[y.r];}
……
AC代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
using namespace std;
inline int re_ad()
{
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=x*10+(ch^48),ch=getchar();
return x*f;
}
inline int ma(int x,int y){return x>y?x:y;}
inline int mi(int x,int y){return x<y?x:y;}
int T,n,m;
vector<int> g1[51000],g2[51000];
int fa1[51000],fa2[51000],f[51000],ans,r[51000],sc[51000],an[51000];
int dep1[51000],dep2[51000],D,dfn1[51000],dfn2[51000],tot,gx[51000],ann;
bool vis[51000],used1[51000],used2[51000];
struct node{int x,y;}e1[51000],e2[51000];
struct nod{int x,r;}z[111111];int top;
struct que{int l,r;}xw[51000];
bool operator <(que x,que y){if(gx[x.l]!=gx[y.l])return dfn1[gx[x.l]]<dfn1[gx[y.l]];return dfn2[x.r]<dfn2[y.r];}
void dfs1(int x)
{
register int i,sz=g1[x].size(),v;
sc[x]=0;vis[x]=false;dfn1[x]&#