Task: | Lähetit |
Sender: | |
Submission time: | 2015-07-18 17:30: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.08 s | 1 | details |
#2 | ACCEPTED | 0.09 s | 1 | details |
#3 | ACCEPTED | 0.09 s | 1 | details |
#4 | ACCEPTED | 0.10 s | 1 | details |
#5 | ACCEPTED | 0.08 s | 1 | details |
#6 | TIME LIMIT EXCEEDED | -- | 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 |
Compiler report
input/code.cpp: In function 'void solve(std::vector<std::vector<bool> >, LL, LL)': input/code.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(LL i = pos; i < positions.size(); i++){ ^
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; vector<pair<LL,LL> > positions; void solve(vector<vector<bool> > available, LL pos, LL left){ if(left == 0){ ans++; return; } for(LL i = pos; i < positions.size(); i++){ LL r = positions[i].first; LL c = positions[i].second; 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, i + 1, left - 1); } } } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for(LL r = 0; r < n; r++){ for(LL c = 0; c < n; c++){ positions.push_back(make_pair(r,c)); } } vector<vector<bool> > available(n, vector<bool>(n,true)); solve(available,0,k); cout << ans << 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: 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: TIME LIMIT EXCEEDED
input |
---|
10 4 |
correct output |
---|
1809464 |
user output |
---|
(empty) |
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) |