[백준 1459번] 걷기 (C++)
문제링크 : https://www.acmicpc.net/problem/1459#include using namespace std;typedef long long ll;ll X, Y, W, S;int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin >> X >> Y >> W >> S; ll gap = max(X,Y)-min(X,Y); //직선만 ll tmp1 = (X+Y)*W; //대각선 + 직선 ll tmp2 = min(X,Y)*S + gap*W; //대각선만 (대각선만 불가하면 마지막 직선) ll tmp3 = gap%2==0 ? (min(X, Y) + gap) * S : (min(X, Y) + g..
백준/실버
2025. 4. 23. 19:58