Submission #530708

#	Time	Username	Problem	Language	Result	Execution time	Memory
530708		browntoad	Soccer (JOI17_soccer)	C++14	5 / 100	1 ms	308 KiB

soccer

#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif

const ll inf = (1ll<<60);
const int iinf=2147483647;
const ll mod = 998244353;
const ll maxn=3005;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}

ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}

signed main(){
    IOS();
    int h,w; cin>>h>>w;
    int a,b,c; cin>>a>>b>>c;
    pii st, en;
    int n; cin>>n;
    cin>>st.f>>st.s>>en.f>>en.s;
    int dis=abs(en.s-st.s)+abs(en.f-st.f);
    int l=abs(en.s-st.s), r=abs(en.f-st.f);
    int ans=inf;
    REP(i,min(dis, max(l, r))+1){
        int rem=dis-i;
        if (rem==dis){
            ans=min(ans, c*rem);
        }
        else ans=min(ans, a*i+b+c*rem);
    }
    cout<<ans<<endl;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 30
• Subtask 3: 0 / 65