QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #637510 | #7781. Sheep Eat Wolves | yuanyq5523 | WA | 0ms | 3836kb | C++20 | 3.0kb | 2024-10-13 13:08:09 | 2024-10-13 13:08:10 |
Judging History
answer
/*
ANALYSIS:
*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <ctime>
#include <random>
#define int long long
#define i32 signed
#define endl '\n'
using namespace std;
const int MaxN=5;
int sp,wf,ma,q,hsp,hwf,status,ans;
//struct node{int a,b,c,d;node(int A,int B,int C,int D){a=A,b=B,c=C,d=D;}node(){}
//bool operator<(const node& b)const{if(this->a!=b.a)return this->a<b.a;if(this->b!=b.b)return this->b<b.b;if(this->c!=b.c)return this->c<b.c; return this->d<b.d;}};
//set<node>S;
void solution()
{
//sp=rand()%20+1;wf=rand()%20+1;ma=rand()%4+1;q=rand()%4;
cin>>sp>>wf>>ma>>q;
//cout<<"问题"<<endl;cout<<sp<<' '<<wf<<' '<<ma<<' '<<q<<endl;
int psp=sp,pwf=wf;
hsp=hwf=0;
status=1;//out; 2 is home
ans=0;
//cout<<"过程"<<endl;
while(sp!=0)
{
ans++;
if(status==1)
{
if(sp<=ma)
{
hsp+=sp;
sp=0;
break;
}
for(int cnt=1;cnt<=ma;cnt++)
{
if(sp+q<=wf&&sp!=0)
{
if(wf==0)continue;
wf--;
hwf++;
}
else if(sp+q>wf)
{
if(sp==0)continue;
sp--;
hsp++;
}
}
if(wf>sp+q&&sp!=0)
{
cout<<-1<<endl;
return;
}
status=2;
}
else
{
for(int cnt=1;cnt<=ma;cnt++)
{
if(hsp+q<hwf&&hsp!=0)
{
if(hwf==0)continue;
hwf--;
wf++;
}
else
{
;
}
}
if(hwf>hsp+q&&hsp!=0)
{
cout<<-1<<endl;
return;
}
status=1;
}
if(ans>1000005)
{
cout<<-1<<endl;
return;
}
//cout<<sp<<' '<<wf<<' '<<hsp<<' '<<hwf<<' '<<status<<endl;
}
int ans1=ans;
sp=psp;wf=pwf-ma;
hsp=0;hwf=ma;
status=2;//out; 2 is home
ans=1;
//cout<<"过程"<<endl;
while(sp!=0)
{
ans++;
if(status==1)
{
if(sp<=ma)
{
hsp+=sp;
sp=0;
break;
}
for(int cnt=1;cnt<=ma;cnt++)
{
if(sp+q<=wf&&sp!=0)
{
if(wf==0)continue;
wf--;
hwf++;
}
else if(sp+q>wf)
{
if(sp==0)continue;
sp--;
hsp++;
}
}
if(wf>sp+q&&sp!=0)
{
cout<<-1<<endl;
return;
}
status=2;
}
else
{
for(int cnt=1;cnt<=ma;cnt++)
{
if(hsp+q<hwf&&hsp!=0)
{
if(hwf==0)continue;
hwf--;
wf++;
}
else
{
;
}
}
if(hwf>hsp+q&&hsp!=0)
{
cout<<-1<<endl;
return;
}
status=1;
}
if(ans>1000005)
{
cout<<-1<<endl;
return;
}
//cout<<sp<<' '<<wf<<' '<<hsp<<' '<<hwf<<' '<<status<<endl;
}
int ans2=ans;
//cout<<"答案"<<endl;
cout<<min(ans1,ans2)<<endl;
}
i32 main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
//preprocess();
int T=1;
//cin>>T;
srand(time(0));
while(T--)
{
solution();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3704kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3768kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3780kb
input:
10 9 1 10
output:
19
result:
ok 1 number(s): "19"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3684kb
input:
15 20 2 5
output:
27
result:
ok 1 number(s): "27"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
75 15 1 1
output:
175
result:
ok 1 number(s): "175"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
50 100 1 0
output:
-1
result:
ok 1 number(s): "-1"
Test #19:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3768kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
100 100 5 0
output:
95
result:
ok 1 number(s): "95"
Test #26:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
100 100 25 3
output:
13
result:
ok 1 number(s): "13"
Test #27:
score: 0
Accepted
time: 0ms
memory: 3792kb
input:
100 100 30 4
output:
11
result:
ok 1 number(s): "11"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
95 100 3 3
output:
125
result:
ok 1 number(s): "125"
Test #29:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
98 99 50 6
output:
5
result:
ok 1 number(s): "5"
Test #30:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
100 100 45 4
output:
7
result:
ok 1 number(s): "7"
Test #31:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
100 100 40 39
output:
7
result:
ok 1 number(s): "7"
Test #32:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
100 100 45 19
output:
7
result:
ok 1 number(s): "7"
Test #33:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
100 100 49 99
output:
5
result:
ok 1 number(s): "5"
Test #34:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
100 100 49 100
output:
5
result:
ok 1 number(s): "5"
Test #35:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
100 100 49 98
output:
5
result:
ok 1 number(s): "5"
Test #36:
score: 0
Accepted
time: 0ms
memory: 3836kb
input:
100 100 49 97
output:
5
result:
ok 1 number(s): "5"
Test #37:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
100 100 49 96
output:
5
result:
ok 1 number(s): "5"
Test #38:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
100 100 49 95
output:
5
result:
ok 1 number(s): "5"
Test #39:
score: 0
Accepted
time: 0ms
memory: 3832kb
input:
100 100 100 0
output:
1
result:
ok 1 number(s): "1"
Test #40:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
1 100 1 0
output:
1
result:
ok 1 number(s): "1"
Test #41:
score: -100
Wrong Answer
time: 0ms
memory: 3652kb
input:
90 100 5 5
output:
89
result:
wrong answer 1st numbers differ - expected: '87', found: '89'