Submission #1236195

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236195		Geforgs	Soccer (JOI17_soccer)	C++20	5 / 100	0 ms	328 KiB

soccer

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
//#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, m, k, A, B, C, i, res;
    cin>>n>>m;
    cin>>A>>B>>C;
    cin>>k;
    vector<pair<ll, ll>> a(k);
    for(i=0;i<k;++i){
        cin>>a[i].first>>a[i].second;
    }
    res = (abs(a[0].first - a[1].first) + abs(a[0].second - a[1].second))*C;
    res = min(res, abs(a[0].first - a[1].first)*C + B + A*abs(a[0].second - a[1].second));
    res = min(res, abs(a[0].second - a[1].second)*C + B + A*abs(a[0].first - a[1].first));
    cout<<res<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

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