CSES - Datatähti 2019 alku

CSES - Datatähti 2019 alku - Results

Submission details
Task:	Ruudukko
Sender:	Yytsi
Submission time:	2018-10-02 21:18:35 +0300
Language:	C++
Status:	READY
Result:	45

Feedback
group	verdict	score
#1	ACCEPTED	31
#2	ACCEPTED	14
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1	details
#2	ACCEPTED	0.02 s	1	details
#3	ACCEPTED	0.02 s	1	details
#4	ACCEPTED	0.01 s	1	details
#5	ACCEPTED	0.01 s	1	details
#6	ACCEPTED	0.01 s	1	details
#7	ACCEPTED	0.01 s	1	details
#8	ACCEPTED	0.02 s	1	details
#9	ACCEPTED	0.01 s	1	details
#10	ACCEPTED	0.01 s	1	details
#11	ACCEPTED	0.02 s	2	details
#12	ACCEPTED	0.02 s	2	details
#13	ACCEPTED	0.03 s	2	details
#14	ACCEPTED	0.03 s	2	details
#15	ACCEPTED	0.02 s	2	details
#16	ACCEPTED	0.03 s	2	details
#17	ACCEPTED	0.02 s	2	details
#18	ACCEPTED	0.02 s	2	details
#19	ACCEPTED	0.02 s	2	details
#20	ACCEPTED	0.03 s	2	details
#21	WRONG ANSWER	0.01 s	3	details
#22	WRONG ANSWER	0.02 s	3	details
#23	WRONG ANSWER	0.01 s	3	details
#24	WRONG ANSWER	0.02 s	3	details
#25	WRONG ANSWER	0.02 s	3	details
#26	WRONG ANSWER	0.02 s	3	details
#27	WRONG ANSWER	0.01 s	3	details
#28	WRONG ANSWER	0.03 s	3	details
#29	WRONG ANSWER	0.02 s	3	details
#30	WRONG ANSWER	0.03 s	3	details

Code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define IO ios_base::sync_with_stdio(0); cin.tie(0)
#define ff first
#define ss second
#define pb push_back
#define INF 2147483647
#define LINF (1LL<<61LL)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define N 9
ll fac[555];
ll M = 1000000007;
ll n;

ll pw(ll a, ll b) {
	if (b == 0) return 1LL;
	if (b%2==0) {
		ll u = pw(a,b/2);
		return (u*u)%M;
	} else {
		ll u = pw(a,b-1);
		return (u*a)%M;
	}
}

ll inv(ll x) {
	return pw(x,M-2);
}

ll ncr(ll a, ll b) {
	if (b > a) return 0;
	ll x = fac[a];
	x = (x*inv(fac[b])) % M;
	x = (x*inv(fac[a-b])) % M;
	return x;
}

int Arow[N], Brow[N], Acol[N], Bcol[N];

int f(int r) {
	if (r == n+1) return 1; // filled :)
	if (Arow[r] && Brow[r]) return f(r+1);
	int res = 0;
	
	if (Arow[r]) {
		// ..A..
		FOR(i,1,n+1) {
			if (i==Arow[r]) continue;
			if (!Bcol[i]) {
				// place B here
				Bcol[i] = r;
				res += f(r+1);
				Bcol[i] = 0;
			}
		}
		
		return res;
	}
	if (Brow[r]) {
		// ..B..
		FOR(i,1,n+1) {
			if (i==Brow[r]) continue;
			if (!Acol[i]) {
				// place A here
				Acol[i] = r;
				res += f(r+1);
				Acol[i] = 0;
			}
		}
		
		return res;
	}
	
	//cout<<"Not a, nor B\n";
	// No A, nor B
	FOR(a,1,n+1) {
		if (Acol[a]) continue;
		FOR(b,1,n+1) {
			// place A on a, B on b
			if (a==b) continue;
			if (Bcol[b]) continue;
			// Criteria met
			Acol[a] = r;
			Bcol[b] = r;
			res += f(r+1);
			Acol[a] = 0;
			Bcol[b] = 0;
		}
	}
	
	return res;
}



