zoukankan      html  css  js  c++  java
  • codeforces 883M. Quadcopter Competition 思路

    M. Quadcopter Competition
    time limit per test
    3 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Polycarp takes part in a quadcopter competition. According to the rules a flying robot should:

    • start the race from some point of a field,
    • go around the flag,
    • close cycle returning back to the starting point.

    Polycarp knows the coordinates of the starting point (x1, y1) and the coordinates of the point where the flag is situated (x2, y2). Polycarp’s quadcopter can fly only parallel to the sides of the field each tick changing exactly one coordinate by 1. It means that in one tick the quadcopter can fly from the point (x, y) to any of four points: (x - 1, y), (x + 1, y), (x, y - 1) or (x, y + 1).

    Thus the quadcopter path is a closed cycle starting and finishing in (x1, y1) and containing the point (x2, y2) strictly inside.

    The picture corresponds to the first example: the starting (and finishing) point is in (1, 5) and the flag is in (5, 2).

    What is the minimal length of the quadcopter path?

    Input

    The first line contains two integer numbers x1 and y1 ( - 100 ≤ x1, y1 ≤ 100) — coordinates of the quadcopter starting (and finishing) point.

    The second line contains two integer numbers x2 and y2 ( - 100 ≤ x2, y2 ≤ 100) — coordinates of the flag.

    It is guaranteed that the quadcopter starting point and the flag do not coincide.

    Output

    Print the length of minimal path of the quadcopter to surround the flag and return back.

    Examples
    input
    1 5
    5 2
    
    output
    18
    
    input
    0 1
    0 0
    
    output
    8
    题意:
    从起点出发,绕过旗子再回去,求最短的贿赂距离,只有上下左右四个方向。
    解法:
    起点、旗子确定一个矩形,出去绕开旗子距离+2,回来距离+2
    当横或纵坐标有两个一样的,再+2,画图即可明白。
    代码:
     1 #include <cstdio>
     2 #include <algorithm>
     3 #include <cmath>
     4 #include <iostream>
     5 using namespace std;
     6 int main() {
     7     int x1,y1,x2,y2;
     8     int ans=0;
     9     scanf("%d %d",&x1,&y1);
    10     scanf("%d %d",&x2,&y2);
    11     ans=(abs(x1-x2)+abs(y1-y2)+2)<<1;
    12     if(!(x1-x2)||!(y1-y2)) ans+=2;
    13     printf("%d
    ",ans);
    14     return 0;
    15 }
    View Code
  • 相关阅读:
    HDU 1016 Prime Ring Problem
    POJ 1724 ROADS(bfs最短路)
    HDU 1033 Edge
    IE 兼容模式
    HDU 1263 水果
    数据结构之图详解
    继续过中等难度.0309
    排序的稳定性
    Java+7入门经典
    哈希链表及其变种
  • 原文地址:https://www.cnblogs.com/lemonbiscuit/p/7775956.html
Copyright © 2011-2022 走看看