| Task: | Ruudukko |
| Sender: | rainman |
| Submission time: | 2018-10-08 21:17:00 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 31 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 31 |
| #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 | ACCEPTED | 0.01 s | 1 | details |
| #4 | ACCEPTED | 0.02 s | 1 | details |
| #5 | ACCEPTED | 0.02 s | 1 | details |
| #6 | ACCEPTED | 0.02 s | 1 | details |
| #7 | ACCEPTED | 0.01 s | 1 | details |
| #8 | ACCEPTED | 0.02 s | 1 | details |
| #9 | ACCEPTED | 0.02 s | 1 | details |
| #10 | ACCEPTED | 0.01 s | 1 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 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 | ACCEPTED | 0.02 s | 3 | details |
| #26 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #27 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #28 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #29 | ACCEPTED | 0.03 s | 3 | details |
| #30 | ACCEPTED | 0.03 s | 3 | details |
Code
#include <string>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s[500];
int n;
int r1[500], r2[500], r3[500], r4[500];
vector<int> v1, v2;
ll c = 0;
void B(int y) {
if(y == n) {
c++;
}
if(!r4[y]) {
for(int x = 0; x < n; x++) {
if(!r3[x] && s[y][x] == '.') {
r4[y] = r3[x] = 1;
B(y + 1);
r4[y] = r3[x] = 0;
}
}
}
if(r4[y]) {
B(y + 1);
}
}
void A(int y) {
if(y == n) {
B(0);
}
if(!r2[y]) {
for(int x = 0; x < n; x++) {
if(!r1[x] && s[y][x] == '.') {
r2[y] = r1[x] = 1;
s[y][x] = 'A';
A(y + 1);
r2[y] = r1[x] = 0;
s[y][x] = '.';
}
}
}
if(r2[y]) {
A(y + 1);
}
}
int main()
{
cin >> n;
for(int i = 0; i < n; i++) {
cin >> s[i];
size_t l = s[i].find_first_of('A');
if(l != string::npos) {
r1[l] = r2[i] = 1;
}
l = s[i].find_first_of('B');
if(l != string::npos) {
r3[l] = r4[i] = 1;
}
}
A(0);
int p = pow(10, 9);
cout << c % p;
return 0;
}
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: ACCEPTED
| input |
|---|
| 2 B. .A |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
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: ACCEPTED
| input |
|---|
| 5 B.... ..... ..... .A.B. ... |
| correct output |
|---|
| 22 |
| user output |
|---|
| 22 |
Test 9
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 5 B.A.. ....A ..... A.B.. ... |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 10
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 5 A.B.. BA... .B.A. ...BA ... |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 11
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 .......... .......... .......... .......... ... |
| correct output |
|---|
| 306442892 |
| user output |
|---|
| (empty) |
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: ACCEPTED
| input |
|---|
| 499 AB............................... |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
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: ACCEPTED
| input |
|---|
| 500 .A......B........................ |
| correct output |
|---|
| 2196 |
| user output |
|---|
| 2196 |
Test 30
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 500 ...AB............................ |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
