QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#284076 | #7781. Sheep Eat Wolves | bachbeo2007 | AC ✓ | 36ms | 4076kb | C++23 | 2.5kb | 2023-12-15 23:52:52 | 2024-09-05 08:34:28 |
Judging History
answer
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=105;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
int res=1;
while(n){
if(n&1) res=res*a%mod;
a=a*a%mod;n>>=1;
}
return res;
}
const int iroot=power(3,mod-2);
const int base=131;
int X,Y,p,q,dp[maxn][maxn][2];
queue<piii> qq;
void f(int xt,int yt,int t){
vector<int> x(2),y(2);
x[t]=xt;y[t]=yt;
x[t^1]=X-xt;y[t^1]=Y-yt;
for(int dx=0;dx<=xt && dx<=p;dx++) for(int dy=0;dy<=yt && dx+dy<=p;dy++){
int nx=x[t^1]+dx,ny=y[t^1]+dy;
int px=x[t]-dx,py=y[t]-dy;
if((px && px+q<py) || dp[nx][ny][t^1]!=-1) continue;
dp[nx][ny][t^1]=dp[xt][yt][t]+1;
qq.push({{nx,ny},t^1});
}
}
void solve(){
cin >> X >> Y >> p >> q;
memset(dp,-1,sizeof(dp));
dp[X][Y][0]=0;
qq.push({{X,Y},0});
int res=inf;
while(!qq.empty()){
piii cur=qq.front();qq.pop();
if(cur.fi.fi==X && cur.se==1) res=min(res,dp[cur.fi.fi][cur.fi.se][cur.se]);
f(cur.fi.fi,cur.fi.se,cur.se);
}
cout << (res==inf?-1:res) << '\n';
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int test=1;//cin >> test;
while(test--) solve();
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3772kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3792kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 4036kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3832kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3768kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 0ms
memory: 4000kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3792kb
input:
10 9 1 10
output:
19
result:
ok 1 number(s): "19"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3964kb
input:
15 20 2 5
output:
27
result:
ok 1 number(s): "27"
Test #9:
score: 0
Accepted
time: 1ms
memory: 3876kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 1ms
memory: 3832kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3772kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 1ms
memory: 3748kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3872kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 1ms
memory: 3808kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 2ms
memory: 3888kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3736kb
input:
75 15 1 1
output:
175
result:
ok 1 number(s): "175"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
50 100 1 0
output:
-1
result:
ok 1 number(s): "-1"
Test #19:
score: 0
Accepted
time: 1ms
memory: 4000kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 1ms
memory: 4000kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 2ms
memory: 3976kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 2ms
memory: 3808kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 0ms
memory: 3788kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 1ms
memory: 3800kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: 0
Accepted
time: 1ms
memory: 3964kb
input:
100 100 5 0
output:
95
result:
ok 1 number(s): "95"
Test #26:
score: 0
Accepted
time: 4ms
memory: 3992kb
input:
100 100 25 3
output:
13
result:
ok 1 number(s): "13"
Test #27:
score: 0
Accepted
time: 6ms
memory: 4076kb
input:
100 100 30 4
output:
11
result:
ok 1 number(s): "11"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
95 100 3 3
output:
125
result:
ok 1 number(s): "125"
Test #29:
score: 0
Accepted
time: 12ms
memory: 3816kb
input:
98 99 50 6
output:
5
result:
ok 1 number(s): "5"
Test #30:
score: 0
Accepted
time: 13ms
memory: 3844kb
input:
100 100 45 4
output:
7
result:
ok 1 number(s): "7"
Test #31:
score: 0
Accepted
time: 18ms
memory: 3876kb
input:
100 100 40 39
output:
7
result:
ok 1 number(s): "7"
Test #32:
score: 0
Accepted
time: 18ms
memory: 3832kb
input:
100 100 45 19
output:
7
result:
ok 1 number(s): "7"
Test #33:
score: 0
Accepted
time: 30ms
memory: 3868kb
input:
100 100 49 99
output:
5
result:
ok 1 number(s): "5"
Test #34:
score: 0
Accepted
time: 30ms
memory: 3920kb
input:
100 100 49 100
output:
5
result:
ok 1 number(s): "5"
Test #35:
score: 0
Accepted
time: 30ms
memory: 3916kb
input:
100 100 49 98
output:
5
result:
ok 1 number(s): "5"
Test #36:
score: 0
Accepted
time: 30ms
memory: 3996kb
input:
100 100 49 97
output:
5
result:
ok 1 number(s): "5"
Test #37:
score: 0
Accepted
time: 27ms
memory: 3920kb
input:
100 100 49 96
output:
5
result:
ok 1 number(s): "5"
Test #38:
score: 0
Accepted
time: 30ms
memory: 3920kb
input:
100 100 49 95
output:
5
result:
ok 1 number(s): "5"
Test #39:
score: 0
Accepted
time: 36ms
memory: 3892kb
input:
100 100 100 0
output:
1
result:
ok 1 number(s): "1"
Test #40:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
1 100 1 0
output:
1
result:
ok 1 number(s): "1"
Test #41:
score: 0
Accepted
time: 1ms
memory: 3800kb
input:
90 100 5 5
output:
87
result:
ok 1 number(s): "87"
Test #42:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
100 1 1 0
output:
199
result:
ok 1 number(s): "199"
Test #43:
score: 0
Accepted
time: 5ms
memory: 3772kb
input:
94 61 22 35
output:
9
result:
ok 1 number(s): "9"
Test #44:
score: 0
Accepted
time: 3ms
memory: 3828kb
input:
61 92 36 6
output:
7
result:
ok 1 number(s): "7"
Test #45:
score: 0
Accepted
time: 1ms
memory: 3868kb
input:
73 89 12 4
output:
57
result:
ok 1 number(s): "57"
Test #46:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
71 80 4 3
output:
-1
result:
ok 1 number(s): "-1"
Test #47:
score: 0
Accepted
time: 1ms
memory: 3852kb
input:
44 75 2 31
output:
85
result:
ok 1 number(s): "85"
Test #48:
score: 0
Accepted
time: 1ms
memory: 3752kb
input:
48 62 5 18
output:
35
result:
ok 1 number(s): "35"
Test #49:
score: 0
Accepted
time: 5ms
memory: 3780kb
input:
73 100 22 49
output:
9
result:
ok 1 number(s): "9"
Extra Test:
score: 0
Extra Test Passed