QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #620399 | #9251. Graph Changing | ucup-team5071 | WA | 0ms | 3700kb | C++14 | 1.5kb | 2024-10-07 17:57:00 | 2024-10-07 17:57:01 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
bool ava(int a,int b,int c){
return abs(b-a) >= c;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int q;
cin >> q;
while(q--){
int t,n,k,x,y;
cin >> t >> n >> k >> x >> y;
if (x > y) swap(x,y);
if (t == 0){
cout << y-x << "\n";
} else if (k == 1){
cout << 1 << "\n";
} else if (t == 1){
if (k >= n) {
cout << -1 << "\n";
} else if (y-x >= k){
cout << 1 << "\n";
} else {
if (ava(x,n,k) && ava(y,n,k)){
cout << 2 << "\n";
} else if (ava(x,1,k) && ava(y,1,k)){
cout << 2 << "\n";
} else {
bool flag1 = (ava(x,1,k) || ava(x,n,k));
bool flag2 = (ava(y,1,k) || ava(y,n,k));
if (flag1 && flag2) {
cout << 3 << "\n";
} else {
cout << -1 << "\n";
}
}
}
} else if (t >= 2){
if (k == 2){
if (n <= 3){
cout << -1 << "\n";
} else {
if (t & 1){
cout << ((y-x==1)? 2 : 1)<< "\n";
} else {
cout << y-x << "\n";
}
}
} else if (k == 3 && t == 2){
if (ava(x,y,k)){
cout << -1 << "\n";
} else if (ava(x,n,k) && ava(y,n,k)){
cout << -1 << "\n";
} else if (ava(x,1,k) && ava(y,1,k)){
cout << -1 << "\n";
} else {
bool flag1 = (ava(x,1,k) || ava(x,n,k));
bool flag2 = (ava(y,1,k) || ava(y,n,k));
if (flag1 && flag2) {
cout << 1 << "\n";
} else {
cout << -1 << "\n";
}
}
} else {
cout << -1 << "\n";
}
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
input:
5 1 5 3 2 4 1 10 4 2 4 2 10 5 2 4 1 3 2 1 3 1 3 2 1 2
output:
3 2 -1 1 -1
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3700kb
input:
30 1 2 1 1 2 1 2 2 1 2 1 2 3 1 2 1 2 4 1 2 1 2 5 1 2 1 2 6 1 2 2 2 1 1 2 2 2 2 1 2 2 2 3 1 2 2 2 4 1 2 2 2 5 1 2 2 2 6 1 2 3 2 1 1 2 3 2 2 1 2 3 2 3 1 2 3 2 4 1 2 3 2 5 1 2 3 2 6 1 2 4 2 1 1 2 4 2 2 1 2 4 2 3 1 2 4 2 4 1 2 4 2 5 1 2 4 2 6 1 2 5 2 1 1 2 5 2 2 1 2 5 2 3 1 2 5 2 4 1 2 5 2 5 1 2 5 2 6 1 2
output:
1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1
result:
ok 30 lines
Test #3:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
90 1 3 1 1 2 1 3 1 1 3 1 3 1 2 3 1 3 2 1 2 1 3 2 1 3 1 3 2 2 3 1 3 3 1 2 1 3 3 1 3 1 3 3 2 3 1 3 4 1 2 1 3 4 1 3 1 3 4 2 3 1 3 5 1 2 1 3 5 1 3 1 3 5 2 3 1 3 6 1 2 1 3 6 1 3 1 3 6 2 3 2 3 1 1 2 2 3 1 1 3 2 3 1 2 3 2 3 2 1 2 2 3 2 1 3 2 3 2 2 3 2 3 3 1 2 2 3 3 1 3 2 3 3 2 3 2 3 4 1 2 2 3 4 1 3 2 3 4 2...
output:
1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
ok 90 lines
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3616kb
input:
180 1 4 1 1 2 1 4 1 1 3 1 4 1 1 4 1 4 1 2 3 1 4 1 2 4 1 4 1 3 4 1 4 2 1 2 1 4 2 1 3 1 4 2 1 4 1 4 2 2 3 1 4 2 2 4 1 4 2 3 4 1 4 3 1 2 1 4 3 1 3 1 4 3 1 4 1 4 3 2 3 1 4 3 2 4 1 4 3 3 4 1 4 4 1 2 1 4 4 1 3 1 4 4 1 4 1 4 4 2 3 1 4 4 2 4 1 4 4 3 4 1 4 5 1 2 1 4 5 1 3 1 4 5 1 4 1 4 5 2 3 1 4 5 2 4 1 4 5 ...
output:
1 1 1 1 1 1 2 1 1 3 1 2 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 2 3 1 2 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 2 1 1 2 1 2 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1...
result:
wrong answer 82nd lines differ - expected: '3', found: '2'