| Task: | Polygon area |
| Sender: | aalto26jm_026 |
| Submission time: | 2026-11-09 16:34:57 +0200 |
| Language: | C++ (C++23) |
| 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 <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::pair<long long, long long>> xy(n);
for (int i = 0; i < n; i++) {
std::cin >> xy[i].first >> xy[i].second;
}
xy.push_back(xy[0]);
long long sum = 0;
for (int i = 1; i <= n; i++) {
sum += xy[i - 1].first * xy[i].second - xy[i].first * xy[i - 1].second;
}
std::cout << std::abs(sum) << '\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 |
