Submission #141521

#	Time	Username	Problem	Language	Result	Execution time	Memory
141521		cheetose	마스코트 (JOI13_mascots)	C++11	100 / 100	447 ms	213048 KiB

mascots

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int n,m;
ll d[3001][3001];
ll fac[9000001];
ll inv[9000001];
ll nCr(int n, int r)
{
	if(r>n)return 0;
	ll c = fac[n];
	c = (c*inv[r]) % MOD;
	c = (c*inv[n - r]) % MOD;
	return c;
}
ll go(int N,int M)
{
	if(N==n && M==m)return 1;
	ll &ret=d[N][M];
	if(ret!=-1)return ret;
	ret=0;
	if(N<n)ret=(ret+fac[M]*go(N+1,M))%MOD;
	if(M<m)ret=(ret+fac[N]*go(N,M+1))%MOD;
	return ret;
}
int main() {
	fac[0] = inv[0] = 1;
	fup(i, 1, 9000000, 1)
		fac[i] = (fac[i - 1] * i) % MOD;
	inv[9000000] = POW(fac[9000000], MOD - 2);
	fdn(i, 8999999, 1, 1)
		inv[i] = (inv[i + 1] * (i+1)) % MOD;
	MEM_1(d);
	scanf("%d%d",&n,&m);
	int t;
	scanf("%d",&t);
	int mnx=INF,mxx=-1,mny=INF,mxy=-1;
	fup(i,1,t,1)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		mxx=max(mxx,x);
		mnx=min(mnx,x);
		mxy=max(mxy,y);
		mny=min(mny,y);
	}
	int U=mnx-1,D=n-mxx,L=mny-1,R=m-mxy;
	int xx=mxx-mnx+1,yy=mxy-mny+1;
	ll ans=fac[xx*yy-t];
	ans=(ans*go(xx,yy))%MOD;
	ans=(ans*nCr(L+R,L))%MOD;
	ans=(ans*nCr(U+D,U))%MOD;
	printf("%lld\n",ans);
}

Compilation message (stderr)

mascots.cpp: In function 'int main()':
mascots.cpp:93:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
mascots.cpp:95:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&t);
  ~~~~~^~~~~~~~~
mascots.cpp:100:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 30 / 30
• Subtask 3: 60 / 60