Submission #709227

#TimeUsernameProblemLanguageResultExecution timeMemory
709227myrcellaSoccer (JOI17_soccer)C++17
5 / 100
1 ms212 KiB
//by szh #include<bits/stdc++.h> using namespace std; #define fi first #define se second #define pii pair<int,int> #define pll pair<long long,long long> #define pb push_back #define debug(x) cerr<<#x<<"="<<x<<endl #define pq priority_queue #define inf 0x3f #define rep(i,a,b) for (int i=a;i<(b);i++) #define MP make_pair #define SZ(x) (int(x.size())) #define ll long long #define mod 1000000007 #define ALL(x) x.begin(),x.end() void inc(int &a,int b) {a=(a+b)%mod;} void dec(int &a,int b) {a=(a-b+mod)%mod;} int lowbit(int x) {return x&(-x);} ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;} int n; int r,c; ll A,B,C; void solve() { int x,y,xx,yy; cin>>x>>y>>xx>>yy; ll ans = abs(xx-x) + abs(yy-y); ans *= C; ans = min(ans,abs(xx-x)*A+B + abs(yy-y)*C); ans = min(ans,abs(xx-x)*C + abs(yy-y)*A+B); cout<<ans; } int main() { // freopen("input.txt","r",stdin); std::ios::sync_with_stdio(false);cin.tie(0); cin>>r>>c>>A>>B>>C>>n; if (n==2) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...