QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#620290#9251. Graph Changingucup-team5071#WA 0ms3704kbC++141.3kb2024-10-07 17:23:042024-10-07 17:23:15

Judging History

你现在查看的是最新测评结果

  • [2024-10-07 17:23:15]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3704kb
  • [2024-10-07 17:23:04]
  • 提交

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){
				if (n <= 4 || n >= 6){
					cout << -1 << "\n";
				} else if (n == 5) {
					if (x == 2 && y == 4){
						cout << 3 << "\n";
					} else {
						cout << -1 << "\n";
					}
				}
			} else {
				cout << -1 << "\n";
			}
		}
	}	
	
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3700kb

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: 3572kb

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: 3696kb

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: 3704kb

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'