QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#82076 | #5575. Knight's Tour Redux | RUET_phoenix | WA | 2ms | 3420kb | C++14 | 526b | 2023-02-27 02:02:16 | 2023-02-27 02:02:19 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define pb push_back
int main() {
int n ;
cin>>n ;
if( n == 1 or n == 6 or n ==8 )
{
cout<<"POSSIBLE\n" ;
if (n == 1) cout << "1 1\n" ;
else if (n == 6) {
cout << "1 1\n4 2\n3 5\n6 6\n5 3\n2 4\n" ;
}
else {
cout << "1 1\n4 2\n7 3\n8 6\n5 5\n6 8\n3 7\n2 4\n" ;
}
}
else
{
cout<<"IMPOSSIBLE\n" ;
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3420kb
input:
1
output:
POSSIBLE 1 1
result:
ok answer = 1
Test #2:
score: 0
Accepted
time: 0ms
memory: 3244kb
input:
2
output:
IMPOSSIBLE
result:
ok answer = 0
Test #3:
score: 0
Accepted
time: 2ms
memory: 3240kb
input:
3
output:
IMPOSSIBLE
result:
ok answer = 0
Test #4:
score: 0
Accepted
time: 2ms
memory: 3208kb
input:
4
output:
IMPOSSIBLE
result:
ok answer = 0
Test #5:
score: -100
Wrong Answer
time: 2ms
memory: 3256kb
input:
5
output:
IMPOSSIBLE
result:
wrong answer jury has the better answer: jans = 1, pans = 0 (1 is Possible)