QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #344401 | #5575. Knight's Tour Redux | zhicheng | WA | 0ms | 3848kb | C++14 | 1.1kb | 2024-03-04 14:44:03 | 2024-03-04 14:44:04 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int p;
void ans(int x,int y){
printf("%d %d\n",x+p-1,y+p-1);
}
int main(){
int n,q;
scanf("%d",&n);
if(n==1){
printf("POSSIBLE\n1 1");
return 0;
}
if(n<=5){
printf("IMPOSSIBLE");
return 0;
}
printf("POSSIBLE\n");
q=(n%6==0?n/6:n/6-1);
for(int i=1;i<=q;i++){
p=(i-1)*6+1;
ans(1,1);
ans(2,4);
ans(5,5);
ans(6,2);
ans(3,3);
ans(4,6);
}
p=q*6+1;
if(n%6==1){
ans(1,1);
ans(2,4);
ans(5,5);
ans(6,2);
ans(3,3);
ans(4,6);
p=(q+1)*6+1;
ans(1,1);
}
else if(n%6==2){
ans(1,1);
ans(2,4);
ans(3,7);
ans(6,8);
ans(7,5);
ans(8,2);
ans(5,3);
ans(4,6);
}
else if(n%6==3){
ans(1,1);
ans(2,4);
ans(3,7);
ans(6,8);
ans(9,9);
ans(8,6);
ans(7,3);
ans(4,2);
ans(5,5);
}
else if(n%6==4){
ans(1,1);
ans(2,4);
ans(3,7);
ans(4,10);
ans(7,9);
ans(10,8);
ans(9,5);
ans(8,2);
ans(5,3);
ans(6,6);
}
else if(n%6==5){
ans(1,1);
ans(2,4);
ans(3,7);
ans(4,10);
ans(7,9);
ans(6,6);
ans(5,3);
ans(8,2);
ans(9,5);
ans(10,8);
ans(11,11);
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3824kb
input:
1
output:
POSSIBLE 1 1
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
2
output:
IMPOSSIBLE
result:
ok answer = 0
Test #3:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
3
output:
IMPOSSIBLE
result:
ok answer = 0
Test #4:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
4
output:
IMPOSSIBLE
result:
ok answer = 0
Test #5:
score: -100
Wrong Answer
time: 0ms
memory: 3816kb
input:
5
output:
IMPOSSIBLE
result:
wrong answer jury has the better answer: jans = 1, pans = 0 (1 is Possible)