| Task: | Ruudukko |
| Sender: | Kameli |
| Submission time: | 2018-10-05 16:49:32 +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.02 s | 1 | details |
| #2 | WRONG ANSWER | 0.01 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 | WRONG ANSWER | 0.02 s | 1 | details |
| #8 | ACCEPTED | 0.01 s | 1 | details |
| #9 | ACCEPTED | 0.01 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 | RUNTIME ERROR | 0.29 s | 2 | details |
| #17 | RUNTIME ERROR | 0.30 s | 2 | details |
| #18 | RUNTIME ERROR | 0.30 s | 2 | details |
| #19 | RUNTIME ERROR | 0.30 s | 2 | details |
| #20 | RUNTIME ERROR | 0.31 s | 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 | WRONG ANSWER | 0.02 s | 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 | ACCEPTED | 0.03 s | 3 | details |
Code
#include <iostream>
#include <unordered_map>
using namespace std;
long n;
long total=0;
char c;
int get(int *ruudukko, int y, int x){
return ruudukko[y*n+x];
}
void set(int *ruudukko, int y, int x, int value){
ruudukko[y*n+x]=value;
}
void haku(int *old_ruudukko, bool *old_Arows, bool *old_Brows, bool *old_Acols, bool *old_Bcols, int Ay, int By){
//cout<<Ay<<" "<<By<<"\n";
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
// cout<<old_ruudukko[i*n+j];
}
//cout<<"\n";
}
bool end=true;
for(int i=0;i<n;i++){
//cout<<old_Arows[i]<<old_Brows[i]<<old_Acols[i]<<old_Bcols[i]<<"\n";
if(old_Arows[i]==0 || old_Brows[i]==0 || old_Acols[i]==0 || old_Bcols[i]==0){
// cout<<"not";
end=false;
}
}
if(end){
total+=1;
return;
}
for(int i=Ay;i<n;i++){
if(old_Arows[Ay]){
// cout<<"a added to "<<i<<"\n";
Ay=i;
}
else{
break;
}
}
for(int i=By;i<n;i++){
if(old_Brows[By]){
// cout<<"b to "<<i<<"\n";
By=i;
}
else{
break;
}
}
if(Ay<=By){
for(int j=0;j<n;j++){
if(!old_Acols[j] and get(old_ruudukko,Ay,j)==0){
bool Arows[n];
bool Acols[n];
for(int i=0;i<n;i++){
Arows[i]=old_Arows[i];
Acols[i]=old_Acols[i];
}
int ruudukko[n*n];
for(int i=0;i<n*n;i++){
ruudukko[i]=old_ruudukko[i];
}
// cout<<"found:\n";
for(int i=0;i<n;i++){
//cout<<old_Acols[i];
}
//cout<<"\n";
set(ruudukko,Ay,j,1);
Arows[Ay]=true;
Acols[j]=true;
haku(ruudukko,Arows,old_Brows,Acols,old_Bcols,Ay+1,By);
//cout<<"fits "<<Ay<<j<<"\n";
}
}
return;
}
else{
for(int j=0;j<n;j++){
if(!old_Bcols[j] and get(old_ruudukko,By,j)==0){
bool Brows[n];
bool Bcols[n];
for(int i=0;i<n;i++){
Brows[i]=old_Brows[i];
Bcols[i]=old_Bcols[i];
}
int ruudukko[n*n];
for(int i=0;i<n*n;i++){
ruudukko[i]=old_ruudukko[i];
}
set(ruudukko,By,j,2);
Brows[By]=true;
Bcols[j]=true;
haku(ruudukko,old_Arows,Brows,old_Acols,Bcols,Ay,By+1);
//cout<<"b fits"<<By<<j<<"\n";
}
}
return;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n;
if(n<2){
cout<<0<<"\n";
exit(0);
}
int ruudukko[n*n];
for(int i=0;i<n;i++){
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>c;
if(c=='.'){
set(ruudukko,i,j,0);
}
else if(c=='A'){
set(ruudukko,i,j,1);
}
else{
set(ruudukko,i,j,2);
}
}
}
for(int i=0; i<n;i++){
for(int j=0; j<n;j++){
//cout<<get(ruudukko,i,j);
}
//cout<<"\n";
}
//cout<<"\n";
bool Arows[n];
bool Brows[n];
bool Acols[n];
bool Bcols[n];
for(int i=0;i<n;i++){
Arows[i]=false;
Brows[i]=false;
Acols[i]=false;
Bcols[i]=false;
for(int j=0;j<n;j++){
if(get(ruudukko,i,j)==1){
Arows[i]=true;
}
if(get(ruudukko,i,j)==2){
Brows[i]=true;
}
if(get(ruudukko,j,i)==1){
Acols[i]=true;
}
if(get(ruudukko,j,i)==2){
Bcols[i]=true;
}
}
}
for(int i=0;i<n;i++){
///cout<<Arows[i]<<"\n";
}
//cout<<"\n";
for(int i=0;i<n;i++){
//cout<<Acols[i];
}
int firstAy=n;
int firstBy=n;
for(int i=0;i<n;i++){
if(!Arows[i]){
firstAy=i;
break;
}
}
for(int i=0;i<n;i++){
if(!Brows[i]){
firstBy=i;
break;
}
}
if(firstBy==n and firstAy==n){
cout<<"1"<<"\n";
exit(0);
}
haku(ruudukko,Arows,Brows,Acols,Bcols,firstAy,firstBy);
cout<<""<<total<<"\n";
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 2 .. .. |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 2
Group: 1
Verdict: WRONG ANSWER
| input |
|---|
| 2 .. A. |
| correct output |
|---|
| 1 |
| user output |
|---|
| 0 |
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: WRONG ANSWER
| input |
|---|
| 5 ....A ..... ..... ..... ... |
| correct output |
|---|
| 264 |
| user output |
|---|
| 0 |
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: RUNTIME ERROR
| input |
|---|
| 444 ................................. |
| correct output |
|---|
| 19906314 |
| user output |
|---|
| (empty) |
Test 17
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 497 ................................. |
| correct output |
|---|
| 224313667 |
| user output |
|---|
| (empty) |
Test 18
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 498 ................................. |
| correct output |
|---|
| 929574601 |
| user output |
|---|
| (empty) |
Test 19
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 499 ................................. |
| correct output |
|---|
| 600226043 |
| user output |
|---|
| (empty) |
Test 20
Group: 2
Verdict: RUNTIME ERROR
| 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: WRONG ANSWER
| input |
|---|
| 499 AB............................... |
| correct output |
|---|
| 2 |
| user output |
|---|
| 0 |
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: ACCEPTED
| input |
|---|
| 500 ...AB............................ |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