int main() {
	IO; cin>>n;
	
	FOR(i,1,n+1) {
		FOR(j,1,n+1) {
			char c; cin>>c;
			if (c == 'A') {
				Arow[i] = j;
				Acol[j] = i;
			} else if (c == 'B') {
				Brow[i] = j;
				Bcol[j] = i;
			}
		}
	}
	
	if (n <= 5) {
		cout<<f(1); return 0;
	}
	
	fac[0] = 1;
	FOR(i,1,520) {
		fac[i] = fac[i-1]*(ll)i;
		fac[i] %= M;
	}
	
	ll S = 0;
	for (ll k=0; k<=n; k++) {
		ll super = pw(ncr(n,k), 2);
		ll duper = pw(-1,k);
		ll magic = pw(fac[n-k], 2);
		ll namaste = fac[k];
		
		ll a = (super * duper) % M;
		ll b = (a * magic) % M;
		ll c = (b * namaste) % M;
		S += c;
		S %= M;
	}
	
	if (S<0) S+=M;
	S%=M;
	cout<<S<<"\n";
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`2 .. ..` view save

correct output
`2` view save

user output
`2` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`2 .. A.` view save

correct output
`1` view save

user output
`1` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`2 B. .A` view save

correct output
`0` view save

user output
`0` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`3 ... ... ...` view save

correct output
`12` view save

user output
`12` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`4 .... .... .... ....` view save

correct output
`216` view save

user output
`216` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`5 ..... ..... ..... ..... ...` view save

correct output
`5280` view save

user output
`5280` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`5 ....A ..... ..... ..... ...` view save

correct output
`264` view save

user output
`264` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`5 B.... ..... ..... .A.B. ...` view save

correct output
`22` view save

user output
`22` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`5 B.A.. ....A ..... A.B.. ...` view save

correct output
`2` view save

user output
`2` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`5 A.B.. BA... .B.A. ...BA ...` view save

correct output
`1` view save

user output
`1` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`10 .......... .......... .......... .......... ...` view save

correct output
`306442892` view save

user output
`306442892` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`50 .................................` view save

correct output
`694861480` view save

user output
`694861480` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`111 .................................` view save

correct output
`555319110` view save

user output
`555319110` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`222 .................................` view save

correct output
`108372237` view save

user output
`108372237` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`333 .................................` view save

correct output
`259107857` view save

user output
`259107857` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`444 .................................` view save

correct output
`19906314` view save

user output
`19906314` view save

Test 17

Group: 2

Verdict: ACCEPTED

input
`497 .................................` view save

correct output
`224313667` view save

user output
`224313667` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`498 .................................` view save

correct output
`929574601` view save

user output
`929574601` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`499 .................................` view save

correct output
`600226043` view save

user output
`600226043` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`500 .................................` view save

correct output
`198353194` view save

user output
`198353194` view save

Test 21

Group: 3

Verdict: WRONG ANSWER

input
`499 .................................` view save

correct output
`840243733` view save

user output
`20` view save

Test 22

Group: 3

Verdict: WRONG ANSWER

input
`499 ........................A........` view save

correct output
`4146290` view save

user output
`328794294` view save

Test 23

Group: 3

Verdict: WRONG ANSWER

input
`499 B.........A......................` view save

correct output
`173518884` view save

user output
`21101319` view save

Test 24

Group: 3

Verdict: WRONG ANSWER

input
`499 ...A....B........................` view save

correct output
`20044800` view save

user output
`492194909` view save

Test 25

Group: 3

Verdict: WRONG ANSWER

input
`499 AB...............................` view save

correct output
`2` view save

user output
`38958640` view save

Test 26

Group: 3

Verdict: WRONG ANSWER

input
`500 .................................` view save

correct output
`121064146` view save

user output
`929728062` view save

Test 27

Group: 3

Verdict: WRONG ANSWER

input
`500 .................................` view save

correct output
`848435259` view save

user output
`24224001` view save

Test 28

Group: 3

Verdict: WRONG ANSWER

input
`500 .....B........A..................` view save

correct output
`296240911` view save

user output
`769356301` view save

Test 29

Group: 3

Verdict: WRONG ANSWER

input
`500 .A......B........................` view save

correct output
`2196` view save

user output
`228207003` view save

Test 30

Group: 3

Verdict: WRONG ANSWER

input
`500 ...AB............................` view save

correct output
`1` view save

user output
`283510658` view save

Datatähti 2019 alku

Ruudukko

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Tasks

Submissions (Yytsi)