满月照亮的路

#pragma comment(linker, "/STACK:102400000,102400000") #include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define lrt ...

#include &lt;stdio.h&gt; #include &lt;ctype.h&gt; //快速读 inline int read() { int num=0, w=0; char ch=0; while (!isdigit(ch)) { w|=ch=='-'; ch = getchar(); } while ...

不加优化的版本： const double pi=acos(-1.0); struct cp{///复数模板 double a,b; cp operator +(const cp &amp;o)const {return (cp){a+o.a,b+o.b};} cp operator -(const cp &amp;o)const {return (cp){a-o.a,...

静态版 #include&lt;bits/stdc++.h&gt; using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define...

#include&lt;iostream&gt; #include&lt;ostream&gt; #include&lt;stdlib.h&gt; #include&lt;cmath&gt; #include&lt;cstring&gt; #include&lt;vector&gt; #include&lt;stack&gt; #include&lt;stdio.h&gt; #i

EK算法 #include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long long #define lrt int l,int r,int rt #define ...

题目链接:https://www.luogu.org/problemnew/show/P3369 #include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long l...