QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #620376 | #9251. Graph Changing | ucup-team5071 | WA | 0ms | 3672kb | C++14 | 1.0kb | 2024-10-07 17:50:04 | 2024-10-07 17:50:05 |
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;
int dis;
if (x > y) swap(x,y);
if (t == 0) {
cout << y-x << "\n";
continue;
}
if (k >= n) {
dis = -1;
} else if (y-x >= k){
dis = 1;
} else {
if (ava(x,n,k) && ava(y,n,k)){
dis = 2;
} else if (ava(x,1,k) && ava(y,1,k)){
dis = 2;
} else {
bool flag1 = (ava(x,1,k) || ava(x,n,k));
bool flag2 = (ava(y,1,k) || ava(y,n,k));
if (flag1 && flag2) {
dis = 3;
} else {
dis = -1;
}
}
}
if (dis == -1) {
cout << -1 << "\n"; continue;
} else if (t == 1){
cout << dis << "\n"; continue;
}else if (t == 2){
if (dis >= k) {
cout << 1 << "\n"; continue;
} else {
cout << -1 << "\n"; continue;
}
} else {
cout << -1 << "\n"; continue;
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3672kb
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: -100
Wrong Answer
time: 0ms
memory: 3652kb
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:
wrong answer 13th lines differ - expected: '1', found: '-1'