제출 #1290415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290415		muhammadali_2009	Soccer (JOI17_soccer)	C++20	0 / 100	1 ms	572 KiB

soccer

// +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ // 
#include <bits/stdc++.h> 
//#include<ext/pb_ds/assoc_container.hpp> 
//#include<ext/pb_ds/tree_policy.hpp> 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0) 
#define endl '\n' 
#define ll long long 
#define int long long 
#define all(x) x.begin(), x.end() 
#define all1(x) x.rbegin(), x.rend() 
#define seea(x) for(int i = 0; i < x; i++) 
#define pb push_back 
#define ff first 
#define vc vector 
#define ss second 
#define ld long double 

using namespace std; 
//using namespace __gnu_pbds; 
//typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; 
const int mod = 1e9 + 7; 

void solve(){
    int n, m; cin >> n >> m;
    int aa, b, c; cin >> aa >> b >> c;
    int q; cin >> q;
    vc<pair<int, int>>a(q);
    seea(q)cin >> a[i].ff >> a[i].ss;
    int ans = 1e9;
    if(a[0].ff == a[1].ff){
        ans = min(ans, aa * abs(a[0].ss - a[1].ss) + b);
    }
    if(a[0].ss == a[1].ss){
        ans = min(ans, aa * abs(a[0].ff - a[1].ff) + b);
    }
    int p = c;
    //c = 1; aa = 1; b = 0;
    ans = min(ans, c * (abs(a[0].ff - a[1].ff) + abs(a[0].ss - a[1].ss)));
    ans = min(ans, c * abs(a[0].ff - a[1].ff) + aa * abs(a[0].ss - a[1].ss) + b);
    ans = min(ans, c * abs(a[0].ss - a[1].ss) + aa * abs(a[0].ff - a[1].ff) + b);
    cout << ans << endl;
}   

signed main(){ 
    fast; 
    int t = 1; 
    //cin >> t; 
    while (t --){ 
        solve(); 
    } 
}

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