Submission #717975

#TimeUsernameProblemLanguageResultExecution timeMemory
717975vinnipuh01Soccer (JOI17_soccer)C++17
0 / 100
1 ms468 KiB
#include <iostream> #include <bits/stdc++.h> #include <cmath> #include <algorithm> #include <vector> #include <deque> #include <set> #include <stack> #include <string> #include <map> #include <queue> #define int long long #define sqrt sqrtl using namespace std; const long long oo = 1000000000000000000; long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos; /* ViHHiPuh (( `'-""``""-'` )) )-__-_.._-__-( / --- (o _ o) --- \ \ .-* ( .0. ) *-. / _'-. ,_ '=' _, .-'_ / `;#'#'# - #'#'#;` \ \_)) -----'#'----- ((_/ # --------- # '# ------- ------ #' /..-'# ------- #'-.\ _\...-\'# -- #'/-.../_ ((____)- '#' -(____)) cout << fixed << setprecision(6) << x; ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); freopen ( "sum.in", "r", stdin ) */ int h, w, a, b, c, n, x[ 100001 ], y[ 100001 ]; main () { cin >> h >> w >> a >> b >> c >> n; for ( int i = 1; i<= n; i ++ ) { cin >> x[ i ] >> y[ i ]; } if ( n == 2 ) { ans = abs( x[ 1 ] - x[ 2 ] ) + abs( y[ 1 ] - y[ 2 ] ); ans = ans * c; ans = min( ans, abs( x[ 1 ] - x[ 2] ) * c + a * ( y[ 1 ] - y[ 2 ] ) + b ); ans = min( ans, abs( y[ 1] - y[ 2 ] ) * c + a * ( x[ 1] - x[ 2 ] ) + b ); cout << ans; } assert( n == 2 ); }

Compilation message (stderr)

soccer.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main () {
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...