CSES - Datatähti 2019 alku

CSES - Datatähti 2019 alku - Results

Submission details
Task:	Ruudukko
Sender:	jarvenp
Submission time:	2018-10-02 22:00:46 +0300
Language:	C++
Status:	READY
Result:	31

Feedback
group	verdict	score
#1	ACCEPTED	31
#2	TIME LIMIT EXCEEDED	0
#3	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1	details
#2	ACCEPTED	0.03 s	1	details
#3	ACCEPTED	0.01 s	1	details
#4	ACCEPTED	0.01 s	1	details
#5	ACCEPTED	0.03 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.03 s	1	details
#10	ACCEPTED	0.03 s	1	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	RUNTIME ERROR	0.02 s	2	details
#14	RUNTIME ERROR	0.01 s	2	details
#15	RUNTIME ERROR	0.02 s	2	details
#16	RUNTIME ERROR	0.02 s	2	details
#17	RUNTIME ERROR	0.02 s	2	details
#18	RUNTIME ERROR	0.02 s	2	details
#19	RUNTIME ERROR	0.02 s	2	details
#20	RUNTIME ERROR	0.02 s	2	details
#21	RUNTIME ERROR	0.01 s	3	details
#22	RUNTIME ERROR	0.03 s	3	details
#23	RUNTIME ERROR	0.03 s	3	details
#24	RUNTIME ERROR	0.02 s	3	details
#25	RUNTIME ERROR	0.02 s	3	details
#26	RUNTIME ERROR	0.03 s	3	details
#27	RUNTIME ERROR	0.02 s	3	details
#28	RUNTIME ERROR	0.02 s	3	details
#29	RUNTIME ERROR	0.01 s	3	details
#30	RUNTIME ERROR	0.02 s	3	details

Code

#include <bits/stdc++.h>
#include <stdint.h>
using namespace std;


uint32_t n;
uint64_t counter;

const uint64_t M = 1e9+7;
uint64_t sum(uint32_t amount, uint32_t size){
  if(amount == 1){
    return size;
  }
  uint64_t ans = 0;
  uint32_t temp = size-1;
  while(amount-1 <= temp){
    ans += sum(amount-1, temp);
    temp--;
  }
  return ans;
}

uint64_t fact(uint32_t val){
  uint64_t ans=1;
  for(uint32_t i=1; i<=val; i++){
    ans *= i;
    ans %=M;
  }
  return ans;
}



void taulukot(uint32_t layer, char taul[][100], char goal[][100], uint16_t aUsed, uint16_t bUsed){
  if(layer == n){
    bool match = true;
    for(uint32_t i=0; i<n; i++){
      //  cout << taul[i]<<"\n";
      for(uint32_t i2=0; i2<n; i2++){
	if((taul[i][i2] != goal[i][i2]) && (goal[i][i2] != '.')){
	  match = false;
	  break;
	}
      }
      if(!match){
	break;
      }
    }
    if(match){
      counter++;
    }
    //   cout << "\n";
  }
  else{
    char temp[100][100];
    for(uint32_t i=0; i<n; i++){
      for(uint32_t i2=0; i2<n; i2++){
	temp[i][i2] = taul[i][i2];
      }
      temp[i][n] = 0;
    }
    for(uint32_t i=0; i<n; i++){
      //cout <<"b\n";
      if(((aUsed>>i)&1) == 0){
	//cout << "a\n";
	aUsed = aUsed | (1<<i);
	temp[layer][i] = 'A';
	for(uint32_t i2=0; i2<n; i2++){
	  if((((bUsed>>i2)&1) == 0) && (i2 != i)){
	    // cout << i<<" "<<temp[layer][i]<<"\n";
	    bUsed = bUsed | (1<<i2);
	    temp[layer][i2] = 'B';
	    taulukot(layer+1, temp, goal, aUsed, bUsed);
	    bUsed = bUsed & ~(1<<i2);
	    temp[layer][i2] = '.';
	  }
	}
	aUsed = aUsed & ~(1<<i);
	temp[layer][i] = '.';
      }
    }
  }
}

int main(){
  cin >> n;
   char goal[100][100];
    for(uint32_t i=0; i<n; i++){
      cin >> goal[i];
    }
  /*
  uint64_t ans = (fact(n-1)-1)*(sum(1,n))%M;
  for(uint32_t i=2; i<(n-1); i++){
    uint64_t temp = ((fact(n-i)-1)*sum(i,n))%M;
    if(temp > ans){
      ans += M;
    }
    ans-= temp;
  }
  ans+= 1;
  ans = ((fact(n)-ans)*fact(n))%M;
  cout << ans<<"\n";*/
  char taul[100][100];
  for(uint32_t i=0; i<n; i++){
    for(uint32_t i2=0; i2<n; i2++){
      taul[i][i2] = '.';
    }
    taul[i][n] = 0;
  }
  counter = 0;
  taulukot(0,taul,goal,0,0);
  cout << counter<<"\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: TIME LIMIT EXCEEDED

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

correct output
`306442892` view save

user output
(empty)

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

correct output
`694861480` view save

user output
(empty)

Test 13

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`555319110` view save

user output
(empty)

Error:

*** stack smashing detected ***: <unknown> terminated

Test 14

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`108372237` view save

user output
(empty)

Test 15

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`259107857` view save

user output
(empty)

Test 16

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`19906314` view save

user output
(empty)

Test 17

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`224313667` view save

user output
(empty)

Test 18

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`929574601` view save

user output
(empty)

Test 19

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`600226043` view save

user output
(empty)

Test 20

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`198353194` view save

user output
(empty)

Test 21

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`840243733` view save

user output
(empty)

Test 22

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`4146290` view save

user output
(empty)

Test 23

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`173518884` view save

user output
(empty)

Test 24

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`20044800` view save

user output
(empty)

Test 25

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`2` view save

user output
(empty)

Test 26

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`121064146` view save

user output
(empty)

Test 27

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`848435259` view save

user output
(empty)

Test 28

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`296240911` view save

user output
(empty)

Test 29

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`2196` view save

user output
(empty)

Test 30

Group: 3

Verdict: RUNTIME ERROR

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

correct output
`1` view save

user output
(empty)

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 (jarvenp)