| Task: | Polygon area |
| Sender: | aalto26jm_010 |
| Submission time: | 2026-11-09 16:46:53 +0200 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.04 s | details |
| #2 | WRONG ANSWER | 0.07 s | details |
| #3 | WRONG ANSWER | 0.04 s | details |
Code
import sys
inp = sys.stdin.read().split()
n = int(inp[0])
points = []
idx =1
for i in range(n):
points.append([int(inp[i+idx]),int(inp[i+idx+1])])
idx+=1
area = 0
for i in range(n):
if i < n-1:
k = i+1
area += (points[i][0]*points[k][1] - points[i][1]*points[k][0])
else:
k = 0
area += (points[i][0]*points[k][1] - points[i][1]*points[k][0])
print("i : ",i,points[i],"***********","k: ",k,points[k],(points[i][0]*points[k][1] - points[i][1]*points[k][0]))
area = abs(area)/2
print(2*int(area))Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 100 -7 -19 91 77 100 100 64 60 ... |
| correct output |
|---|
| 43582 |
| user output |
|---|
| i : 0 [-7, -19] *********** k... |
Feedback: Output is longer than expected
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 365625896 -113418831 278762563 38777445 250367343 -96991975 175866909 -129766978 ... |
| correct output |
|---|
| 4053466653883387139 |
| user output |
|---|
| i : 0 [365625896, -113418831]... |
Feedback: Output is longer than expected
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 4 -1000000000 -1000000000 -1000000000 1000000000 1000000000 1000000000 1000000000 -1000000000 |
| correct output |
|---|
| 8000000000000000000 |
| user output |
|---|
| i : 0 [-1000000000, -10000000... |
Feedback: Output is longer than expected
