CSES - Datatähti 2019 alku - Results
Submission details
Task:Ruudukko
Sender:Olli
Submission time:2018-10-02 11:42:06 +0300
Language:C++
Status:READY
Result:14
Feedback
groupverdictscore
#10
#2ACCEPTED14
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#2ACCEPTED0.01 s1details
#3ACCEPTED0.03 s1details
#4ACCEPTED0.01 s1details
#5ACCEPTED0.01 s1details
#6ACCEPTED0.02 s1details
#7ACCEPTED0.01 s1details
#80.01 s1details
#90.01 s1details
#100.02 s1details
#11ACCEPTED0.02 s2details
#12ACCEPTED0.02 s2details
#13ACCEPTED0.03 s2details
#14ACCEPTED0.02 s2details
#15ACCEPTED0.03 s2details
#16ACCEPTED0.04 s2details
#17ACCEPTED0.04 s2details
#18ACCEPTED0.04 s2details
#19ACCEPTED0.05 s2details
#20ACCEPTED0.04 s2details
#210.05 s3details
#220.05 s3details
#230.03 s3details
#240.04 s3details
#250.04 s3details
#260.04 s3details
#270.04 s3details
#280.04 s3details
#290.04 s3details
#30ACCEPTED0.04 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:193:6: warning: unused variable 'f4' [-Wunused-variable]
  int f4 = n - amB - aA;
      ^~
input/code.cpp:194:6: warning: unused variable 'f1' [-Wunused-variable]
  int f1 = amB;
      ^~

Code

#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 555;
const int M = 1e9 + 7;
char t[N][N];
ll n;
int aA;
int amB;
void swaR(int a, int b) {
for(int x = 1; x <= n; ++x) {
char c = t[a][x];
char d = t[b][x];
t[a][x] = d;
t[b][x] = c;
}
}
void swaC(int a, int b) {
for(int y = 1; y <= n; ++y) {
char c = t[y][a];
char d = t[y][b];
t[y][a] = d;
t[y][b] = c;
}
}
void print() {
cout << "\n\n";
for(int y = 1; y <= n; ++y) {
for(int x = 1; x <= n; ++x) {
cout << t[y][x];
}
cout << "\n";
}
cout << "\n";
}
void sor() {
vector<int> broken;
for(int y = n; y >= n - amB + 1; --y) {
bool conB = false;
for(int x = 1; x <= n; ++x) {
if(t[y][x] == 'B') {
conB = true;
break;
}
}
if(!conB) broken.push_back(y);
}
for(int y = n - amB; y >= 1; --y) {
bool conB = false;
for(int x = 1; x <= n; ++x) {
if(t[y][x] == 'B') {
conB = true;
break;
}
}
if(!conB) {
continue;
}
int k = broken[broken.size() - 1];
swaR(k, y);
broken.pop_back();
}
for(int y = n; y >= n - amB + 1; --y) {
int col = -1;
for(int x = 1; x <= n; ++x) {
if(t[y][x] == 'B') {
col = x;
}
}
swaC(n - y + 1, col);
}
aA = 0;
for(int x = amB + 1; x <= n; ++x) {
for(int y = n - amB; y >= 1; --y) {
if(t[y][x] == 'A') {
++aA;
}
}
}
for(int y = n - amB; y >= n - amB - aA + 1; --y) {
bool conA = false;
for(int x = amB + 1; x <= n; ++x) {
if(t[y][x] == 'A') {
conA = true;
break;
}
}
if(!conA) {
broken.push_back(y);
}
}
for(int y = n - amB - aA; y >= 1; --y) {
bool conA = false;
for(int x = amB + 1; x <= n; ++x) {
if(t[y][x] == 'A') {
conA = true;
break;
}
}
if(conA) {
int k = broken[broken.size() - 1];
swaR(k, y);
broken.pop_back();
}
}
for(int y = n - amB; y >= n - amB - aA + 1; --y) {
int col = -1;
for(int x = amB + 1; x <= n; ++x) {
if(t[y][x] == 'A') {
col = x;
break;
}
}
swaC(n - y + 1, col);
}
//print();
}
ll dp[N][N];
void fillDP() {
dp[0][0] = 1;
for(int x = 1; x <= n; ++x) {
dp[x][0] = dp[x-1][0]*x;
dp[x][0] %= M;
}
for(ll y = 1; y <= n; ++y) {
for(ll x = y; x <= n; ++x) {
dp[x][y] = dp[x-1][y-1]*(x-y);
dp[x][y] %= M;
if(y == 1) continue;
dp[x][y] += dp[x-1][y-2]*(y-1);
dp[x][y] %= M;
}
}
}
ll exp(ll a, ll e) {
if(e == 0) return 1;
if(e%2 == 0) {
ll c = exp(a, e/2);
return (c*c)%M;
}
ll c = exp(a, e-1);
return (c*a)%M;
}
int main() {
cin >> n;
for(int y = 1; y <= n; ++y) {
for(int x = 1; x <= n; ++x) {
char c;
cin >> c;
t[y][x] = c;
if(c == 'B') ++amB;
}
}
sor();
fillDP();
ll ans = 0;
int f4 = n - amB - aA;
int f1 = amB;
int a1 = 0;
int a2 = 0;
int a3 = 0;
//calculate a2
for(int y = 1; y <= n - amB - aA; ++y) {
for(int x = 1; x <= amB; ++x) {
if(t[y][x] == 'A') {
++a2;
}
}
}
//calculate a3;
for(int y = n - amB; y <= n; ++y) {
for(int x = amB + aA + 1; x <= n; ++x) {
if(t[y][x] == 'A') {
++a3;
}
}
}
//calculate a1;
for(int x = 1; x <= amB; ++x) {
for(int y = n - amB + 1; y <= n; ++y) {
if(t[y][x] == 'A') {
++a1;
}
}
}
/* for(int i = 0; i <= n; ++i) {
for(int a = 0; a <= i; ++a) {
cout << dp[i][a] << " ";
}
cout << "\n";
}
cout << "\n";
*/
for(int f2 = max(a2, a3); f2 <= amB - a1; ++f2) {
//Calculate the ways to pick f2 - a2 from section A2
ll A2 = 1;
ll fact = 1;
int s = n - amB - aA;
for(int j = 0; j < f2 - a2; ++j) {
A2 *= (s - a2 - j);
A2 %= M;
A2 *= (amB - a2 - j);
A2 %= M;
fact *= (j+1);
fact %= M;
}
A2 *= exp(fact, M-2);
//Calculate in a similar manner A3
ll A3 = 1;
fact = 1;
for(int j = 0; j < f2 - a3; ++j) {
A2 *= (s - a3 - j);
A3 %= M;
A3 *= (amB - a3 - j);
A2 %= M;
fact *= (j+1);
fact %= M;
}
A3 *= exp(fact, M-2);
int f1 = amB - f2;
int d1 = f1 - a1;
ll A1 = dp[d1][d1];
int f4 = n - 2*f2 - f1 - aA;
ll A4 = 1;
for(int i = 1; i <= f4; ++i) {
A4 *= i;
A4 %= M;
}
ll B = dp[n - amB][aA + f4];
ll cur = A1*A2;
cur %= M;
cur *= A3;
cur %= M;
cur *= A4;
cur %= M;
cur *= B;
cur %= M;
// cout << f2 << " " << B << " " << f4 << " aa\n";
ans += cur;
}
cout << ans << "\n";
}

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:

