Codeforces Round #353 (Div. 2) B. Restoring Painting 水题
2016-05-17 11:22
369 查看
B. Restoring Painting
题目连接:
http://www.codeforces.com/contest/675/problem/BDescription
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 a, b, c 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 n, a, b, c 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.Sample Input
2 1 1 1 2Sample Output
2Hint
题意
给你一个33的矩阵,然后给你四个位置的数是多少然后让你填五个位置的数,使得四个22正方形的值大小相同。
问你一共有多少种填数的方法
题解:
直接暴力枚举左上角,然后O(1)去check合不合法就好了中间那个数无所谓的,肯定有n种方法
代码
#include<bits/stdc++.h> using namespace std; int main() { long long n,a,b,c,d; long long ans=0; cin>>n>>a>>b>>c>>d; for(int i=1;i<=n;i++) { long long b2=b-c+i; long long c2=a-d+i; long long d2=b-c+c2; if(1<=b2&&b2<=n&&1<=c2&&c2<=n&&1<=d2&&d2<=n) ans++; } ans*=n; cout<<ans<<endl; }
相关文章推荐
- From Opentsdb To Kairosdb
- 使用Genymotion调试出现错误INSTALL_FAILED_CPU_ABI_INCOMPATI
- async and await 简单的入门
- Tomcat启动报错 Failed to initialize connector [Connector[HTTP/1.1-8080]]
- Codeforces Round #353 (Div. 2)-B. Restoring Painting(数学)
- 详细解析Raid0、Raid0+1、Raid1、Raid5四者的区别
- Grails在服务类中获取web根目录
- Installation error: INSTALL_FAILED_UPDATE_INCOMPATIBLE
- 2016.5.16——leetcode:Rotate Array,Factorial Trailing Zeroe
- AEAI WM V1.5.0 升级说明,开源工作管理系统
- AEAI WM V1.5.0 升级说明,开源工作管理系统
- LeetCode 336. Palindrome Pairs
- 03-树3 Tree Traversals Again
- Failed to deploy virtual device -- Genymotion安装虚拟器失败
- sleep、yield、wait、join的区别
- Spirng+In+Action(Craig Walls Ryan Breidenbach)
- CodeForces 608A Saitama Destroys Hotel(水题)
- 服务器主板s2600cp2配置Raid5全过程
- No TypeTag available for person
- Rails安全检测工具之Brakeman介绍