CSES - Putka Open 2015 – 1/6 - Results
Submission details
Task:Lähetit
Sender:
Submission time:2015-07-18 17:21:29 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.08 s1details
#2ACCEPTED0.12 s1details
#3ACCEPTED1.33 s1details
#4--1details
#5--1details
#6--2details
#7--2details
#8--2details
#9--2details
#10--2details
#11--3details
#12--3details
#13--3details
#14--3details
#15--3details

Code

#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <utility>

using namespace std;

typedef long long LL;

LL ans = 0;
LL n, k;
    
void solve(vector<vector<bool> > available, LL left){
    /*for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cout << available[i][j];
        }
        cout << endl;
    } cout << endl;*/

    if(left == 0){
//        cout << "++" << endl;

        ans++; return;
    }

    for(LL r = 0; r < n; r++){
        for(LL c = 0; c < n; c++){
            if(available[r][c]){
                vector<vector<bool> > available_new = available;
                LL r2 = r - c;
                for(LL c2 = 0; c2 < n; c2++, r2++){

                    if(r2 >= 0 && r2 < n)
                        available_new[r2][c2] = false;
                }
                r2 = r + c;
                for(LL c2 = 0; c2 < n; c2++, r2--){
                    if(r2 >= 0 && r2 < n)
                        available_new[r2][c2] = false;
                }
                solve(available_new, left - 1);
            }
        }
    }
}

LL factorial(LL x){
    LL res = 1;
    for(LL i = 1; i <= x; i++)
        res *= i;
    return res;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> k;
    vector<vector<bool> > available(n, vector<bool>(n,true));
    solve(available,k);
    
    cout << ans/factorial(k) << endl;
    
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
5 2

correct output
240

user output
240

Test 2

Group: 1

Verdict: ACCEPTED

input
5 4

correct output
2728

user output
2728

Test 3

Group: 1

Verdict: ACCEPTED

input
5 6

correct output
1960

user output
1960

Test 4

Group: 1

Verdict:

input
5 8

correct output
32

user output
(empty)

Test 5

Group: 1

Verdict:

input
5 10

correct output
0

user output
(empty)

Test 6

Group: 2

Verdict:

input
10 4

correct output
1809464

user output
(empty)

Test 7

Group: 2

Verdict:

input
10 8

correct output
209594075

user output
(empty)

Test 8

Group: 2

Verdict:

input
10 12

correct output
811277399

user output
(empty)

Test 9

Group: 2

Verdict:

input
10 16

correct output
17275136

user output
(empty)

Test 10

Group: 2

Verdict:

input
10 20

correct output
0

user output
(empty)

Test 11

Group: 3

Verdict:

input
100 40

correct output
126883191

user output
(empty)

Test 12

Group: 3

Verdict:

input
100 80

correct output
785497039

user output
(empty)

Test 13

Group: 3

Verdict:

input
100 120

correct output
324216296

user output
(empty)

Test 14

Group: 3

Verdict:

input
100 160

correct output
895190039

user output
(empty)

Test 15

Group: 3

Verdict:

input
100 200

correct output
0

user output
(empty)