A题:
解法:简单的推公式题目。 根据简单的计算,可以算出抛物线与直线的方程,抛物线部分根据积分即可求出面积,直线直接用三角形求面积。
#include <iostream>
#include <cstdio>
#include <cmath>
#define eps 1e-8
using namespace std;
int main()
{
int t;
scanf("%d",&t);
double tx,p,a;
while(t--)
{
scanf("%lf%lf%lf",&p,&tx,&a);
double tmp=tan(a+0.0);
double s;
int res=1;
s=(tmp*p)/(tx*tx-2.0*tx*p);
double flag=tmp/(-2.0*a);
double ans=(s/3.0)*(tx*tx*tx)+(tmp/2.0)*(tx*tx);
double w=p-tx;
double h=s*(tx*tx)+tmp*tx;
ans+=(w*h)/2.0;
printf("%.3f\n",ans);
}
return 0;
}
B题:
这道题目是个求期望的题目,我们可以根据期望DP。。算出下一步的期望是d[i]=0.5*d[i+1]+0.5*d[i-1]+1.0,然后根据迭代法就可以求出每个的值,但是因为收敛速度太慢了,于是我们打表发现了一个规律。d[0]=0 ,d[1]=n-1 d[2]=n-1+n-3....于是即可求解。
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=11111;
double d[maxn];
double solve(int a,int b)
{
d[0]=0;
int j=1;
for(int i=1;j<=b;i+=2,j++)
{
d[j]=d[j-1]+a-i;
}
return d[b];
}
int main()
{
int t;
scanf("%d",&t);
memset(d,0,sizeof(d));
int n,x;
while(t--)
{
scanf("%d%d",&n,&x);
printf("%.4f\n",solve(n,x));
}
return 0;
}
C题:
解法:这题是个DP,定义状态,dp[i][a][b][c] 为第i个人选第C 个颜色,并且A用了a个,B用了b个的方案数。然后我们很容易的可以得出递归方程,因为这是一个环,所以第N个要和第1个颜色不同,因为只有三种颜色,我们可以直接枚举三种情况DP即可。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define mod 1000000007
using namespace std;
const int maxn=55;
int dp[maxn][maxn][maxn][5];
char ch[maxn];
int a,b,c;
int main()
{
freopen("in.txt","r",stdin);
int t;
scanf("%d",&t);
while(t--)
{
scanf("%s",ch);
a=0;
b=0;
c=0;
int len=strlen(ch);
for(int i=0;i<len;i++)
{
if(ch[i]=='A')
{
a++;
}
else if(ch[i]=='B')
{
b++;
}
else
{
c++;
}
}
memset(dp,0,sizeof(dp));
dp[1][1][0][0]=1;
long long ans=0;
for(int i=2;i<=len;i++)
for(int j=1;j<=a;j++)
for(int k=0;k<=b;k++)
{
dp[i][j][k][0]+=(dp[i-1][j-1][k][1]+dp[i-1][j-1][k][2])%mod;
dp[i][j][k][0]%=mod;
dp[i][j][k][1]+=(dp[i-1][j][k-1][0]+dp[i-1][j][k-1][2])%mod;
dp[i][j][k][1]%=mod;
dp[i][j][k][2]+=(dp[i-1][j][k][0]+dp[i-1][j][k][1])%mod;
dp[i][j][k][2]%=mod;
}
ans+=(dp[len][a][b][1]+dp[len][a][b][2]);
ans%=mod;
memset(dp,0,sizeof(dp));
dp[1][0][1][1]=1;
for(int i=2;i<=len;i++)
for(int j=0;j<=a;j++)
for(int k=1;k<=b;k++)
{
dp[i][j][k][0]+=(dp[i-1][j-1][k][1]+dp[i-1][j-1][k][2])%mod;
dp[i][j][k][0]%=mod;
dp[i][j][k][1]+=(dp[i-1][j][k-1][0]+dp[i-1][j][k-1][2])%mod;
dp[i][j][k][1]%=mod;
dp[i][j][k][2]+=(dp[i-1][j][k][0]+dp[i-1][j][k][1])%mod;
dp[i][j][k][2]%=mod;
}
ans+=(dp[len][a][b][0]+dp[len][a][b][2]);
ans%=mod;
memset(dp,0,sizeof(dp));
dp[1][0][0][2]=1;
for(int i=2;i<=len;i++)
for(int j=0;j<=a;j++)
for(int k=0;k<=b;k++)
{
dp[i][j][k][0]+=(dp[i-1][j-1][k][1]+dp[i-1][j-1][k][2])%mod;
dp[i][j][k][0]%=mod;
dp[i][j][k][1]+=(dp[i-1][j][k-1][0]+dp[i-1][j][k-1][2])%mod;
dp[i][j][k][1]%=mod;
dp[i][j][k][2]+=(dp[i-1][j][k][0]+dp[i-1][j][k][1])%mod;
dp[i][j][k][2]%=mod; }
ans+=(dp[len][a][b][1]+dp[len][a][b][0]);
ans%=mod;
printf("%d\n",ans);
}
return 0;
}
D题:这道题目是道线段树,和我之前在我们学校省选出的一道题目的模型是一样的,都是带有清0功能的线段树,做法是维护两个延迟标记,注意标记的下放顺序,是一道比较基础的线段树题目。
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
const int maxn=111111;
long long sum[maxn<<2];
long long cot[maxn<<2];
int zero[maxn<<2];
struct node
{
int t;
int l;
int r;
};
node ll[maxn];
void init()
{
memset(zero,0,sizeof(zero));
memset(cot,0,sizeof(cot));
}
void pushup(int rt)
{
sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
bool cmp(const node &a,const node &b)
{
return a.t<b.t;
}
void pushdown(int rt,int m)
{
if(zero[rt])
{
zero[rt<<1]=zero[rt<<1|1]=zero[rt];
sum[rt<<1]=0;
sum[rt<<1|1]=0;
cot[rt<<1|1]=0;
cot[rt<<1]=0;
zero[rt]=0;
}
if(cot[rt])
{
cot[rt<<1]+=cot[rt];
cot[rt<<1|1]+=cot[rt];
sum[rt<<1]+=(m-(m>>1))*cot[rt];
sum[rt<<1|1]+=(m>>1)*cot[rt];
cot[rt]=0;
}
}
void build(int l,int r,int rt)
{
if(l==r)
{
sum[rt]=0;
return;
}
int m=(l+r)>>1;
build(lson);
build(rson);
pushup(rt);
}
void update(int L,int R,int c,int l,int r,int rt)
{
if(L<=l&&R>=r)
{
cot[rt]+=c;
sum[rt]+=(r-l+1)*c;
return ;
}
int m=(l+r)>>1;
pushdown(rt,r-l+1);
if(L<=m)
{
update(L,R,c,lson);
}
if(R>m)
{
update(L,R,c,rson);
}
pushup(rt);
}
long long query(int L,int R,int l,int r,int rt)
{
if(L<=l&&R>=r)
{
int res=sum[rt];
sum[rt]=0;
cot[rt]=0;
zero[rt]=1;
return res;
}
pushdown(rt,r-l+1);
int m=(l+r)>>1;
long long ans=0;
if(L<=m) ans+=query(L,R,lson);
if(R>m) ans+=query(L,R,rson);
pushup(rt);
return ans;
}
int main()
{
// freopen("in.txt","r",stdin);
int n,m;
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
init();
build(1,n,1);
long long res=0;
int now;
now=0;
for(int i=0;i<m;i++)
{
scanf("%d%d%d",&ll[i].t,&ll[i].l,&ll[i].r);
}
sort(ll,ll+m,cmp);
for(int i=0;i<m;i++)
{
update(1,n,ll[i].t-now,1,n,1);
now=ll[i].t;
res+=query(ll[i].l,ll[i].r,1,n,1);
}
printf("%lld\n",res);
}
return 0;
}
E题:水题,直接求阶乘就行了。
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
// freopen("in.txt","r",stdin);
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
if(n==0)
{
printf("1\n");
continue;
}
int sum=1;
for(int i=1;i<=n;i++)
{
sum*=i;
}
printf("%d\n",sum);
}
return 0;
}
F题:这是到LCA的简化版,意思是求两个节点在完全二叉树上的最短路径,每条边的长度为1.
解法:从下向上寻找他们的父亲即可。
#include <iostream>
#include <cstdio>
using namespace std;
int solve(int a,int b)
{
int maxx=max(a,b);
int minn=min(a,b);
int cnt=0;
while(1)
{
while(maxx>minn)
{
maxx/=2;
cnt++;
}
if(maxx==minn)
{
break;
}
for(int i=1;;i++)
{
if(maxx==minn)
{
break;
}
if(i&1)
{
minn/=2;
}
else
{
maxx/=2;
}
cnt++;
}
if(maxx==minn)
{
break;
}
}
return cnt;
}
int main()
{
// freopen("in.txt","r",stdin);
int n;
while(~scanf("%d",&n))
{
while(n--)
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",solve(a,b));
}
}
return 0;
}
G题:这道题实际上是求斯特林数,而斯特林数可以用DP求解,所以我们定义 dp[a][b]为a个人占b个桌子的方案数,注意初始化条件即可。
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=111;
long long dp[maxn][maxn];
long long s[maxn];
const long long mod=1e9+7;
void init()
{
s[0]=1;
for(int i=1;i<=100;i++)
{
s[i]=(s[i-1]*i)%mod;
}
}
int main()
{
int n,m;
init();
while(~scanf("%d%d",&n,&m))
{
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
{
dp[i][1]=1;
}
dp[1][1]=1;
for(int i=2;i<=n;i++)
for(int j=1;j<=m;j++)
{
dp[i][j]=(dp[i-1][j-1]+j*dp[i-1][j])%mod;
}
printf("%lld\n",(dp[n][m]*s[m])%mod);
}
return 0;
}
H题:
这是个计算几何的题目,但是数据似乎很水,没有多点共线的情况,所以被我用组合数C(n,2)的方法给水过去了。正确做法应该是枚举两个点的连线,然后将它偏移一个距离,如果它不穿过任何一个点,即为一个解,因为有可能枚举的直线相同,于是可以用hash的方法去检查是否当前直线已经出现过了,未出现过,答案加1。最后因为可以两边互换,答案乘以2输出即可。
我的代码:
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
freopen("in.txt","r",stdin);
int n;
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
{
int a,b;
scanf("%d%d",&a,&b);
}
printf("%d\n",n*(n-1));
}
return 0;
}
标程:
/** Micro Mezz Macro Flation -- Overheated Economy ., Last Update: Nov. 7th 2013 **/ //{
/** Header .. **/ //{
#pragma comment(linker, "/STACK:36777216")
//#pragma GCC optimize ("O2")
#define LOCAL
//#include "testlib.h"
#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
//#include <tr1/unordered_set>
//#include <tr1/unordered_map>
//#include <array>
using namespace std;
#define REP(i, n) for (int i=0;i<n;++i)
#define FOR(i, a, b) for (int i=a;i<b;++i)
#define DWN(i, b, a) for (int i=b-1;i>=a;--i)
#define REP_1(i, n) for (int i=1;i<=n;++i)
#define FOR_1(i, a, b) for (int i=a;i<=b;++i)
#define DWN_1(i, b, a) for (int i=b;i>=a;--i)
#define REP_C(i, n) for (int n____=n,i=0;i<n____;++i)
#define FOR_C(i, a, b) for (int b____=b,i=a;i<b____;++i)
#define DWN_C(i, b, a) for (int a____=a,i=b-1;i>=a____;--i)
#define REP_N(i, n) for (i=0;i<n;++i)
#define FOR_N(i, a, b) for (i=a;i<b;++i)
#define DWN_N(i, b, a) for (i=b-1;i>=a;--i)
#define REP_1_C(i, n) for (int n____=n,i=1;i<=n____;++i)
#define FOR_1_C(i, a, b) for (int b____=b,i=a;i<=b____;++i)
#define DWN_1_C(i, b, a) for (int a____=a,i=b;i>=a____;--i)
#define REP_1_N(i, n) for (i=1;i<=n;++i)
#define FOR_1_N(i, a, b) for (i=a;i<=b;++i)
#define DWN_1_N(i, b, a) for (i=b;i>=a;--i)
#define REP_C_N(i, n) for (int n____=(i=0,n);i<n____;++i)
#define FOR_C_N(i, a, b) for (int b____=(i=0,b);i<b____;++i)
#define DWN_C_N(i, b, a) for (int a____=(i=b-1,a);i>=a____;--i)
#define REP_1_C_N(i, n) for (int n____=(i=1,n);i<=n____;++i)
#define FOR_1_C_N(i, a, b) for (int b____=(i=1,b);i<=b____;++i)
#define DWN_1_C_N(i, b, a) for (int a____=(i=b,a);i>=a____;--i)
#define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it)
#define REP_S(i, str) for (char*i=str;*i;++i)
#define REP_L(i, hd, suc) for (int i=hd;i;i=suc[i])
#define REP_G(i, u) REP_L(i,hd[u],suc)
#define REP_SS(x, s) for (int x=s;x;x=(x-1)&s)
#define DO(n) for ( int ____n = n; ____n-->0; )
#define REP_2(i, j, n, m) REP(i, n) REP(j, m)
#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)
#define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l)
#define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l)
#define REP_4(i, j, k, ii, n, m, l, nn) REP(i, n) REP(j, m) REP(k, l) REP(ii, nn)
#define REP_4_1(i, j, k, ii, n, m, l, nn) REP_1(i, n) REP_1(j, m) REP_1(k, l) REP_1(ii, nn)
#define ALL(A) A.begin(), A.end()
#define LLA(A) A.rbegin(), A.rend()
#define CPY(A, B) memcpy(A, B, sizeof(A))
#define INS(A, P, B) A.insert(A.begin() + P, B)
#define ERS(A, P) A.erase(A.begin() + P)
#define LBD(A, x) (lower_bound(ALL(A), x) - A.begin())
#define UBD(A, x) (lower_bound(ALL(A), x) - A.begin())
#define CTN(T, x) (T.find(x) != T.end())
#define SZ(A) int((A).size())
#define PB push_back
#define MP(A, B) make_pair(A, B)
#define PTT pair<T, T>
#define Ts *this
#define rTs return Ts
#define fi first
#define se second
#define re real()
#define im imag()
#define Rush for(int ____T=RD(); ____T--;)
#define Display(A, n, m) { \
REP(i, n){ \
REP(j, m-1) cout << A[i][j] << " "; \
cout << A[i][m-1] << endl; \
} \
}
#define Display_1(A, n, m) { \
REP_1(i, n){ \
REP_1(j, m-1) cout << A[i][j] << " "; \
cout << A[i][m] << endl; \
} \
}
typedef long long LL;
//typedef long double DB;
typedef double DB;
typedef unsigned uint;
typedef unsigned long long uLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<string> VS;
typedef vector<LL> VL;
typedef vector<DB> VF;
typedef set<int> SI;
typedef set<string> SS;
typedef map<int, int> MII;
typedef map<string, int> MSI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<VII> VVII;
template<class T> inline T& RD(T &);
template<class T> inline void OT(const T &);
//inline int RD(){int x; return RD(x);}
inline LL RD(){LL x; return RD(x);}
inline DB& RF(DB &);
inline DB RF(){DB x; return RF(x);}
inline char* RS(char *s);
inline char& RC(char &c);
inline char RC();
inline char& RC(char &c){scanf(" %c", &c); return c;}
inline char RC(){char c; return RC(c);}
//inline char& RC(char &c){c = getchar(); return c;}
//inline char RC(){return getchar();}
template<class T> inline T& RDD(T &);
inline LL RDD(){LL x; return RDD(x);}
template<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;}
template<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;}
template<class T0, class T1, class T2, class T3> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3); return x0;}
template<class T0, class T1, class T2, class T3, class T4> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4); return x0;}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5); return x0;}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6); return x0;}
template<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);}
template<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);}
template<class T0, class T1, class T2, class T3> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}
template<class T0, class T1, class T2, class T3, class T4> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5, const T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}
inline char& RC(char &a, char &b){RC(a), RC(b); return a;}
inline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;}
inline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;}
inline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;}
inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f); return a;}
inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f, char &g){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f), RC(g); return a;}
inline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;}
inline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f, DB &g){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f), RF(g); return a;}
inline void RS(char *s1, char *s2){RS(s1), RS(s2);}
inline void RS(char *s1, char *s2, char *s3){RS(s1), RS(s2), RS(s3);}
template<class T0,class T1>inline void RDD(T0&a, T1&b){RDD(a),RDD(b);}
template<class T0,class T1,class T2>inline void RDD(T0&a, T1&b, T2&c){RDD(a),RDD(b),RDD(c);}
template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}
template<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}
template<class T> inline void CLR(T &A){A.clear();}
template<class T0, class T1> inline void RST(T0 &A0, T1 &A1){RST(A0), RST(A1);}
template<class T0, class T1, class T2> inline void RST(T0 &A0, T1 &A1, T2 &A2){RST(A0), RST(A1), RST(A2);}
template<class T0, class T1, class T2, class T3> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3){RST(A0), RST(A1), RST(A2), RST(A3);}
template<class T0, class T1, class T2, class T3, class T4> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4);}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5);}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void RST(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){RST(A0), RST(A1), RST(A2), RST(A3), RST(A4), RST(A5), RST(A6);}
template<class T0, class T1> inline void FLC(T0 &A0, T1 &A1, int x){FLC(A0, x), FLC(A1, x);}
template<class T0, class T1, class T2> inline void FLC(T0 &A0, T1 &A1, T2 &A2, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x);}
template<class T0, class T1, class T2, class T3> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x);}
template<class T0, class T1, class T2, class T3, class T4> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x);}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x);}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void FLC(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6, int x){FLC(A0, x), FLC(A1, x), FLC(A2, x), FLC(A3, x), FLC(A4, x), FLC(A5, x), FLC(A6, x);}
template<class T> inline void CLR(priority_queue<T, vector<T>, less<T> > &Q){while (!Q.empty()) Q.pop();}
template<class T> inline void CLR(priority_queue<T, vector<T>, greater<T> > &Q){while (!Q.empty()) Q.pop();}
template<class T> inline void CLR(stack<T> &S){while (!S.empty()) S.pop();}
template<class T0, class T1> inline void CLR(T0 &A0, T1 &A1){CLR(A0), CLR(A1);}
template<class T0, class T1, class T2> inline void CLR(T0 &A0, T1 &A1, T2 &A2){CLR(A0), CLR(A1), CLR(A2);}
template<class T0, class T1, class T2, class T3> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3){CLR(A0), CLR(A1), CLR(A2), CLR(A3);}
template<class T0, class T1, class T2, class T3, class T4> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4);}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5);}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void CLR(T0 &A0, T1 &A1, T2 &A2, T3 &A3, T4 &A4, T5 &A5, T6 &A6){CLR(A0), CLR(A1), CLR(A2), CLR(A3), CLR(A4), CLR(A5), CLR(A6);}
template<class T> inline void CLR(T &A, int n){REP(i, n) CLR(A[i]);}
template<class T> inline bool EPT(T &a){return a.empty();}
template<class T> inline T& SRT(T &A){sort(ALL(A)); return A;}
template<class T, class C> inline T& SRT(T &A, C B){sort(ALL(A), B); return A;}
template<class T> inline T& RVS(T &A){reverse(ALL(A)); return A;}
template<class T> inline T& UNQQ(T &A){A.resize(unique(ALL(A))-A.begin());return A;}
template<class T> inline T& UNQ(T &A){SRT(A);return UNQQ(A);}
//}
/** Constant List .. **/ //{
//const int MOD = int(1e9) + 7;
const int MOD = 20101009;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
//}
/** Add On .. **/ //{
// <<= '0. Nichi Joo ., //{
template<class T> inline T& checkMin(T &a,const T b){if (b<a) a=b;return a;}
template<class T> inline T& checkMax(T &a,const T b){if (a<b) a=b;return a;}
template<class T> inline T& checkMin(T &a, T &b, const T x){checkMin(a, x), checkMin(b, x);return a;}
template<class T> inline T& checkMax(T &a, T &b, const T x){checkMax(a, x), checkMax(b, x);return a;}
template <class T, class C> inline T& checkMin(T& a, const T b, C c){if (c(b,a)) a = b;return a;}
template <class T, class C> inline T& checkMax(T& a, const T b, C c){if (c(a,b)) a = b;return a;}
template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}
template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}
template<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));}
template<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));}
template<class T> inline T min(T a, T b, T c, T d, T e){return min(min(min(a,b),min(c,d)),e);}
template<class T> inline T max(T a, T b, T c, T d, T e){return max(max(max(a,b),max(c,d)),e);}
template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T cub(T a){return a*a*a;}
template<class T> inline T ceil(T x, T y){return (x - 1) / y + 1;}
template<class T> T abs(T x){return x>0?x:-x;}
inline int sgn(DB x){return x < -EPS ? -1 : x > EPS;}
inline int sgn(DB x, DB y){return sgn(x - y);}
inline DB cos(DB a, DB b, DB c){return (sqr(a)+sqr(b)-sqr(c))/(2*a*b);}
inline DB cot(DB x){return 1./tan(x);};
inline DB sec(DB x){return 1./cos(x);};
inline DB csc(DB x){return 1./sin(x);};
//}
// <<= '1. Bitwise Operation ., //{
namespace BO{
inline bool _1(int x, int i){return bool(x&1<<i);}
inline bool _1(LL x, int i){return bool(x&1LL<<i);}
inline LL _1(int i){return 1LL<<i;}
inline LL _U(int i){return _1(i) - 1;};
inline int reverse_bits(int x){
x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa);
x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc);
x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0);
x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00);
x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000);
return x;
}
inline LL reverse_bits(LL x){
x = ((x >> 1) & 0x5555555555555555LL) | ((x << 1) & 0xaaaaaaaaaaaaaaaaLL);
x = ((x >> 2) & 0x3333333333333333LL) | ((x << 2) & 0xccccccccccccccccLL);
x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) | ((x << 4) & 0xf0f0f0f0f0f0f0f0LL);
x = ((x >> 8) & 0x00ff00ff00ff00ffLL) | ((x << 8) & 0xff00ff00ff00ff00LL);
x = ((x >>16) & 0x0000ffff0000ffffLL) | ((x <<16) & 0xffff0000ffff0000LL);
x = ((x >>32) & 0x00000000ffffffffLL) | ((x <<32) & 0xffffffff00000000LL);
return x;
}
template<class T> inline bool odd(T x){return x&1;}
template<class T> inline bool even(T x){return !odd(x);}
template<class T> inline T low_bit(T x) {return x & -x;}
template<class T> inline T high_bit(T x) {T p = low_bit(x);while (p != x) x -= p, p = low_bit(x);return p;}
template<class T> inline T cover_bit(T x){T p = 1; while (p < x) p <<= 1;return p;}
template<class T> inline int cover_idx(T x){int p = 0; while (_1(p) < x ) ++p; return p;}
inline int clz(int x){return __builtin_clz(x);}
inline int clz(LL x){return __builtin_clzll(x);}
inline int ctz(int x){return __builtin_ctz(x);}
inline int ctz(LL x){return __builtin_ctzll(x);}
inline int lg2(int x){return !x ? -1 : 31 - clz(x);}
inline int lg2(LL x){return !x ? -1 : 63 - clz(x);}
inline int low_idx(int x){return !x ? -1 : ctz(x);}
inline int low_idx(LL x){return !x ? -1 : ctz(x);}
inline int high_idx(int x){return lg2(x);}
inline int high_idx(LL x){return lg2(x);}
inline int parity(int x){return __builtin_parity(x);}
inline int parity(LL x){return __builtin_parityll(x);}
inline int count_bits(int x){return __builtin_popcount(x);}
inline int count_bits(LL x){return __builtin_popcountll(x);}
} using namespace BO;//}
// <<= '2. Number Theory .,//{
namespace NT{
inline LL gcd(LL a, LL b){return __gcd(a, b);}
inline LL lcm(LL a, LL b){return a*b/gcd(a,b);}
inline void INC(int &a, int b){a += b; if (a >= MOD) a -= MOD;}
inline int sum(int a, int b){a += b; if (a >= MOD) a -= MOD; return a;}
inline void DEC(int &a, int b){a -= b; if (a < 0) a += MOD;}
inline int dff(int a, int b){a -= b; if (a < 0) a += MOD; return a;}
inline void MUL(int &a, int b){a = (LL)a * b % MOD;}
inline int pdt(int a, int b){return (LL)a * b % MOD;}
inline int gcd(int m, int n, int &x, int &y){
x = 1, y = 0; int xx = 0, yy = 1, q;
while (1){
q = m / n, m %= n;
if (!m){x = xx, y = yy; return n;}
DEC(x, pdt(q, xx)), DEC(y, pdt(q, yy));
q = n / m, n %= m;
if (!n) return m;
DEC(xx, pdt(q, x)), DEC(yy, pdt(q, y));
}
}
inline int sum(int a, int b, int c){return sum(a, sum(b, c));}
inline int sum(int a, int b, int c, int d){return sum(sum(a, b), sum(c, d));}
inline int pdt(int a, int b, int c){return pdt(a, pdt(b, c));}
inline int pdt(int a, int b, int c, int d){return pdt(pdt(a, b), pdt(c, d));}
inline int pow(int a, LL b){
int c(1); while (b){
if (b&1) MUL(c, a);
MUL(a, a), b >>= 1;
}
return c;
}
template<class T> inline T pow(T a, LL b){
T c(1); while (b){
if (b&1) c *= a;
a *= a, b >>= 1;
}
return c;
}
template<class T> inline T pow(T a, int b){
return pow(a, (LL)b);
}
inline int _I(int b){
int a = MOD, x1 = 0, x2 = 1, q;
while (true){
q = a / b, a %= b;
if (!a) return (x2 + MOD) % MOD;
DEC(x1, pdt(q, x2));
q = b / a, b %= a;
if (!b) return (x1 + MOD) % MOD;
DEC(x2, pdt(q, x1));
}
}
inline void DIV(int &a, int b){MUL(a, _I(b));}
inline int qtt(int a, int b){return pdt(a, _I(b));}
struct Int{
int val;
operator int() const{return val;}
Int(int _val = 0){
_val %= MOD; if (_val < 0) _val += MOD; val = _val;
}
Int(LL _val){
_val %= MOD; if (_val < 0) _val += MOD; val = _val;
}
Int& operator +=(const int& rhs){
INC(val, rhs);
return *this;
}
Int operator +(const int& rhs) const{
return sum(val, rhs);
}
Int& operator -=(const int& rhs){
DEC(val, rhs);
return *this;
}
Int operator -(const int& rhs) const{
return dff(val, rhs);
}
Int& operator *=(const int& rhs){
MUL(val, rhs);
return *this;
}
Int operator *(const int& rhs) const{
return pdt(val, rhs);
}
Int& operator /=(const int& rhs){
DIV(val, rhs);
return *this;
}
Int operator /(const int& rhs) const{
return qtt(val, rhs);
}
Int operator-()const{
return MOD-*this;
}
};
/*
Int Fact[N], Factt[N]; Int Binom(int n, int m){
return Fact[n] * Factt[m] * Factt[n-m];
}
*/
/*
Fact[0] = 1; REP_1(i, N-1) Fact[i] = Fact[i-1] * i;
Factt[N-1] = _I(Fact[N-1]); DWN(i, N, 1) Factt[i-1] = Factt[i] * i;
*/
/*
int Binom[N][N];
REP(i, N){Binom[i][0] = 1; REP_1(j, i) Binom[i][j] = Binom[i-1][j-1] + Binom[i-1][j];}
*/
/*
const int PMAX = 1;
VI P; bitset<PMAX> isP;
void sieve(){
FOR(i, 2, PMAX){
if (!isP[i]) P.PB(i);
for (int j=0;j<SZ(P)&&i*P[j]<PMAX;++j){
isP[i*P[j]]=1; if (!(i%P[j])) break;
}
}
}
*/
/*
inline int phi(int n){
int res = n; for (int i=2;sqr(i)<=n;++i) if (!(n%i)){
DEC(res, qtt(res, i));
do{n /= i;} while(!(n%i));
}
if (n != 1)
DEC(res, qtt(res, n));
return res;
}
*/
/*LL d, x, y; void exGcd(LL a, LL b){
if(!b) x = 1, y = 0, d = a;
else{
exGcd(b, a%b); LL t = y;
y = x - (a/b)*y, x = t;
}
}*/
} using namespace NT;//}
// <<= '9. Comutational Geometry .,//{
namespace CG{
#define cPo const Po&
#define cLine const Line&
#define cSeg const Seg&
inline DB dist2(DB x,DB y){return sqr(x)+sqr(y);}
struct Po{
DB x,y;Po(DB x=0,DB y=0):x(x),y(y){}
void in(){RF(x,y);}void out(){printf("(%.2f,%.2f)",x,y);}
inline friend istream&operator>>(istream&i,Po&p){return i>>p.x>>p.y;}
inline friend ostream&operator<<(ostream&o,Po p){return o<<"("<<p.x<<", "<<p.y<< ")";}
Po operator-()const{return Po(-x,-y);}
Po&operator+=(cPo p){x+=p.x,y+=p.y;rTs;}Po&operator-=(cPo p){x-=p.x,y-=p.y;rTs;}
Po&operator*=(DB k){x*=k,y*=k;rTs;}Po&operator/=(DB k){x/=k,y/=k;rTs;}
Po&operator*=(cPo p){rTs=Ts*p;}Po&operator/=(cPo p){rTs=Ts/p;}
Po operator+(cPo p)const{return Po(x+p.x,y+p.y);}Po operator-(cPo p)const{return Po(x-p.x,y-p.y);}
Po operator*(DB k)const{return Po(x*k,y*k);}Po operator/(DB k)const{return Po(x/k,y/k);}
Po operator*(cPo p)const{return Po(x*p.x-y*p.y,y*p.x+x*p.y);}Po operator/(cPo p)const{return Po(x*p.x+y*p.y,y*p.x-x*p.y)/p.len2();}
bool operator==(cPo p)const{return!sgn(x,p.x)&&!sgn(y,p.y);};bool operator!=(cPo p)const{return sgn(x,p.x)||sgn(y,p.y);}
bool operator<(cPo p)const{return sgn(x,p.x)<0||!sgn(x,p.x)&&sgn(y,p.y)<0;}bool operator<=(cPo p)const{return sgn(x,p.x)<0||!sgn(x,p.x)&&sgn(y,p.y)<=0;}
bool operator>(cPo p)const{return!(Ts<=p);}bool operator >=(cPo p)const{return!(Ts<p);}
DB len2()const{return dist2(x,y);}DB len()const{return sqrt(len2());}DB arg()const{return atan2(y,x);}
Po&_1(){rTs/=len();}Po&conj(){y=-y;rTs;}Po<(){swap(x,y),x=-x;rTs;}Po&rt(){swap(x,y),y=-y;rTs;}
Po&rot(DB a,cPo o=Po()){Ts-=o;Ts*=Po(cos(a),sin(a));rTs+=o;}
};
inline DB dot(DB x1,DB y1,DB x2,DB y2){return x1*x2+y1*y2;}
inline DB dot(cPo a,cPo b){return dot(a.x,a.y,b.x,b.y);}
inline DB dot(cPo p0,cPo p1,cPo p2){return dot(p1-p0,p2-p0);}
inline DB det(DB x1,DB y1,DB x2,DB y2){return x1*y2-x2*y1;}
inline DB det(cPo a,cPo b){return det(a.x,a.y,b.x,b.y);}
inline DB det(cPo p0,cPo p1,cPo p2){return det(p1-p0,p2-p0);}
inline DB ang(cPo p0,cPo p1){return acos(dot(p0,p1)/p0.len()/p1.len());}
inline DB ang(cPo p0,cPo p1,cPo p2){return ang(p1-p0,p2-p0);}
inline DB ang(cPo p0,cPo p1,cPo p2,cPo p3){return ang(p1-p0,p3-p2);}
inline DB dist2(const Po &a, const Po &b){return dist2(a.x-b.x, a.y-b.y);}
template<class T1, class T2> inline int dett(const T1 &x, const T2 &y){return sgn(det(x, y));}
template<class T1, class T2, class T3> inline int dett(const T1 &x, const T2 &y, const T3 &z){return sgn(det(x, y, z));}
template<class T1, class T2, class T3, class T4> inline int dett(const T1 &x, const T2 &y, const T3 &z, const T4 &w){return sgn(det(x, y, z, w));}
template<class T1, class T2> inline int dott(const T1 &x, const T2 &y){return sgn(dot(x, y));}
template<class T1, class T2, class T3> inline int dott(const T1 &x, const T2 &y, const T3 &z){return sgn(dot(x, y, z));}
template<class T1, class T2, class T3, class T4> inline int dott(const T1 &x, const T2 &y, const T3 &z, const T4 &w){return sgn(dot(x, y, z, w));}
template<class T1, class T2> inline DB arg(const T1 &x, const T2 &y){DB a=ang(x,y);return~dett(x,y)?a:2*PI-a;}
template<class T1, class T2, class T3> inline DB arg(const T1 &x, const T2 &y, const T3 &z){DB a=ang(x,y,z);return~dett(x,y,z)?a:2*PI-a;}
template<class T1, class T2, class T3, class T4> inline DB arg(const T1 &x, const T2 &y, const T3 &z, const T4 &w){DB a=ang(x,y,z,w);return~dett(x,y,z,w)?a:2*PI-a;}
template<class T1, class T2> inline DB dist(const T1 &x, const T2 &y){return sqrt(dist2(x, y));}
template<class T1, class T2, class T3> inline DB dist(const T1 &x, const T2 &y, const T3 &z){return sqrt(dist2(x, y, z));}
inline Po _1(Po p){return p._1();}inline Po conj(Po p){return p.conj();}
inline Po lt(Po p){return p.lt();}inline Po rt(Po p){return p.rt();}
inline Po rot(Po p,DB a,cPo o=Po()){return p.rot(a,o);}
inline Po operator *(DB k,cPo p){return p*k;}
inline Po operator /(DB k,cPo p){return conj(p)*k/p.len2();}
typedef vector<Po> VP;
struct Line{
Po a,b;Line(cPo a=Po(),cPo b=Po()):a(a),b(b){}
Line(DB x0,DB y0,DB x1,DB y1):a(Po(x0,y0)),b(Po(x1,y1)){}
Line(cLine l):a(l.a),b(l.b){}
//Ax+By+C=0
Line(DB A,DB B,DB C){
C=-C;if(!::sgn(A))a=Po(0,C/B),b=Po(1,C/B);
else if(!::sgn(B))a=Po(C/A,0),b=Po(C/A,1);
else a=Po(0,C/B),b=Po(1,(C-A)/B);
}
void in(){a.in(),b.in();}
inline friend istream&operator>>(istream&i,Line& p){return i>>p.a>>p.b;}
inline friend ostream&operator<<(ostream&o,Line p){return o<<p.a<<"-"<< p.b;}
Line operator+(cPo x)const{return Line(a+x,b+x);}
Line operator-(cPo x)const{return Line(a-x,b-x);}
Line operator*(DB k)const{return Line(a*k,b*k);}
Line operator/(DB k)const{return Line(a/k,b/k);}
Po operator*(cLine)const;
Po d()const{return b-a;}DB len2()const{return d().len2();}DB len()const{return d().len();}DB arg()const{return d().arg();}
int sgn(cPo p)const{return dett(a, b, p);}
int sgn(cLine)const;
bool sameSgn(cPo p1,cPo p2)const{return sgn(p1)==sgn(p2);}
void getEquation(DB&K,DB&B)const{
K = ::sgn(a.x, b.x) ? (b.y-a.y)/(b.x-a.x) : OO;
B = a.y - K*a.x;
}
void getEquation(DB&A,DB&B,DB&C)const{A=a.y-b.y,B=b.x-a.x,C=det(a, b);}
Po&rot(DB t,cPo o=Po()){a.rot(t, o),b.rot(t, o);}
Line&push(DB r){ // 正数右手螺旋向里
Po v=d()._1().lt()*r;a+=v,b+=v; rTs;
}
};
inline DB dot(cLine l1,cLine l2){return dot(l1.d(),l2.d());}
inline DB dot(cLine l,cPo p){return dot(l.a,l.b,p);}
inline DB dot(cPo p,cLine l){return dot(p,l.a,l.b);}
inline DB det(cLine l1,cLine l2){return det(l1.d(),l2.d());}
inline DB det(cLine l,cPo p){return det(l.a,l.b,p);}
inline DB det(cPo p,cLine l){return det(p,l.a,l.b);}
inline DB ang(cLine l0,cLine l1){return ang(l0.d(),l1.d());}
inline DB ang(cLine l,cPo p){return ang(l.a,l.b,p);}
inline DB ang(cPo p,cLine l){return ang(p,l.a,l.b);}
inline int Line::sgn(cLine l)const{return dett(Ts, l);}
inline Po Line::operator*(cLine l)const{return a+d()*det(a,l)/det(Ts,l);}
inline Po operator&(cPo p,cLine l){return l*Line(p,p+l.d().lt());}
inline Po operator%(cPo p,cLine l){return p&l*2-p;}
inline Line push(Line l, DB r){return l.push(r);}
struct Seg: public Line{
Seg(cPo a=Po(),cPo b=Po()):Line(a,b){}
Seg(DB x0,DB y0,DB x1,DB y1):Line(x0,y0,x1,y1){}
Seg(cLine l):Line(l){}
Seg(const Po &a,DB alpha):Line(a,alpha){}
Seg(DB A,DB B,DB C):Line(A,B,C){}
inline int sgn(cPo p)const;
inline int sgn(cLine l)const;
inline bool qrt(cSeg l)const;
inline int sgn(cSeg l)const;
};
// -1不相交 0相交(不规范) 1相交(规范)
inline int Seg::sgn(cPo p)const{return -dott(p,a,b);}
inline int Seg::sgn(cLine l)const{return sgn(Ts*l);}
// quick_rejection_test
inline bool Seg::qrt(cSeg l)const{
return min(a.x,b.x)<=max(l.a.x,l.b.x)&&min(l.a.x,l.b.x)<=max(a.x,b.x)&&
min(a.y,b.y)<=max(l.a.y,l.b.y)&&min(l.a.y,l.b.y)<=max(a.y,b.y);
}
inline int Seg::sgn(cSeg l)const{
if (!qrt(l)) return -1;
/*return
(dett(a,b,l.a)*dett(a,b,l.b)<=0 &&
dett(l.a,l.b,a)*dett(l.a,l.b,b)<=0)?1:-1;*/
int d1=dett(a,b,l.a),d2=dett(a,b,l.b),d3=dett(l.a,l.b,a),d4=dett(l.a,l.b,b);
if ((d1^d2)==-2&&(d3^d4)==-2)return 1;
return ((!d1&&dott(l.a-a,l.a-b)<=0)||(!d2&&dott(l.b-a,l.b-b)<=0)||
(!d3&&dott(a-l.a,a-l.b)<=0)||(!d4&&dott(b-l.a,b-l.b)<=0))?0:-1;
}
//inline DB dist2(cLine l,cPo p){return sqr(fabs(dot(lt(l.d()), p-l.a)))/l.len2();}
inline DB dist2(cLine l,cPo p){return sqr(fabs(det(l.d(), p-l.a)))/l.len2();}
inline DB dist2(cLine l1,cLine l2){return dett(l1,l2)?0:dist2(l1,l2.a);}
inline DB dist2(cSeg l,cPo p){
Po pa = p - l.a, pb = p - l.b;
if (dott(l.d(), pa) <= 0) return pa.len2();
if (dott(l.d(), pb) >= 0) return pb.len2();
return dist2(Line(l), p);
}
inline DB dist2(cSeg s,cLine l){
Po v1=s.a-l.a,v2=s.b-l.a;DB d1=det(l.d(),v1),d2=det(l.d(),v2);
return sgn(d1)!=sgn(d2) ? 0 : sqr(min(fabs(d1), fabs(d2)))/l.len2();
}
inline DB dist2(cSeg l1,cSeg l2){
if (~l1.sgn(l2)) return 0;
else return min(dist2(l2,l1.a), dist2(l2,l1.b), dist2(l1,l2.a), dist2(l1,l2.b));
}
template<class T1, class T2> inline DB dist2(const T1& a, const T2& b){
return dist2(b, a);
}
} using namespace CG;//}
//}
/** I/O Accelerator Interface .. **/ //{
#define g (c=getchar())
#define d isdigit(g)
#define p x=x*10+c-'0'
#define n x=x*10+'0'-c
#define pp l/=10,p
#define nn l/=10,n
template<class T> inline T& RD(T &x){
char c;while(!d);x=c-'0';while(d)p;
return x;
}
template<class T> inline T& RDD(T &x){
char c;while(g,c!='-'&&!isdigit(c));
if (c=='-'){x='0'-g;while(d)n;}
else{x=c-'0';while(d)p;}
return x;
}
inline DB& RF(DB &x){
//scanf("%lf", &x);
char c;while(g,c!='-'&&c!='.'&&!isdigit(c));
if(c=='-')if(g=='.'){x=0;DB l=1;while(d)nn;x*=l;}
else{x='0'-c;while(d)n;if(c=='.'){DB l=1;while(d)nn;x*=l;}}
else if(c=='.'){x=0;DB l=1;while(d)pp;x*=l;}
else{x=c-'0';while(d)p;if(c=='.'){DB l=1;while(d)pp;x*=l;}}
return x;
}
#undef nn
#undef pp
#undef n
#undef p
#undef d
#undef g
inline char* RS(char *s){
//gets(s);
scanf("%s", s);
return s;
}
LL last_ans; int Case; template<class T> inline void OT(const T &x){
//printf("Case %d: ", ++Case);
//printf("%lld\n", x);
//printf("%.9f\n", x);
printf("%d\n", x);
//cout << x << endl;
//last_ans = x;
}
//}
//}/* .................................................................................................................................. */
const int N = 309;
Po r(Po p){
return p.y < 0 || !p.y && p.x < 0 ? Po(-p.x, -p.y) : p;
}
bool cmp(Po a, Po b){
return dett(a, b) == 1;
}
Po P[N]; int C[N];
int ans, n;
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif
REP_C(i, RD(n)) P[i].in(); REP(i, n){
VP I; REP(j, n) if (i != j) I.PB(r(P[j]-P[i])); SRT(I, cmp);
//FOR(j, 1, SZ(I)) cout << dett(I[j-1], I[j]) << endl;
int jj = 0; FOR(j, 1, SZ(I)) if (dett(I[j-1], I[j]) == 1)
++ans, ++C[j-jj+1], jj = j;
++ans, ++C[SZ(I)-jj+1];
// cout << ans << endl;
}
FOR(i, 1, N) ans -= C[i]/i;
/*
REP_2(j, i, n, j) gen(Line(P[i], P[j]));
OT((SZ(S)-1)*2);*/
OT(ans*2);
}
I题:
这道题目实际上是个二分的题目,因为我们要使树的边都在l,r的范围内,而且l,r>=0,所以不需要考虑负权边的情况,于是我们先将距离排序,然后对于每条边在距离中找可使用的范围,即可接在那些边的后面(x个),然后ans*=x。找可以使用二分去找,这道题目的数据应该是给小了。复杂度 O(n*logn)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=111111;
int dis[maxn];
const int mod = 1e9+7;
int main()
{
// freopen("in.txt","r",stdin);
int n;
while(~scanf("%d",&n))
{
dis[0]=0;
for(int i=1;i<n;i++)
{
scanf("%d",&dis[i]);
}
sort(dis,dis+n);
int q;
scanf("%d",&q);
int l,r;
long long ans=0;
for(int i=0;i<q;i++)
{
scanf("%d%d",&l,&r);
ans=1;
for(int j=1;j<n;j++)
{
int p=lower_bound(dis,dis+n,dis[j]-r)-dis;
int p2=upper_bound(dis,dis+n,dis[j]-l)-dis;
ans*=(p2-p);
ans%=mod;
}
printf("%lld\n",ans);
}
}
return 0;
}
J题:
这是个求加权中位数的题目,做法是排序,然后用O(n)的时间找答案即可。因为中位数,所以只要找到一边刚好大于和的一半停止,那么最后加的那个数就是中位数。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct node
{
int x;
int w;
};
node num[11111111];
bool cmp(const node &a,const node &b)
{
if(a.x!=b.x)
{
return a.x<b.x;
}
else
{
return a.w<b.w;
}
}
int main()
{
// freopen ("in.txt","r",stdin);
int n;
while(~scanf("%d",&n))
{
double sum=0;
for(int i=0;i<n;i++)
{
scanf("%d",&num[i].x);
}
for(int i=0;i<n;i++)
{
scanf("%d",&num[i].w);
sum+=num[i].w;
}
sort(num,num+n,cmp);
double res=0;
int ans=0;
for(int i=0;i<n;i++)
{
if(res>=(sum/2.0))
{
ans=i;
break;
}
res+=num[i].w;
}
printf("%d\n",num[ans-1].x);
}
return 0;
}