| Task: | Lähetit |
| Sender: | |
| Submission time: | 2015-07-19 21:23:35 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 12 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 12 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.09 s | 1 | details |
| #2 | ACCEPTED | 0.08 s | 1 | details |
| #3 | ACCEPTED | 0.09 s | 1 | details |
| #4 | ACCEPTED | 0.08 s | 1 | details |
| #5 | ACCEPTED | 0.08 s | 1 | details |
| #6 | ACCEPTED | 0.23 s | 2 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #10 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define N 1000000007
int n,k;
bool b[100][100];
ll c = 0;
bool ok(int x, int y)
{
int i = x; int j = y;
while (i >= 0 && j >= 0) {
if (b[i--][j--]) return false;
}
i = x; j = y;
while (i < n && j < n) {
if (b[i++][j++]) return false;
}
i = x; j = y;
while (i >= 0 && j < n) {
if (b[i--][j++]) return false;
}
while (i < n && j >= 0) {
if (b[i++][j--]) return false;
}
return true;
}
void backtrack(int x, int y, int l)
{
if (l == 0) {
c = (c+1)%N;
return;
}
for (int i = x; i < n; i++) {
for (int j = y; j < n; j++) {
if (ok(i,j)) {
b[i][j] = true;
backtrack(i,j,l-1);
b[i][j] = false;
}
}
x = 0; y = 0;
}
}
int main()
{
cin >> n >> k;
backtrack(0,0,k);
cout << c << "\n";
}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: ACCEPTED
| input |
|---|
| 5 8 |
| correct output |
|---|
| 32 |
| user output |
|---|
| 32 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 5 10 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 6
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 10 4 |
| correct output |
|---|
| 1809464 |
| user output |
|---|
| 1809464 |
Test 7
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 8 |
| correct output |
|---|
| 209594075 |
| user output |
|---|
| (empty) |
Test 8
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 12 |
| correct output |
|---|
| 811277399 |
| user output |
|---|
| (empty) |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 16 |
| correct output |
|---|
| 17275136 |
| user output |
|---|
| (empty) |
Test 10
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 20 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 40 |
| correct output |
|---|
| 126883191 |
| user output |
|---|
| (empty) |
Test 12
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 80 |
| correct output |
|---|
| 785497039 |
| user output |
|---|
| (empty) |
Test 13
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 120 |
| correct output |
|---|
| 324216296 |
| user output |
|---|
| (empty) |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 160 |
| correct output |
|---|
| 895190039 |
| user output |
|---|
| (empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 200 |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
