제출 #837232

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
837232		_martynas	Soccer (JOI17_soccer)	C++11	5 / 100	1 ms	308 KiB

soccer

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int mxn = 1e5+5;

int h, w, n;
ll A, B, C;
ll s[mxn], t[mxn];

int main(int argc, char const *argv[]) {
    cin >> h >> w >> A >> B >> C;
    cin >> n;
    for(int i = 0; i < n; i++) cin >> s[i] >> t[i];
    if(C <= A) {
        cout << C*(labs(s[0]-s[n-1])+labs(t[0]-t[n-1])) << "\n";
        return 0;
    }
    if(n == 2) {
        cout << min(C*(labs(s[0]-s[n-1])+labs(t[0]-t[n-1])), C*min(labs(s[0]-s[n-1]), labs(t[0]-t[n-1]))+A*max(labs(s[0]-s[n-1]), labs(t[0]-t[n-1]))+B) << "\n";
    }
    else {
        cout << "0\n";
    }
    return 0;
}

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