| Task: | Ruudukko | 
| Sender: | Ilmari2000 | 
| Submission time: | 2018-10-12 00:54:27 +0300 | 
| Language: | C++ | 
| Status: | READY | 
| Result: | 0 | 
| group | verdict | score | 
|---|---|---|
| #1 | WRONG ANSWER | 0 | 
| #2 | TIME LIMIT EXCEEDED | 0 | 
| #3 | TIME LIMIT EXCEEDED | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1 | details | 
| #2 | ACCEPTED | 0.01 s | 1 | details | 
| #3 | WRONG ANSWER | 0.01 s | 1 | details | 
| #4 | ACCEPTED | 0.02 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 | WRONG ANSWER | 0.01 s | 1 | details | 
| #9 | WRONG ANSWER | 0.02 s | 1 | details | 
| #10 | WRONG ANSWER | 0.01 s | 1 | details | 
| #11 | ACCEPTED | 0.25 s | 2 | details | 
| #12 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #13 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #14 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #15 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #16 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #17 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #18 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #19 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #20 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #21 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #22 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #23 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #24 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #25 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #26 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #27 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #28 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #29 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #30 | TIME LIMIT EXCEEDED | -- | 3 | details | 
Code
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int n, f;
long long int ret = 0;
map<int, int> must;
void tree(vector<bool> B, int row)
{
	for(int i = 0; i < n; i++)
	{
		if(i == row || B[i] || (must[row] && i != must[row]-1))
			continue;
		if(row == n-1)
		{
			ret++;
		}
		else
		{
			B[i] = true;
			tree(B, row+1);
			B[i] = false;
		}
	}
}
long long int facto(long long int n)
{
	if(n <= 1)
		return 1;
	return n * facto(n-1);
}
int main()
{
	cin >> n;
	vector<bool> B;
	B.resize(n, false);
	f = n;
	string in;
	for(int i = 0; i < n; i++)
	{
		cin >> in;
		for(int j = 0; j < n; j++)
		{
			bool a = false;
			if(in[j] == 'A')
			{
				f--;
				a = true;
			}
			
			if(in[j] == 'B')
			{
				if(a)
					must[i] = j+1;
				else
					f--;
			}
			//if(in[i] == 'B')
			//	B[i] = true;
		}
	}
	tree(B, 0);
	cout << (ret * facto(f) % 1000000007l) << endl;
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input | 
|---|
| 2 .. .. | 
| correct output | 
|---|
| 2 | 
| user output | 
|---|
| 2 | 
Test 2
Group: 1
Verdict: ACCEPTED
| input | 
|---|
| 2 .. A. | 
| correct output | 
|---|
| 1 | 
| user output | 
|---|
| 1 | 
Test 3
Group: 1
Verdict: WRONG ANSWER
| input | 
|---|
| 2 B. .A | 
| correct output | 
|---|
| 0 | 
| user output | 
|---|
| 1 | 
Test 4
Group: 1
Verdict: ACCEPTED
| input | 
|---|
| 3 ... ... ... | 
| correct output | 
|---|
| 12 | 
| user output | 
|---|
| 12 | 
Test 5
Group: 1
Verdict: ACCEPTED
| input | 
|---|
| 4 .... .... .... .... | 
| correct output | 
|---|
| 216 | 
| user output | 
|---|
| 216 | 
Test 6
Group: 1
Verdict: ACCEPTED
| input | 
|---|
| 5 ..... ..... ..... ..... ... | 
| correct output | 
|---|
| 5280 | 
| user output | 
|---|
| 5280 | 
Test 7
Group: 1
Verdict: ACCEPTED
| input | 
|---|
| 5 ....A ..... ..... ..... ... | 
| correct output | 
|---|
| 264 | 
| user output | 
|---|
| 264 | 
Test 8
Group: 1
Verdict: WRONG ANSWER
| input | 
|---|
| 5 B.... ..... ..... .A.B. ... | 
| correct output | 
|---|
| 22 | 
| user output | 
|---|
| 44 | 
Test 9
Group: 1
Verdict: WRONG ANSWER
| input | 
|---|
| 5 B.A.. ....A ..... A.B.. ... | 
| correct output | 
|---|
| 2 | 
| user output | 
|---|
| 44 | 
Test 10
Group: 1
Verdict: WRONG ANSWER
| input | 
|---|
| 5 A.B.. BA... .B.A. ...BA ... | 
| correct output | 
|---|
| 1 | 
| user output | 
|---|
| 44 | 
Test 11
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 10 .......... .......... .......... .......... ... | 
| correct output | 
|---|
| 306442892 | 
| user output | 
|---|
| 306442892 | 
Test 12
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 50 ................................. | 
| correct output | 
|---|
| 694861480 | 
| user output | 
|---|
| (empty) | 
Test 13
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 111 ................................. | 
| correct output | 
|---|
| 555319110 | 
| user output | 
|---|
| (empty) | 
Test 14
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 222 ................................. | 
| correct output | 
|---|
| 108372237 | 
| user output | 
|---|
| (empty) | 
Test 15
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 333 ................................. | 
| correct output | 
|---|
| 259107857 | 
| user output | 
|---|
| (empty) | 
Test 16
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 444 ................................. | 
| correct output | 
|---|
| 19906314 | 
| user output | 
|---|
| (empty) | 
Test 17
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 497 ................................. | 
| correct output | 
|---|
| 224313667 | 
| user output | 
|---|
| (empty) | 
Test 18
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 498 ................................. | 
| correct output | 
|---|
| 929574601 | 
| user output | 
|---|
| (empty) | 
Test 19
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 499 ................................. | 
| correct output | 
|---|
| 600226043 | 
| user output | 
|---|
| (empty) | 
Test 20
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 500 ................................. | 
| correct output | 
|---|
| 198353194 | 
| user output | 
|---|
| (empty) | 
Test 21
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 499 ................................. | 
| correct output | 
|---|
| 840243733 | 
| user output | 
|---|
| (empty) | 
Test 22
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 499 ........................A........ | 
| correct output | 
|---|
| 4146290 | 
| user output | 
|---|
| (empty) | 
Test 23
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 499 B.........A...................... | 
| correct output | 
|---|
| 173518884 | 
| user output | 
|---|
| (empty) | 
Test 24
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 499 ...A....B........................ | 
| correct output | 
|---|
| 20044800 | 
| user output | 
|---|
| (empty) | 
Test 25
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 499 AB............................... | 
| correct output | 
|---|
| 2 | 
| user output | 
|---|
| (empty) | 
Test 26
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 500 ................................. | 
| correct output | 
|---|
| 121064146 | 
| user output | 
|---|
| (empty) | 
Test 27
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 500 ................................. | 
| correct output | 
|---|
| 848435259 | 
| user output | 
|---|
| (empty) | 
Test 28
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 500 .....B........A.................. | 
| correct output | 
|---|
| 296240911 | 
| user output | 
|---|
| (empty) | 
Test 29
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 500 .A......B........................ | 
| correct output | 
|---|
| 2196 | 
| user output | 
|---|
| (empty) | 
Test 30
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 500 ...AB............................ | 
| correct output | 
|---|
| 1 | 
| user output | 
|---|
| (empty) | 
