CSES - Datatähti 2019 alku

CSES - Datatähti 2019 alku - Results

Submission details
Task:	Ruudukko
Sender:	jarvenp
Submission time:	2018-10-08 18:24:21 +0300
Language:	C++
Status:	READY
Result:	45

Feedback
group	verdict	score
#1	ACCEPTED	31
#2	ACCEPTED	14
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1	details
#2	ACCEPTED	0.01 s	1	details
#3	ACCEPTED	0.02 s	1	details
#4	ACCEPTED	0.03 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	ACCEPTED	0.02 s	1	details
#9	ACCEPTED	0.01 s	1	details
#10	ACCEPTED	0.02 s	1	details
#11	ACCEPTED	0.03 s	2	details
#12	ACCEPTED	0.02 s	2	details
#13	ACCEPTED	0.04 s	2	details
#14	ACCEPTED	0.06 s	2	details
#15	ACCEPTED	0.11 s	2	details
#16	ACCEPTED	0.17 s	2	details
#17	ACCEPTED	0.23 s	2	details
#18	ACCEPTED	0.22 s	2	details
#19	ACCEPTED	0.24 s	2	details
#20	ACCEPTED	0.23 s	2	details
#21	WRONG ANSWER	0.59 s	3	details
#22	ACCEPTED	0.02 s	3	details
#23	ACCEPTED	0.02 s	3	details
#24	ACCEPTED	0.03 s	3	details
#25	ACCEPTED	0.03 s	3	details
#26	WRONG ANSWER	0.38 s	3	details
#27	ACCEPTED	0.02 s	3	details
#28	ACCEPTED	0.04 s	3	details
#29	ACCEPTED	0.03 s	3	details
#30	ACCEPTED	0.03 s	3	details

Code

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


uint16_t n;
uint64_t counter;
uint64_t taikaluvut[501];
int16_t primes[501][10];

const uint64_t M = (1e9+7);
/*
void taulukot(uint32_t layer, char taul[][505], char goal[][505], 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[505][505];
    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] = '.';
      }
    }
  }
}
*/


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


uint64_t factDiv(uint16_t val1, uint16_t val2, uint16_t val3){
  if(val2 < val3){
    uint16_t temp = val3;
    val3 = val2;
    val2 = temp;
  }
  uint16_t factors[501];
  for(uint16_t i=0; i<501; i++){
    factors[i] = 0;
  }
  factors[1] = 1;
  for(uint16_t i=val2+1; i<=val1; i++){
    for(uint16_t i2=0; primes[i][i2] != -1; i2++){
      factors[primes[i][i2]]++;
    }
  }
  for(uint16_t i=2; i<=val3; i++){
    for(uint16_t i2=0; primes[i][i2] != -1; i2++){
      factors[primes[i][i2]]--;
    }
  }
  uint64_t ans = 1;
  for(uint16_t i=1; i<=val1; i++){
    for(uint16_t i2=0; i2<factors[i]; i2++){
      ans*= i;
      ans %= M;
    }
  }
  return ans;
}

uint64_t perm(uint16_t howMany, uint16_t size){
  if(howMany > size){
    return 0;
  }
  //return((fact(size)/(fact(howMany)*fact(size-howMany)))%M);
  return (factDiv(size, howMany, (size-howMany)));
}

uint64_t solutions(uint16_t size, uint16_t blocks){
  if(size < blocks){
    return 0;
  }
  uint64_t ans = (uint64_t)taikaluvut[size];
  for(uint16_t i=1; i <= (size-blocks); i++){
    ans += (uint64_t)(perm(i,(size-blocks))*(uint64_t)taikaluvut[size-i])%M;
    ans %= M;
  }
  return ans;
}

