Task: | Polygon area |
Sender: | arnxxau |
Submission time: | 2024-11-11 16:23:47 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | WRONG ANSWER |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.00 s | details |
#2 | WRONG ANSWER | 0.01 s | details |
#3 | WRONG ANSWER | 0.00 s | details |
Code
#include <iostream> #include <vector> #include <algorithm> #include <climits> using namespace std; double polygonArea(vector<double>& X, vector<double>& Y, int n) { double area = 0.0; int j = n - 1; for (int i = 0; i < n; i++) { area += (X[j] + X[i]) * (Y[j] - Y[i]); j = i; } return abs(area / 2.0); } int main() { int n; cin >> n; vector<double> X(n); vector<double> Y(n); for (int i = 0; i < n; i++) { cin >> X[i]; cin >> Y[i]; } cout << 2 * polygonArea(X, Y, n) << 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: WRONG ANSWER
input |
---|
1000 365625896 -113418831 278762563 38777445 250367343 -96991975 175866909 -129766978 ... |
correct output |
---|
4053466653883387139 |
user output |
---|
4.05347e+18 |
Test 3
Verdict: WRONG ANSWER
input |
---|
4 -1000000000 -1000000000 -1000000000 1000000000 1000000000 1000000000 1000000000 -1000000000 |
correct output |
---|
8000000000000000000 |
user output |
---|
8e+18 |