求卡常&卡空间
  • 板块学术版
  • 楼主ACandAK
  • 当前回复3
  • 已保存回复3
  • 发布时间2024/6/14 11:55
  • 上次更新2024/6/14 16:28:03
查看原帖
求卡常&卡空间
685721
ACandAK楼主2024/6/14 11:55

P3367能不能卡到44ms呢 我的代码

#include<stdio.h>
#include<ctype.h>
#define f(x) while(x^fa[x])x=fa[x]=fa[fa[x]]
char inbuf[8192],*st=inbuf,*en=inbuf,outbuf[262144],*outptr=outbuf;
#define gch() (st==en&&(en=(st=inbuf)+fread(inbuf,1,8192,stdin),st==en)?EOF:*(st++))
#define p(x) (*(outptr++)=(x))
inline int read(){register int x=0;register char ch=gch();for(;!isdigit(ch);ch=
gch());for(;isdigit(ch);ch=gch())x=(x<<1)+(x<<3)+(ch^48);return x;}
int m,op,x,y;
short n,fa[10001];
int main(){n=read();m=read();for(register int i=1;i<=n;++i)fa[i]=i;while(--m>-1){op
=read();x=read();y=read();f(x);f(y);(op^2)?(fa[x]=y):(p((x^y)?78:89)&p(10));}
fwrite(outbuf+1,outptr-outbuf,1,stdout);return 0;}
2024/6/14 11:55
加载中...