| Task: | Polygon area |
| Sender: | Aurelien |
| Submission time: | 2025-11-10 16:28:00 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.01 s | details |
| #3 | ACCEPTED | 0.00 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pl;
typedef long long C;
typedef complex<C> P;
#define X real()
#define Y imag()
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (ll i = a; i < b; i++)
int main() {
ll n;
cin >> n;
pair<ll,ll> v[n+1];
ll x,y;
REP(i,0,n) {
cin >> x >> y;
v[i] = {x,y};
}
v[n] = v[0];
// REP(i,0,n+1) {
// cout << v[i].first << " " << v[i].second << endl;
// }
ll sum = 0;
REP(i,0,n) {
sum += v[i].first * v[i+1].second - v[i+1].first * v[i].second;
}
if(sum <0) sum *= -1;
cout << sum << endl;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 100 -7 -19 91 77 100 100 64 60 ... |
| correct output |
|---|
| 43582 |
| user output |
|---|
| 43582 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 1000 365625896 -113418831 278762563 38777445 250367343 -96991975 175866909 -129766978 ... |
| correct output |
|---|
| 4053466653883387139 |
| user output |
|---|
| 4053466653883387139 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 4 -1000000000 -1000000000 -1000000000 1000000000 1000000000 1000000000 1000000000 -1000000000 |
| correct output |
|---|
| 8000000000000000000 |
| user output |
|---|
| 8000000000000000000 |