int main(){
  for(uint16_t i=1; i<501; i++){
    uint16_t num = i;
     uint16_t index = 0;
    for(uint16_t i2=2; num > 1; i2++){    
      while(num%i2 == 0){
	num/= i2;
	primes[i][index] = i2;
	index++;
      }
    }
    primes[i][index] = -1;
  }
  primes[1][0] = 1;
  primes[1][1] = -1;
     taikaluvut[0] = 1;
  taikaluvut[1] = 0;
  taikaluvut[2] = 1;
  for(uint32_t i=3; i<501; i++){
    taikaluvut[i] = (((taikaluvut[i-1]+taikaluvut[i-2])%M)*(i-1))%M;
  }/*
while(1){
    uint16_t a,b,c;
    cin >> a>>b;//>>c;
    // cout << factDiv(a,b,c)<<"\n";
    cout << solutions(a,b)<<"\n";
    }
*/
  cin >> n;
  char goal[505][505];
   for(uint32_t i=0; i<n; i++){
    cin >> goal[i];
  }
  
 
  //if(!empty){
   /*    char taul[505][505];
    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";
    /*  }
  else{  
    cout << (fact(n)*(uint64_t)taikaluvut[n])%M<<"\n";
    }*/
  


  
  uint16_t aAmount = 0;
  for(uint16_t i=0; i<n; i++){
    for(uint16_t i2=0; i2<n; i2++){
      if(goal[i][i2] == 'A'){
	aAmount++;
      }
    }
  }
  uint16_t bAmount = 0;
  for(uint16_t i=0; i<n; i++){
    for(uint16_t i2=0; i2<n; i2++){
      if(goal[i][i2] == 'B'){
	bAmount++;
      }
    }
  }
  uint16_t xSize = n-aAmount;
  uint16_t ySize = n-aAmount;
  uint16_t aSize = n-aAmount;
  uint16_t extraB = 0;
  uint16_t taulSize = n;
  for(uint16_t i=0; i<n; i++){
    for(uint16_t i2=0; i2<n; i2++){
      if(goal[i][i2] == 'B'){
        uint16_t aX = 0;
        uint16_t aY = 0;
	for(uint16_t i3=0; i3<n; i3++){
	  if(goal[i][i3] == 'A'){
	    aX = 1;
	    goal[i][i3] = 'C';
	    break;
	  }
	  else if(goal[i][i3] == 'C'){
	    aX = 2;
	    break;
	  }
	}
	for(uint16_t i3=0; i3<n; i3++){
	  if(goal[i3][i2] == 'A'){
	    aY = 1;
	    goal[i3][i2] = 'C';
	    break;
	  }
	  else if(goal[i3][i2] == 'C'){
	    aY = 2;
	    break;
	  }
	}
	taulSize--;
        if((aY==0) && (aX==0)){
	  xSize--;
	  ySize--;
	  extraB++;
	}
	else if((aY!=0)&&(aX!=0)){
	  if(aY == 1){
	    aAmount--;
	  }
	  if(aX == 1){
	    aAmount--;
	  }
	}
	else if(aY == 1){
	  aAmount--;
	  xSize--;
	}
	else if(aY == 2){
	  xSize--;
	}
	else if(aX==1){
	  aAmount--;
	  ySize--;
	}
	else if(aX == 2){
	  ySize--;
	}
      }
    }
  }
  //  cout << aAmount<<" "<< xSize<<" " << ySize<<" "<<aSize<<" "<<extraB<<" "<<taulSize<<"\n";
  if(xSize < ySize){
    uint16_t temp = xSize;
    xSize = ySize;
    ySize = temp;
  }
  uint64_t ans=0;
  for(int16_t i=ySize; i>= 0; i--){
    // uint64_t b = ((fact(ySize)/fact(ySize-i))*perm(i,xSize))%M;
    uint64_t b = (factDiv(ySize,(ySize-i),1)*perm(i,xSize))%M;
    // cout <<b <<"\n";
    uint16_t tempY = ySize-i;
    uint16_t tempX = xSize-i;
    uint64_t temp = 0;
    for(uint16_t i2=0; (i2 <= tempX)&&(i2 <= aAmount); i2++){
      if((taulSize-ySize-(aAmount-i2)) >= tempX){
	uint64_t temp1 = (((perm(i2, aAmount)*(perm(tempX-i2,taulSize-ySize-aAmount)))%M)*fact(tempX))%M;
	for(uint16_t i3=0; (i3 <= tempY)&& (i3 <= (aAmount-i2)); i3++){
	  if((taulSize-xSize-(aAmount-i2-i3)) >= tempY){
	    uint64_t temp2 = (((perm(i3,aAmount-i2)*(perm(tempY-i3,taulSize-xSize-aAmount+i2)))%M)*fact(tempY))%M;
	    temp += (((temp1*temp2)%M)*solutions(taulSize-i-tempX-tempY, aAmount-i2-i3))%M;
	  }
	}
      }
    }
    // cout <<b<<" "<< temp<<"\n";
    ans += (((b*temp)%M)*solutions(aSize, i+extraB))%M;
    ans %= M;
  }
  cout <<ans<<"\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: ACCEPTED

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

correct output
`306442892` view save

user output
`306442892` view save

Test 12

Group: 2

Verdict: ACCEPTED

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

correct output
`694861480` view save

user output
`694861480` view save

Test 13

Group: 2

Verdict: ACCEPTED

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

correct output
`555319110` view save

user output
`555319110` view save

Test 14

Group: 2

Verdict: ACCEPTED

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

correct output
`108372237` view save

user output
`108372237` view save

Test 15

Group: 2

Verdict: ACCEPTED

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

correct output
`259107857` view save

user output
`259107857` view save

Test 16

Group: 2

Verdict: ACCEPTED

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

correct output
`19906314` view save

user output
`19906314` view save

Test 17

Group: 2

Verdict: ACCEPTED

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

correct output
`224313667` view save

user output
`224313667` view save

Test 18

Group: 2

Verdict: ACCEPTED

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

correct output
`929574601` view save

user output
`929574601` view save

Test 19

Group: 2

Verdict: ACCEPTED

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

correct output
`600226043` view save

user output
`600226043` view save

Test 20

Group: 2

Verdict: ACCEPTED

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

correct output
`198353194` view save

user output
`198353194` view save

Test 21

Group: 3

Verdict: WRONG ANSWER

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

correct output
`840243733` view save

user output
`974233825` view save

Test 22

Group: 3

Verdict: ACCEPTED

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

correct output
`4146290` view save

user output
`4146290` view save

Test 23

Group: 3

Verdict: ACCEPTED

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

correct output
`173518884` view save

user output
`173518884` view save

Test 24

Group: 3

Verdict: ACCEPTED

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

correct output
`20044800` view save

user output
`20044800` view save

Test 25

Group: 3

Verdict: ACCEPTED

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

correct output
`2` view save

user output
`2` view save

Test 26

Group: 3

Verdict: WRONG ANSWER

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

correct output
`121064146` view save

user output
`450415976` view save

Test 27

Group: 3

Verdict: ACCEPTED

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

correct output
`848435259` view save

user output
`848435259` view save

Test 28

Group: 3

Verdict: ACCEPTED

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

correct output
`296240911` view save

user output
`296240911` view save

Test 29

Group: 3

Verdict: ACCEPTED

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

correct output
`2196` view save

user output
`2196` view save

Test 30

Group: 3

Verdict: ACCEPTED

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

correct output
`1` view save

user output
`1` view save

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)