QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#676833 | #7781. Sheep Eat Wolves | Genesis | WA | 0ms | 3672kb | C++14 | 945b | 2024-10-26 01:10:32 | 2024-10-26 01:10:33 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int main()
{
int x1, y1, p, q;
cin >> x1 >> y1 >> p >> q;
int x2 = 0, y2 = 0;
int xx = 0, yy = 0;
int t = true;
int ans = 0;
if (x1 <= p) {
cout << 1 << endl;
return 0;
}
if (y1 - p - x1 == q) {
ans += 2;
y1 -= p;
y2 += p;
}
while (1)
{
//cout << x1 << " " << y1 << endl;
xx = 0, yy = 0;
if (x1 <= p) {
ans++;
break;
}
if (y1 - p - x1 >= q) {
ans = -1;
break;
}
for (int i = 0; i <= p; i++)
if (y1 - i - (x1 - (p - i)) <= q) {
yy = i, xx = p - i;
y1 -= i, x1 -= (p - i);
}
x2 += xx;
if (x2 + q <= y2 + yy) {
int t = x2 + q - y2;
y2 = x2 + q;
yy = yy - t;
}
else {
y2 += yy;
yy = 0;
}
if (yy >= p) {
ans = -1;
break;
}
y1 += yy;
ans += 2;
}
cout << ans << endl;
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3672kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3484kb
input:
3 5 2 0
output:
-1
result:
wrong answer 1st numbers differ - expected: '5', found: '-1'