QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#629664#7781. Sheep Eat WolvesMrlaolu#WA 0ms3712kbC++202.1kb2024-10-11 14:08:412024-10-11 14:08:41

Judging History

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

  • [2024-10-11 14:08:41]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3712kb
  • [2024-10-11 14:08:41]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"

void solve() {
    int x,y,p,q;cin >> x >> y >> p >> q;
    if(y - p > x + q){cout << -1 << endl;return;}
    int ans = 0;
    int lx,ly,tx,ty,rx,ry;
    lx = x,ly = y,tx = ty = rx = ry = 0;

    while(lx) {
        if(lx <= p){ans++;break;}
        ly += ty;lx += tx;ty = 0;tx = 0;
        int spare = p - ty - tx;
        if(lx + q < ly) {
            int add = min(ly - lx - q,spare);
            ty += add;ly -= add;
        }
        spare = p - ty - tx;
        if(lx + q > ly) {
            int add = min(lx + q - ly ,spare);
            tx += add;lx -= add;
        }

        spare = p - ty - tx;
        if(lx + q == ly && spare) {
            ty += spare / 2;ly -= spare / 2;
            tx += spare / 2;lx -= spare / 2;
            if(spare % 2) {
                ty += 1;ly -= 1;
            }
        }
        spare = p - ty - tx;
        ans++;
        if(lx + q < ly){ans = -1;break;}  //?

        ry += ty;rx += tx;ty = 0;tx = 0;
        spare = p - ty - tx;
        ans++;
        if(rx == 0){continue;}
        if(rx + q < ry) {
            int add = min(ry - rx - q,spare);
            ty += add;ry -= add;
        }

        if(rx + q < ry){ans = -1;break;}
    }

    cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    //cin >> _;
    while(_--) {
        solve();
    }
}

// while(lx) {
//     if(lx <= p){ans++;lx = 0;break;}
//     else if(ly == q + lx) {
//         ans += 2;
//         if(q % 2 == 0) {
//             ly -= q / 2;
//             lx -= q / 2;
//             ry += q / 2;
//             rx += q / 2;
//         }else {
//             ly -= q / 2;
//             lx -= q / 2 + 1;
//             ry += q / 2;
//             rx += q / 2 + 1;
//         }
//     }else {
//         ans += 2;
//         int mx = 0,my = 0;
//         mx = min(p,lx + q - ly);
//         my = p - mx;
//         lx -= mx;rx += mx;
//         ly -= my;ry += my;
//     }
//     // if(ry - p > rx){ans = -1;break;}
// }

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 4 3 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3708kb

input:

3 5 2 0

output:

5

result:

ok 1 number(s): "5"

Test #3:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

2 5 1 1

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

1 1 1 0

output:

1

result:

ok 1 number(s): "1"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

3 3 1 1

output:

7

result:

ok 1 number(s): "7"

Test #6:

score: 0
Accepted
time: 0ms
memory: 3704kb

input:

3 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #7:

score: 0
Accepted
time: 0ms
memory: 3660kb

input:

10 9 1 10

output:

19

result:

ok 1 number(s): "19"

Test #8:

score: 0
Accepted
time: 0ms
memory: 3704kb

input:

15 20 2 5

output:

27

result:

ok 1 number(s): "27"

Test #9:

score: 0
Accepted
time: 0ms
memory: 3660kb

input:

18 40 16 7

output:

5

result:

ok 1 number(s): "5"

Test #10:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

60 60 8 1

output:

27

result:

ok 1 number(s): "27"

Test #11:

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

input:

60 60 8 4

output:

27

result:

ok 1 number(s): "27"

Test #12:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

60 60 8 8

output:

25

result:

ok 1 number(s): "25"

Test #13:

score: 0
Accepted
time: 0ms
memory: 3656kb

input:

60 60 16 1

output:

13

result:

ok 1 number(s): "13"

Test #14:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

60 60 16 8

output:

11

result:

ok 1 number(s): "11"

Test #15:

score: 0
Accepted
time: 0ms
memory: 3656kb

input:

60 60 16 16

output:

11

result:

ok 1 number(s): "11"

Test #16:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

60 60 16 24

output:

9

result:

ok 1 number(s): "9"

Test #17:

score: 0
Accepted
time: 0ms
memory: 3648kb

input:

75 15 1 1

output:

175

result:

ok 1 number(s): "175"

Test #18:

score: 0
Accepted
time: 0ms
memory: 3656kb

input:

50 100 1 0

output:

-1

result:

ok 1 number(s): "-1"

Test #19:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

100 100 10 10

output:

35

result:

ok 1 number(s): "35"

Test #20:

score: 0
Accepted
time: 0ms
memory: 3660kb

input:

100 100 10 1

output:

37

result:

ok 1 number(s): "37"

Test #21:

score: 0
Accepted
time: 0ms
memory: 3704kb

input:

100 100 10 20

output:

33

result:

ok 1 number(s): "33"

Test #22:

score: 0
Accepted
time: 0ms
memory: 3656kb

input:

100 100 10 30

output:

31

result:

ok 1 number(s): "31"

Test #23:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

100 100 10 80

output:

21

result:

ok 1 number(s): "21"

Test #24:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

100 100 1 100

output:

199

result:

ok 1 number(s): "199"

Test #25:

score: -100
Wrong Answer
time: 0ms
memory: 3656kb

input:

100 100 5 0

output:

97

result:

wrong answer 1st numbers differ - expected: '95', found: '97'