zoukankan      html  css  js  c++  java
  • MemSQL Start[c]UP 2.0

    http://codeforces.com/contest/452/problem/B
     
    B. 4-point polyline
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    You are given a rectangular grid of lattice points from (0, 0) to (n, m) inclusive. You have to choose exactly 4 different points to build a polyline possibly with self-intersections and self-touching. This polyline should be as long as possible.

    A polyline defined by points p1, p2, p3, p4 consists of the line segments p1 p2, p2 p3, p3 p4, and its length is the sum of the lengths of the individual line segments.

    Input

    The only line of the input contains two integers n and m (0 ≤ n, m ≤ 1000). It is guaranteed that grid contains at least 4 different points.

    Output

    Print 4 lines with two integers per line separated by space — coordinates of points p1, p2, p3, p4 in order which represent the longest possible polyline.

    Judge program compares your answer and jury's answer with 10 - 6 precision.

    Sample test(s)
    input
    1 1
    output
    1 1
    0 0
    1 0
    0 1
    input
    0 10
    output
    0 1
    0 10
    0 0
    0 9

    ------------------------------------------------------------------------------------------------------------------

    说的是给你一个矩形区域,让你画三条线,怎样画使得线最长

    根据n和m的大小,有四种画法,一是X型,一是斜对角的Z型

    #include<cstdio>
    #include<cmath>
    using namespace std;
    int main()
    {
        int n,m;
        scanf("%d%d",&n,&m);
        if(n==0)
        {
            printf("0 1
    0 %d
    0 0
    0 %d
    ",m,m-1);
        }
        else if(m==0)
        {
            printf("1 0
    %d 0
    0 0
    %d 0
    ",n,n-1);
        }
        else if(m>=n)
        {
            if(2*sqrt(m*m+n*n)+m<sqrt(m*m+n*n)+2*sqrt(m*m+(n-1)*(n-1))) printf("1 0
    %d %d
    0 0
    %d %d
    ",n,m,n-1,m);
            else printf("0 0
    %d %d
    %d 0
    0 %d
    ",n,m,n,m);
        }
        else
        {
            if(2*sqrt(m*m+n*n)+n<sqrt(m*m+n*n)+2*sqrt((m-1)*(m-1)+n*n)) printf("0 1
    %d %d
    0 0
    %d %d
    ",n,m,n,m-1);
            else printf("0 0
    %d %d
    0 %d
    %d 0
    ",n,m,m,n);
        }
        return 0;
    }
  • 相关阅读:
    log日志框架和LocationAwareLogger问题
    Eclipse 各种小图标的含义
    自定义log4j日志级别
    在Tomcat配置JNDI数据源的三种方式
    mybatis中"#"和"$"的区别
    Postman用法简介-Http请求模拟工具
    mustache模板技术(转)
    VS的编译选项
    Java Service Wrapper简介与使用
    还活着
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3898599.html
Copyright © 2011-2022 走看看