QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #688970 | #9251. Graph Changing | YipChip# | WA | 0ms | 3708kb | C++14 | 1.3kb | 2024-10-30 14:36:41 | 2024-10-30 14:36:42 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
int t, n, k, x, y;
cin >> t >> n >> k >> x >> y;
if (x > y) swap(x, y);
if (!t) return cout << y - x << "\n", void();
if (k == 1) return cout << "1\n", void();
if (t > 2) cout << "-1\n";
if (t == 2)
{
if (k > 3) cout << "-1\n";
if (k == 3)
{
if (y - x >= k) cout << "-1\n";
else
{
if (x > k || y + k <= n) cout << "-1\n";
else if (x + k <= n && y > k) cout << "1\n";
else cout << "-1\n";
}
}
if (k == 2)
{
if (y - x >= k) cout << "1\n";
else
{
if (x > k || y + k <= n) cout << "1\n";
else if (x + k <= n && y > k) cout << "1\n";
else cout << "-1\n";
}
}
}
if (t == 1)
{
if (y - x >= k) cout << "1\n";
else
{
if (x > k || y + k <= n) cout << "2\n";
else if (x + k <= n && y > k) cout << "3\n";
else cout << "-1\n";
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int T;
cin >> T;
while (T -- ) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3708kb
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: 3644kb
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: -100
Wrong Answer
time: 0ms
memory: 3640kb
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:
wrong answer 23rd lines differ - expected: '-1', found: '1'