QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #697436 | #7781. Sheep Eat Wolves | QF_love_younger_sister | WA | 1ms | 3688kb | C++23 | 3.1kb | 2024-11-01 14:04:55 | 2024-11-01 14:04:56 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
signed main(){
int x,y,q,p;
cin >> x >> y >> p >> q;
if(p>=x){
cout << 1;
return 0;
}
if(q>=y){
cout << (x+p-1)/p*2-1;
return 0;
}
if(q==0){
if(y>x+p){
cout << -1;
return 0;
}
else{
int qf=-1;
for(int k=1; k<=p; k++){
if(2*k>=p-q && x-p<=k) qf=5;
}
int cs=0;
int yang;
if(y!=x+q+p){
int duo=y-x-q;
int kong=p-duo;
if(x>=y) yang=y;
else yang=x;
if(kong<=0){
cout << -1;
return 0;
}
int cs=duo/p*2;
int yu=duo%p,jl=1e9+10;
int qf1=-1;
while(yang+yu>p){
int dang=kong-yu;
yu=0;
int lang1=dang/2;
int yang1=(dang)/2;
yang-=yang1;
cs+=2;
if(qf1==-1){
for(int k=1; k<=p; k++){
if(2*k>=p-q && yang-p<=k) qf1=5;
}
jl=cs;
}
}
// cout << zuolang << " " << zuoyang << " " << p << " " << cw << "\n";
if(yang+yu>0){
cs++;
}
else cs--;
// cout << cs << "\n";
// cout << jl << " " << cs <<"\n";
if(qf!=-1 && cs!=0 && jl==1e9+10){
cout << min(qf,cs);
}
else if(qf!=-1 && cs!=0 && qf1==5){
cout << min(qf,min(cs-jl,5)+jl);
}
if(qf!=-1){
cout << qf;
}
else if(cs!=0 && qf1!=5){
cout << cs;
}
else if(cs!=0 && qf1==5){
cout << min(cs-jl,5)+jl;
}else cout << -1;
return 0;
}
}
}
if(y>x+q){
int cs=0;
if(y>x+q+p){
cout << -1;
return 0;
}
else{
int qf=-1;
if(y!=x+q+p){
// int qf1=-1;
int duo=y-x-q;
int kong=p-duo;
int lang=(kong+1)/2+duo;
int yang=kong/2;
int zuolang=y-lang,zuoyang=x-yang;
lang=lang-min(lang,yang+q);
yang=0;
cs+=2;
int cw=p-lang;
if(zuolang==zuoyang+q){
//先狼
if(zuoyang>p){
cs+=((zuoyang-p)*2+cw-1)/cw*2+1;
}
else cs++;
}
else{
//先羊
if(zuoyang>p){
cs+=((zuoyang-p)*2-1+cw-1)/cw*2+1;
}
else cs++;
}
// cout << zuolang << " " << zuoyang << " " << p << " " << cw << "\n";
}
for(int k=1; k<=p; k++){
if(2*k>=p-q && x-p<=k) qf=5;
}
if(qf!=-1 && cs!=0){
cout << min(qf,cs);
}
else if(qf!=-1){
cout << qf;
}
else if(cs!=0){
cout << cs;
}
else cout << -1;
}
}
else{
//一次运走
if(p>=x){
cout << 1;
return 0;
}
//一次运不走
else{
// if(y>=q){
// cout << (x+p-1)/p*2-1;
// return 0;
// }
int duo=x-max(0,y-q);
int yang=max(0,y-q);
int cs=duo/p*2;
int yu=duo%p;
int flag1=1;
// cout << duo << " " << yang << "\n";
while(yang+yu>p){
int dang=p-yu;
yu=0;
if(flag1){
int yang1=dang/2;
int lang1=(dang+1)/2;
if(yang1!=lang1) flag1=0;
yang-=yang1;
// cout << yang1 << "\n";
}
else{
int lang1=dang/2;
int yang1=(dang+1)/2;
if(yang1!=lang1) flag1=1;
yang-=yang1;
// cout << yang1 << "\n";
}
cs+=2;
}
if(yang+yu>0){
cs++;
}
else cs--;
cout << cs;
return 0;
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3608kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3680kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 1ms
memory: 3492kb
input:
10 9 1 10
output:
19
result:
ok 1 number(s): "19"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
15 20 2 5
output:
27
result:
ok 1 number(s): "27"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3684kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
75 15 1 1
output:
175
result:
ok 1 number(s): "175"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
50 100 1 0
output:
-1
result:
ok 1 number(s): "-1"
Test #19:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
100 100 5 0
output:
95
result:
ok 1 number(s): "95"
Test #26:
score: 0
Accepted
time: 0ms
memory: 3488kb
input:
100 100 25 3
output:
13
result:
ok 1 number(s): "13"
Test #27:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
100 100 30 4
output:
11
result:
ok 1 number(s): "11"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
95 100 3 3
output:
125
result:
ok 1 number(s): "125"
Test #29:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
98 99 50 6
output:
5
result:
ok 1 number(s): "5"
Test #30:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
100 100 45 4
output:
7
result:
ok 1 number(s): "7"
Test #31:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
100 100 40 39
output:
7
result:
ok 1 number(s): "7"
Test #32:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
100 100 45 19
output:
7
result:
ok 1 number(s): "7"
Test #33:
score: 0
Accepted
time: 0ms
memory: 3524kb
input:
100 100 49 99
output:
5
result:
ok 1 number(s): "5"
Test #34:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
100 100 49 100
output:
5
result:
ok 1 number(s): "5"
Test #35:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
100 100 49 98
output:
5
result:
ok 1 number(s): "5"
Test #36:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
100 100 49 97
output:
5
result:
ok 1 number(s): "5"
Test #37:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
100 100 49 96
output:
5
result:
ok 1 number(s): "5"
Test #38:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
100 100 49 95
output:
5
result:
ok 1 number(s): "5"
Test #39:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
100 100 100 0
output:
1
result:
ok 1 number(s): "1"
Test #40:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
1 100 1 0
output:
1
result:
ok 1 number(s): "1"
Test #41:
score: -100
Wrong Answer
time: 0ms
memory: 3624kb
input:
90 100 5 5
output:
-1
result:
wrong answer 1st numbers differ - expected: '87', found: '-1'