| Task: | Lista |
| Sender: | Hannes |
| Submission time: | 2020-09-06 16:57:56 +0300 |
| Language: | C++11 |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #2 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #4 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #5 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #6 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #7 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #8 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #9 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #10 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #11 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #12 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #13 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #14 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #15 | WRONG ANSWER | 0.01 s | 2, 3 | details |
| #16 | WRONG ANSWER | 0.01 s | 3 | details |
| #17 | WRONG ANSWER | 0.01 s | 3 | details |
| #18 | WRONG ANSWER | 0.01 s | 3 | details |
| #19 | WRONG ANSWER | 0.01 s | 3 | details |
| #20 | WRONG ANSWER | 0.01 s | 3 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'bool solve(int)':
input/code.cpp:28:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for (int i=0;i<n;++i) cout << A[i] << " ";cout << endl;
^~~
input/code.cpp:28:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
for (int i=0;i<n;++i) cout << A[i] << " ";cout << endl;
^~~~Code
#include <bits/stdc++.h>
using namespace std;
int n, nn;
const int N=2020;
int p[N];
int A[1010];
bool check() {
// for (int i=0;i<n;++i) cout << A[i] << " ";cout << endl;
for (int i=1;i<n;++i) if (p[A[i]+A[i+1]]) return 0;
return 1;
}
bool solve(int n) {
for (int s=0;s<n*n;++s) {
for (int i=0;i<n;++i) {
if (~i&1) {
A[i]=i+1;
A[i]+=2*(s/n);
if (A[i]>n) A[i]-=n-1;
}else {
A[i]=nn+2*(s%n)-i+1;
if (A[i]>n)A[i]-=n-1;
}
}
if (check()) {
for (int i=0;i<n;++i) cout << A[i] << " ";cout << endl;
return 1;
}
}
return 0;
}
int main() {
p[0]=1;p[1]=1;
for (int i=2;i<N;++i) {
if (p[i]) continue;
for (int j=i+i;j<N;j+=i) p[j]=1;
}
/*
for (int i=0;i<1000;++i) {
if (!solve(1000)) { cout << "QAQ\n" << endl; return 0;}
cout << i << endl;
}
return 0;//*/
cin >> n;
if (!solve(n)) cout << "QAQ\n" << endl;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2 |
| correct output |
|---|
| 1 2 |
| user output |
|---|
| 1 2 |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 |
| correct output |
|---|
| 1 2 3 |
| user output |
|---|
| 1 0 3 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 4 |
| correct output |
|---|
| 1 2 3 4 |
| user output |
|---|
| 1 4 3 2 |
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 5 |
| correct output |
|---|
| 3 4 1 2 5 |
| user output |
|---|
| 1 2 3 0 5 |
Test 5
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 6 |
| correct output |
|---|
| 3 4 1 2 5 6 |
| user output |
|---|
| 1 2 3 0 5 -2 |
Test 6
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 7 |
| correct output |
|---|
| 3 4 1 2 5 6 7 |
| user output |
|---|
| 1 2 3 0 5 -2 7 |
Test 7
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 8 |
| correct output |
|---|
| 7 6 5 2 1 4 3 8 |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 |
Test 8
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 9 |
| correct output |
|---|
| 7 6 5 2 1 4 3 8 9 |
| user output |
|---|
| 3 0 5 -2 7 -4 9 -6 3 |
Test 9
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 |
| correct output |
|---|
| 7 6 5 2 1 4 3 8 9 10 |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 9 -6 |
Test 10
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 19 |
| correct output |
|---|
| 17 14 3 8 15 16 13 6 5 2 1 4 9... |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 9 -6 11 -8 1... |
Test 11
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 56 |
| correct output |
|---|
| 55 54 53 50 51 52 49 48 13 28 ... |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 9 -6 11 -8 1... |
Test 12
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 70 |
| correct output |
|---|
| 67 4 1 2 9 32 35 38 65 66 61 4... |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 9 -6 11 -8 1... |
Test 13
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 76 |
| correct output |
|---|
| 73 66 61 42 59 54 53 50 51 52 ... |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 9 -6 11 -8 1... |
Test 14
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 90 |
| correct output |
|---|
| 87 86 11 18 29 44 45 16 55 58 ... |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 9 -6 11 -8 1... |
Test 15
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100 |
| correct output |
|---|
| 97 96 95 78 25 82 81 56 71 68 ... |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 9 -6 11 -8 1... |
Test 16
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 154 |
| correct output |
|---|
| 151 6 5 92 137 134 149 84 143 ... |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 9 -6 11 -8 1... |
Test 17
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 430 |
| correct output |
|---|
| 427 426 371 372 367 376 375 35... |
| user output |
|---|
| 1 2 3 0 5 -2 7 -4 9 -6 11 -8 1... |
Test 18
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 629 |
| correct output |
|---|
| 627 404 227 146 83 150 77 74 3... |
| user output |
|---|
| 3 236 5 234 7 232 9 230 11 228... |
Test 19
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 833 |
| correct output |
|---|
| 829 828 793 574 523 516 515 51... |
| user output |
|---|
| 3 656 5 654 7 652 9 650 11 648... |
Test 20
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 885 |
| correct output |
|---|
| 883 724 723 878 881 726 721 71... |
| user output |
|---|
| 3 806 5 804 7 802 9 800 11 798... |
Test 21
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 |
| correct output |
|---|
| 997 996 737 884 995 492 991 20... |
| user output |
|---|
| (empty) |