Task: | Grid |
Sender: | bciobanu |
Submission time: | 2017-01-22 16:08:49 +0200 |
Language: | C++ |
Status: | READY |
Result: | 35 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 35 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.04 s | 1 | details |
#2 | ACCEPTED | 0.04 s | 1 | details |
#3 | ACCEPTED | 0.04 s | 1 | details |
#4 | ACCEPTED | 0.03 s | 1 | details |
#5 | ACCEPTED | 0.04 s | 1 | details |
#6 | ACCEPTED | 0.05 s | 1 | details |
#7 | ACCEPTED | 0.05 s | 1 | details |
#8 | ACCEPTED | 0.05 s | 1 | details |
#9 | ACCEPTED | 0.05 s | 1 | details |
#10 | ACCEPTED | 0.04 s | 2 | details |
#11 | ACCEPTED | 0.04 s | 2 | details |
#12 | TIME LIMIT EXCEEDED | -- | 2 | details |
#13 | TIME LIMIT EXCEEDED | -- | 2 | details |
#14 | TIME LIMIT EXCEEDED | -- | 2 | details |
#15 | TIME LIMIT EXCEEDED | -- | 2 | details |
#16 | ACCEPTED | 0.05 s | 3 | details |
#17 | ACCEPTED | 0.03 s | 3 | details |
#18 | TIME LIMIT EXCEEDED | -- | 3 | details |
#19 | TIME LIMIT EXCEEDED | -- | 3 | details |
#20 | TIME LIMIT EXCEEDED | -- | 3 | details |
#21 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include <bits/stdc++.h> #define SZ(x) ((int) (x).size()) using namespace std; typedef long long int64; int main(void) { int n; cin >> n; if (n <= 3) { cout << "QAQ\n"; return 0; } vector<int> permutation(n * n); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { permutation[i * n + j] = 1 + j; } } int iter = 0; srand(time(0)); do { random_shuffle(permutation.begin(), permutation.end()); vector<bool> mark(n * n + 1); bool bad = false; for (int i = 0; i < n; i++) { int sum = 0; for (int j = 0; j < n; j++) { sum += permutation[i * n + j]; } if (mark[sum] == true) { bad = true; break; } mark[sum] = true; } if (bad) { continue; } for (int i = 0; i < n; i++) { int sum = 0; for (int j = 0; j < n; j++) { sum += permutation[j * n + i]; } if (mark[sum] == true) { bad = true; break; } mark[sum] = true; } if (not bad) { iter++; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cout << permutation[i * n + j] << ' '; } cout << '\n'; } cout << '\n'; if (iter == 1) { break; } } } while (1); }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
2 |
correct output |
---|
QAQ |
user output |
---|
QAQ |
Test 2
Group: 1
Verdict: ACCEPTED
input |
---|
3 |
correct output |
---|
QAQ |
user output |
---|
QAQ |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
3 4 3 4 3 1 1 2 4 4 3 2 2 2 1 1 |
user output |
---|
4 4 3 4 2 2 1 3 1 2 1 3 2 4 1 3 |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
5 |
correct output |
---|
2 3 4 1 1 3 4 2 1 2 4 2 3 1 3 4 3 2 1 4 5 5 5 5 5 |
user output |
---|
4 1 4 2 2 1 2 5 1 1 3 2 3 2 4 3 3 4 3 5 5 1 5 4 5 ... |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
6 |
correct output |
---|
2 3 4 5 1 1 3 4 5 2 1 2 4 5 2 3 1 3 5 2 3 4 1 4 5 4 3 2 1 5 ... |
user output |
---|
2 2 2 2 2 3 6 1 1 3 4 1 6 1 5 6 4 1 6 4 3 6 5 5 5 4 5 4 4 2 ... |
Test 6
Group: 1
Verdict: ACCEPTED
input |
---|
7 |
correct output |
---|
2 3 4 5 6 1 1 3 4 5 6 2 1 2 4 5 6 2 3 1 3 5 6 2 3 4 1 4 6 2 3 4 5 1 5 ... |
user output |
---|
7 6 1 1 5 4 5 7 2 2 4 2 6 5 4 5 7 6 4 7 2 7 6 2 6 6 4 5 3 3 3 1 4 3 1 ... |
Test 7
Group: 1
Verdict: ACCEPTED
input |
---|
8 |
correct output |
---|
2 3 4 5 6 7 1 1 3 4 5 6 7 2 1 2 4 5 6 7 2 3 1 3 5 6 7 2 3 4 1 4 6 7 2 3 4 5 1 5 ... |
user output |
---|
7 7 6 3 4 2 2 6 5 8 5 7 4 6 5 8 3 3 2 3 3 4 1 5 5 5 1 7 2 6 5 2 1 8 3 8 6 6 1 7 ... |
Test 8
Group: 1
Verdict: ACCEPTED
input |
---|
9 |
correct output |
---|
2 3 4 5 6 7 8 1 1 3 4 5 6 7 8 2 1 2 4 5 6 7 8 2 3 1 3 5 6 7 8 2 3 4 1 4 6 7 8 2 3 4 5 1 5 ... |
user output |
---|
5 5 4 1 2 5 8 1 3 8 4 4 3 6 1 5 4 1 2 9 7 9 3 1 4 8 7 9 9 2 5 5 4 4 9 9 8 6 5 2 3 7 3 6 1 ... |
Test 9
Group: 1
Verdict: ACCEPTED
input |
---|
10 |
correct output |
---|
2 3 4 5 6 7 8 9 1 1 3 4 5 6 7 8 9 2 1 2 4 5 6 7 8 9 2 3 1 3 5 6 7 8 9 2 3 4 1 4 6 7 8 9 2 3 4 5 1 5 ... |
user output |
---|
7 6 7 1 2 2 6 6 1 3 5 10 6 6 9 9 5 9 4 3 8 7 3 3 5 6 4 4 10 6 9 4 1 5 1 8 8 4 1 2 5 1 4 3 2 8 2 1 10 3 ... |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
3 |
correct output |
---|
QAQ |
user output |
---|
QAQ |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
3 4 3 4 3 1 1 2 4 4 3 2 2 2 1 1 |
user output |
---|
2 3 4 3 1 1 3 2 4 1 4 4 2 1 3 2 |
Test 12
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
29 |
correct output |
---|
2 3 4 5 6 7 8 9 10 11 12 13 14... |
user output |
---|
(empty) |
Test 13
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
48 |
correct output |
---|
2 3 4 5 6 7 8 9 10 11 12 13 14... |
user output |
---|
(empty) |
Test 14
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
80 |
correct output |
---|
2 3 4 5 6 7 8 9 10 11 12 13 14... |
user output |
---|
(empty) |
Test 15
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
97 |
correct output |
---|
2 3 4 5 6 7 8 9 10 11 12 13 14... |
user output |
---|
(empty) |
Test 16
Group: 3
Verdict: ACCEPTED
input |
---|
3 |
correct output |
---|
QAQ |
user output |
---|
QAQ |
Test 17
Group: 3
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
3 4 3 4 3 1 1 2 4 4 3 2 2 2 1 1 |
user output |
---|
4 2 4 4 1 1 3 1 2 3 4 3 2 1 2 3 |
Test 18
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
111 |
correct output |
---|
2 3 4 5 6 7 8 9 10 11 12 13 14... |
user output |
---|
(empty) |
Test 19
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
506 |
correct output |
---|
2 3 4 5 6 7 8 9 10 11 12 13 14... |
user output |
---|
(empty) |
Test 20
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
844 |
correct output |
---|
2 3 4 5 6 7 8 9 10 11 12 13 14... |
user output |
---|
(empty) |
Test 21
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
991 |
correct output |
---|
2 3 4 5 6 7 8 9 10 11 12 13 14... |
user output |
---|
(empty) |