제출 #1290434

#제출 시각아이디문제언어결과실행 시간메모리
1290434hackstarSoccer (JOI17_soccer)C++20
0 / 100
1 ms568 KiB
// #pragma GCC optimize("Ofast,O3,unroll-loops") // #pragma GCC target("avx,avx2") #include<bits/stdc++.h> #include<random> using namespace std; #ifdef CM #include "debug.h" #else #define debug(...) 42 #endif #define pb emplace_back #define ALL(x) (x).begin(),(x).end() #define rALL(x) (x).rbegin(),(x).rend() #define srt(x) sort(ALL(x)) #define rev(x) reverse(ALL(x)) #define rsrt(x) sort(rALL(x)) #define sz(x) (int)(x.size()) #define aura 1e18 #define pii pair<int,int> void die(string S){puts(S.c_str());exit(0);} #define int long long const int mod=1e9+7; void solve() { int n,m; cin>>n>>m; int a,b,c; cin>>a>>b>>c; int s; cin>>s; int x1,y1,x2,y2; cin>>x1>>y1>>x2>>y2; int ans=+aura; ans=min(ans,c*(abs(x1-x2)+abs(y1-y1))); ans=min(ans,(a*abs(y1-y2)+b) + c*abs(x1-x2)); ans=min(ans,a*abs(x1-x2)+b + c*abs(y1-y2)); cout<<ans<<'\n'; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t=1; #ifdef CM freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); #endif // cin>>t; while(t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...