| Task: | Polygon area |
| Sender: | Ciphra |
| Submission time: | 2025-11-10 16:31:28 +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 <cstdlib>
#include <iostream>
#include <utility>
#include <vector>
typedef long long l;
int main(){
int n;
std::cin >> n;
std::vector<std::pair<l, l>> points(n + 1);
for (int i = 0; i<n; ++i){
l x, y;
std::cin >> x >> y;
points[i] = {x, y};
}
points[n] = points[0];
l area = 0;
for (int i = 0; i<n; ++i){
area += points[i].first * points[i+1].second - points[i+1].first * points[i].second;
}
area = std::abs(area);
std::cout << area << "\n";
}
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 |
