数据点6

P3060 [USACO12NOV] Balanced Trees G

@[mrsrz](/user/6813)
by oisdoaiu @ 2021-05-03 11:59:58


这个代码会re(节选自@[Leap_Frog](/user/44805) 的题解输入部分) ```cpp #include<bits/stdc++.h> #define ri register int using namespace std;typedef long long ll; template<typename T>inline void read(T &x) { x=0;char c=getchar(),f=0; for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=1; for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48); if(f) x=-x; }/*}}}*/ const int N = 100005; char a[N]; int n; int main() { read(n);for(int i=2,f;i<=n;i++) read(f);//,adde(i,f),adde(f,i); for(int i=1;i<=n;i++) scanf("%s",a+i),assert(a[i]=='(' or a[i]==')'), a[i]^=41; // return mnd=1e9,init(1,0),getrt(1,0,n),solve(rt),printf("%d\n",rs),0; } ```
by oisdoaiu @ 2021-05-03 12:00:39


我自己的读入assert左右括号也会re(参考我的提交记录)
by oisdoaiu @ 2021-05-03 12:01:08


@[oisdoaiu](/user/56825) fixed
by SSerxhs @ 2021-05-03 12:16:50


|