zoukankan      html  css  js  c++  java
  • Codeforces Round #353 (Div. 2)Restoring Painting

    Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was stolen while he was on duty. He doesn't want to be fired, so he has to quickly restore the painting. He remembers some facts about it.

    • The painting is a square 3 × 3, each cell contains a single integer from 1 to n, and different cells may contain either different or equal integers.
    • The sum of integers in each of four squares 2 × 2 is equal to the sum of integers in the top left square 2 × 2.
    • Four elements abc and d are known and are located as shown on the picture below.

    Help Vasya find out the number of distinct squares the satisfy all the conditions above. Note, that this number may be equal to 0, meaning Vasya remembers something wrong.

    Two squares are considered to be different, if there exists a cell that contains two different integers in different squares.

    Input

    The first line of the input contains five integers nabc and d (1 ≤ n ≤ 100 000, 1 ≤ a, b, c, d ≤ n) — maximum possible value of an integer in the cell and four integers that Vasya remembers.

    Output

    Print one integer — the number of distinct valid squares.

    Examples
    input
    2 1 1 1 2
    output
    2
    input
    3 3 1 2 3
    output
    6
    Note

    Below are all the possible paintings for the first sample.

    In the second sample, only paintings displayed below satisfy all the rules.

    注意数据范围:

    #include<iostream>
    using namespace std;
    typedef long long ll;
    int main()
    {
        ll n,a,b,c,d,s=0;
        cin>>n>>a>>b>>c>>d;
        
        for(int i=1;i<=n;i++)
        {
            ll q1,q2,q3,q4,q5;
            q1=i;
            q2=q1+b-c;
            q4=q1+a-d;
            q5=q4+b-c;
            int cnt=0;
            if(q1>=1&&q1<=n)cnt++;
            if(q2>=1&&q2<=n)cnt++;
            if(q4>=1&&q4<=n)cnt++;
            if(q5>=1&&q5<=n)cnt++;
                if(cnt==4)
            s++;
        }
            cout<<s*n;
    }
  • 相关阅读:
    Day4 0708
    Day2 0706
    两道递推公式题的解题报告
    博客还需优化
    飞行路线Luogu4568
    堆优化Dijkstra(Luogu 4779)
    2019四等奖的清明节征文
    2019四等奖的叶圣陶初稿
    Luogu P1072 Hankson的趣味题
    Loj10022 埃及分数(迭代加深搜索IDDFS)
  • 原文地址:https://www.cnblogs.com/wangmenghan/p/5518567.html
Copyright © 2011-2022 走看看