sdnu 1334 Jason's Water Problem【计算几何-多边形面积的计算】【负数取模】

最新推荐文章于 2026-06-24 00:00:50 发布

转载最新推荐文章于 2026-06-24 00:00:50 发布 · 151 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/guanwen769aaaa/p/11281240.html

标签

#开发工具

本文介绍了一道编程竞赛中的“水题”，即简单题目——Jason的水问题，通过解决此题，详细解析了如何计算任意多边形的面积，包括算法原理、错误代码与正确实现，以及在计算过程中对负数取模的特殊处理。

1334.Jason's Water Problem

Time Limit: 1000 MS Memory Limit: 32768 KB
Total Submission(s): 128 Accepted Submission(s): 23

Description

Calculus is the first lesson Jason had. It is tedious, so an interesting idea occurred to Jason. He took out his mobile phone and open the HDUOJ and found a water problem. He said to himself, “I must solve this f**king easy water problem in ten minutes! ”.

You were invited to compete with him online. Don’t be defeated.

Input

Multiple test cases, Each test first contains an integer N(3<=N<=100000) indicating the number of vertices of the polygon. The i-th of the following Nlines contains two integers xi and yi (0<=xi,yi<=10^9) separated by a blank. (xi,yi) is the i-th vertex of the polygon, and (x1,y1),...,(xn,yn) will be in counterclockwise order.

Output

For each test case, output a number as the answer which is the area of the polygon be multiplied by 2. In case the answer is greater than 1000000006, please modulo the answer with 1000000007.

Sample Input

Sample Output

1
2

Hint

Source

2015-2016_SDNU_ACM-ICPC_Selection_Match_Round_1

错的代码：

 1 #include<bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 const ll mod=1000000007;
 5 struct point
 6 {
 7     ll x,y;
 8 }a[100050];
 9 ll calc(point c,point d)
10 {
11     return c.x*d.y-d.x*c.y;
12 }
13 int main()
14 {
15     int n;
16     while(scanf("%d",&n)!=EOF)
17     {
18         for(int i=1;i<=n;i++)
19         {
20             scanf("%lld %lld",&a[i].x,&a[i].y);
21         }
22         ll ans=0;
23         a[n+1]=a[1];
24         for(int i=2;i<=n+1;i++)
25         {
26             ans=(ans+calc(a[i-1],a[i])%mod)%mod;
27         }
28         cout<<ans<<'\n';
29     }
30 }

ac的代码：

 1 #include<bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 const ll mod=1000000007;
 5 struct point
 6 {
 7     ll x,y;
 8 }a[100050];
 9 ll calc(point c,point d)
10 {
11     return (c.x*d.y-d.x*c.y);
12 }
13 int main()
14 {
15     int n;
16     while(scanf("%d",&n)!=EOF)
17     {
18         for(int i=1;i<=n;i++)
19         {
20             scanf("%lld %lld",&a[i].x,&a[i].y);
21         }
22         a[n+1]=a[1];
23         ll ans=0;
24         for(int i=2;i<=n+1;i++)
25         {
26             ans=(ans+calc(a[i-1],a[i])%mod+mod)%mod;
27         }
28         cout<<ans<<'\n';
29     }
30 }