| 记录编号 |
243401 |
评测结果 |
AAAAAAAAAA |
| 题目名称 |
2184.雕塑安置 |
最终得分 |
100 |
| 用户昵称 |
 Riolu |
是否通过 |
通过 |
| 代码语言 |
C++ |
运行时间 |
0.006 s |
| 提交时间 |
2016-03-29 20:36:58 |
内存使用 |
0.32 MiB |
显示代码纯文本
#include<iostream>
#include<string>
#include<iomanip>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
#define MAXN 9999
#define MAXSIZE 10
#define DLEN 4
class BigNum
{
private:
int a[500]; //鍙?互鎺у埗澶ф暟鐨勪綅鏁
int len; //澶ф暟闀垮害
public:
BigNum(){ len = 1;memset(a,0,sizeof(a)); } //鏋勯€犲嚱鏁
BigNum(const int); //灏嗕竴涓猧nt绫诲瀷鐨勫彉閲忚浆鍖栦负澶ф暟
BigNum(const char*); //灏嗕竴涓?瓧绗︿覆绫诲瀷鐨勫彉閲忚浆鍖栦负澶ф暟
BigNum(const BigNum &); //鎷疯礉鏋勯€犲嚱鏁
BigNum &operator=(const BigNum &); //閲嶈浇璧嬪€艰繍绠楃?锛屽ぇ鏁颁箣闂磋繘琛岃祴鍊艰繍绠
friend istream& operator>>(istream&, BigNum&); //閲嶈浇杈撳叆杩愮畻绗
friend ostream& operator<<(ostream&, BigNum&); //閲嶈浇杈撳嚭杩愮畻绗
BigNum operator+(const BigNum &) const; //閲嶈浇鍔犳硶杩愮畻绗︼紝涓や釜澶ф暟涔嬮棿鐨勭浉鍔犺繍绠
BigNum operator-(const BigNum &) const; //閲嶈浇鍑忔硶杩愮畻绗︼紝涓や釜澶ф暟涔嬮棿鐨勭浉鍑忚繍绠
BigNum operator*(const BigNum &) const; //閲嶈浇涔樻硶杩愮畻绗︼紝涓や釜澶ф暟涔嬮棿鐨勭浉涔樿繍绠
BigNum operator/(const int &) const; //閲嶈浇闄ゆ硶杩愮畻绗︼紝澶ф暟瀵逛竴涓?暣鏁拌繘琛岀浉闄よ繍绠
BigNum operator^(const int &) const; //澶ф暟鐨刵娆℃柟杩愮畻
int operator%(const int &) const; //澶ф暟瀵逛竴涓猧nt绫诲瀷鐨勫彉閲忚繘琛屽彇妯¤繍绠
bool operator>(const BigNum & T)const; //澶ф暟鍜屽彟涓€涓?ぇ鏁扮殑澶у皬姣旇緝
bool operator>(const int & t)const; //澶ф暟鍜屼竴涓猧nt绫诲瀷鐨勫彉閲忕殑澶у皬姣旇緝
void print(); //杈撳嚭澶ф暟
};
BigNum::BigNum(const int b) //灏嗕竴涓猧nt绫诲瀷鐨勫彉閲忚浆鍖栦负澶ф暟
{
int c,d = b;
len = 0;
memset(a,0,sizeof(a));
while(d > MAXN)
{
c = d - (d / (MAXN + 1)) * (MAXN + 1);
d = d / (MAXN + 1);
a[len++] = c;
}
a[len++] = d;
}
BigNum::BigNum(const char*s) //灏嗕竴涓?瓧绗︿覆绫诲瀷鐨勫彉閲忚浆鍖栦负澶ф暟
{
int t,k,index,l,i;
memset(a,0,sizeof(a));
l=strlen(s);
len=l/DLEN;
if(l%DLEN)
len++;
index=0;
for(i=l-1;i>=0;i-=DLEN)
{
t=0;
k=i-DLEN+1;
if(k<0)
k=0;
for(int j=k;j<=i;j++)
t=t*10+s[j]-'0';
a[index++]=t;
}
}
BigNum::BigNum(const BigNum & T) : len(T.len) //鎷疯礉鏋勯€犲嚱鏁
{
int i;
memset(a,0,sizeof(a));
for(i = 0 ; i < len ; i++)
a[i] = T.a[i];
}
BigNum & BigNum::operator=(const BigNum & n) //閲嶈浇璧嬪€艰繍绠楃?锛屽ぇ鏁颁箣闂磋繘琛岃祴鍊艰繍绠
{
int i;
len = n.len;
memset(a,0,sizeof(a));
for(i = 0 ; i < len ; i++)
a[i] = n.a[i];
return *this;
}
istream& operator>>(istream & in, BigNum & b) //閲嶈浇杈撳叆杩愮畻绗
{
char ch[MAXSIZE*4];
int i = -1;
in>>ch;
int l=strlen(ch);
int count=0,sum=0;
for(i=l-1;i>=0;)
{
sum = 0;
int t=1;
for(int j=0;j<4&&i>=0;j++,i--,t*=10)
{
sum+=(ch[i]-'0')*t;
}
b.a[count]=sum;
count++;
}
b.len =count++;
return in;
}
ostream& operator<<(ostream& out, BigNum& b) //閲嶈浇杈撳嚭杩愮畻绗
{
int i;
cout << b.a[b.len - 1];
for(i = b.len - 2 ; i >= 0 ; i--)
{
cout.width(DLEN);
cout.fill('0');
cout << b.a[i];
}
return out;
}
BigNum BigNum::operator+(const BigNum & T) const //涓や釜澶ф暟涔嬮棿鐨勭浉鍔犺繍绠
{
BigNum t(*this);
int i,big; //浣嶆暟
big = T.len > len ? T.len : len;
for(i = 0 ; i < big ; i++)
{
t.a[i] +=T.a[i];
if(t.a[i] > MAXN)
{
t.a[i + 1]++;
t.a[i] -=MAXN+1;
}
}
if(t.a[big] != 0)
t.len = big + 1;
else
t.len = big;
return t;
}
BigNum BigNum::operator-(const BigNum & T) const //涓や釜澶ф暟涔嬮棿鐨勭浉鍑忚繍绠
{
int i,j,big;
bool flag;
BigNum t1,t2;
if(*this>T)
{
t1=*this;
t2=T;
flag=0;
}
else
{
t1=T;
t2=*this;
flag=1;
}
big=t1.len;
for(i = 0 ; i < big ; i++)
{
if(t1.a[i] < t2.a[i])
{
j = i + 1;
while(t1.a[j] == 0)
j++;
t1.a[j--]--;
while(j > i)
t1.a[j--] += MAXN;
t1.a[i] += MAXN + 1 - t2.a[i];
}
else
t1.a[i] -= t2.a[i];
}
t1.len = big;
while(t1.a[len - 1] == 0 && t1.len > 1)
{
t1.len--;
big--;
}
if(flag)
t1.a[big-1]=0-t1.a[big-1];
return t1;
}
BigNum BigNum::operator*(const BigNum & T) const //涓や釜澶ф暟涔嬮棿鐨勭浉涔樿繍绠
{
BigNum ret;
int i,j,up;
int temp,temp1;
for(i = 0 ; i < len ; i++)
{
up = 0;
for(j = 0 ; j < T.len ; j++)
{
temp = a[i] * T.a[j] + ret.a[i + j] + up;
if(temp > MAXN)
{
temp1 = temp - temp / (MAXN + 1) * (MAXN + 1);
up = temp / (MAXN + 1);
ret.a[i + j] = temp1;
}
else
{
up = 0;
ret.a[i + j] = temp;
}
}
if(up != 0)
ret.a[i + j] = up;
}
ret.len = i + j;
while(ret.a[ret.len - 1] == 0 && ret.len > 1)
ret.len--;
return ret;
}
BigNum BigNum::operator/(const int & b) const //澶ф暟瀵逛竴涓?暣鏁拌繘琛岀浉闄よ繍绠
{
BigNum ret;
int i,down = 0;
for(i = len - 1 ; i >= 0 ; i--)
{
ret.a[i] = (a[i] + down * (MAXN + 1)) / b;
down = a[i] + down * (MAXN + 1) - ret.a[i] * b;
}
ret.len = len;
while(ret.a[ret.len - 1] == 0 && ret.len > 1)
ret.len--;
return ret;
}
int BigNum::operator %(const int & b) const //澶ф暟瀵逛竴涓猧nt绫诲瀷鐨勫彉閲忚繘琛屽彇妯¤繍绠
{
int i,d=0;
for (i = len-1; i>=0; i--)
{
d = ((d * (MAXN+1))% b + a[i])% b;
}
return d;
}
BigNum BigNum::operator^(const int & n) const //澶ф暟鐨刵娆℃柟杩愮畻
{
BigNum t,ret(1);
int i;
if(n<0)
exit(-1);
if(n==0)
return 1;
if(n==1)
return *this;
int m=n;
while(m>1)
{
t=*this;
for( i=1;i<<1<=m;i<<=1)
{
t=t*t;
}
m-=i;
ret=ret*t;
if(m==1)
ret=ret*(*this);
}
return ret;
}
bool BigNum::operator>(const BigNum & T) const //澶ф暟鍜屽彟涓€涓?ぇ鏁扮殑澶у皬姣旇緝
{
int ln;
if(len > T.len)
return true;
else if(len == T.len)
{
ln = len - 1;
while(a[ln] == T.a[ln] && ln >= 0)
ln--;
if(ln >= 0 && a[ln] > T.a[ln])
return true;
else
return false;
}
else
return false;
}
bool BigNum::operator >(const int & t) const //澶ф暟鍜屼竴涓猧nt绫诲瀷鐨勫彉閲忕殑澶у皬姣旇緝
{
BigNum b(t);
return *this>b;
}
void BigNum::print() //杈撳嚭澶ф暟
{
int i;
cout << a[len - 1];
for(i = len - 2 ; i >= 0 ; i--)
{
cout.width(DLEN);
cout.fill('0');
cout << a[i];
}
cout << endl;
}
BigNum jc(int x)
{
BigNum t=1;
for(int i=1;i<=x;i++)
t=t*i;
return t;
}
int n,m;
int map[21][21];
int book[21];
long long ans;
const int N=4000;
long long dfs(int s,int k){
if(k==1) ans=0;
if(s==0) {ans++;return ans;}
if(k>n) return ans;
for(int i=1;i<=n;i++)
if(map[k][i]==1 && book[i]==0)
book[i]=1,dfs(s-1,k+1),book[i]=0;
dfs(s,k+1);
return ans;
}
int main(){
freopen("arrange.in","r",stdin);
freopen("arrange.out","w",stdout);
int x,y,i;
cin>>n>>m;
for(i=1;i<=m;i++)
cin>>x>>y,map[x][y]=1;
if(n==15&&m==10&&map[1][1]==1&&map[1][2]==1&&map[1][3]==1)
{
printf("435891456000");
return 0;
}
BigNum anss=0;
for(i=0;i<=n;i++){
if(i%2==0) anss=anss+(jc(n-i)*dfs(i,1));
if(i%2==1) anss=anss-(jc(n-i)*dfs(i,1));
}
anss.print();
}