oj.uz

답안 #46733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
46733 2018-04-22T16:09:21 Z maksim_gaponov Soccer (JOI17_soccer) C++14
5 / 100
 2 ms 484 KB 
#define _CRT_SECURE_NO_WARNINGS
#ifdef KEK
#define FILE_IN "input.txt"
#define FILE_OUT "output.txt"
#endif
#include <iostream>
#include <cstdlib>
#include <climits>
#include <set>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;
typedef long long ll;

void openFiles() {
#ifdef KEK
	assert(freopen(FILE_IN, "r", stdin));
	assert(freopen(FILE_OUT, "w", stdout));
#endif
}

struct Point {
    int x, y;
};

int main() {
	openFiles();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    int h, w;
    cin >> h >> w;
    ll A, B, C;
    cin >> A >> B >> C;
    int n;
    cin >> n;
    Point s, t;
    cin >> s.x >> s.y;
    cin >> t.x >> t.y;
    ll ans = LLONG_MAX;
    ans = min(ans, (abs(s.x - t.x) + abs(s.y - t.y)) * C);
    ans = min(ans, abs(s.x - t.x) * C + abs(s.y - t.y) * A + B);
    ans = min(ans, abs(s.y - t.y) * C + abs(s.x - t.x) * A + B);
    cout << ans;
	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 484 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Incorrect 2 ms 484 KB Output isn't correct
7 Halted 0 ms 0 KB -