input
5
B....
.....
.....
.A.B.
...

correct output
22

user output
74

Test 9

Group: 1

Verdict:

input
5
B.A..
....A
.....
A.B..
...

correct output
2

user output
6

Test 10

Group: 1

Verdict:

input
5
A.B..
BA...
.B.A.
...BA
...

correct output
1

user output
0

Test 11

Group: 2

Verdict: ACCEPTED

input
10
..........
..........
..........
..........
...

correct output
306442892

user output
306442892

Test 12

Group: 2

Verdict: ACCEPTED

input
50
.................................

correct output
694861480

user output
694861480

Test 13

Group: 2

Verdict: ACCEPTED

input
111
.................................

correct output
555319110

user output
555319110

Test 14

Group: 2

Verdict: ACCEPTED

input
222
.................................

correct output
108372237

user output
108372237

Test 15

Group: 2

Verdict: ACCEPTED

input
333
.................................

correct output
259107857

user output
259107857

Test 16

Group: 2

Verdict: ACCEPTED

input
444
.................................

correct output
19906314

user output
19906314

Test 17

Group: 2

Verdict: ACCEPTED

input
497
.................................

correct output
224313667

user output
224313667

Test 18

Group: 2

Verdict: ACCEPTED

input
498
.................................

correct output
929574601

user output
929574601

Test 19

Group: 2

Verdict: ACCEPTED

input
499
.................................

correct output
600226043

user output
600226043

Test 20

Group: 2

Verdict: ACCEPTED

input
500
.................................

correct output
198353194

user output
198353194

Test 21

Group: 3

Verdict:

input
499
.................................

correct output
840243733

user output
-8029728349

Test 22

Group: 3

Verdict:

input
499
........................A........

correct output
4146290

user output
-842426046

Test 23

Group: 3

Verdict:

input
499
B.........A......................

correct output
173518884

user output
481695986

Test 24

Group: 3

Verdict:

input
499
...A....B........................

correct output
20044800

user output
1580608297

Test 25

Group: 3

Verdict:

input
499
AB...............................

correct output
2

user output
1

Test 26

Group: 3

Verdict:

input
500
.................................

correct output
121064146

user output
5185227718

Test 27

Group: 3

Verdict:

input
500
.................................

correct output
848435259

user output
376185305

Test 28

Group: 3

Verdict:

input
500
.....B........A..................

correct output
296240911

user output
-139825954

Test 29

Group: 3

Verdict:

input
500
.A......B........................

correct output
2196

user output
11666514

Test 30

Group: 3

Verdict: ACCEPTED

input
500
...AB............................

correct output
1

user output
1