Submission #306864


Source Code Expand

import itertools
n = int(raw_input())
xy = [map(int,raw_input().split()) for _ in range(n)]
exist = {x:{} for x,y in xy}
for x,y in xy:
    exist[x][y] = True
for xy1,xy2 in itertools.combinations(xy,2):
    x1,y1 = xy1
    x2,y2 = xy2
    x3,y3 = -(y2-y1)+x1, (x2-x1)+y1
    x4,y4 =  (y1-y2)+x2,-(x1-x2)+y2
    try:
        if exist[x3][y3] and exist[x4][y4]:
            ans = sorted([xy.index(xy1)+1,xy.index(xy2)+1,xy.index([x3,y3])+1,xy.index([x4,y4])+1])
            print 4
            print "\n".join(map(str,ans))
            break
    except:
        pass
else:
    print 0

Submission Info

Submission Time
Task C - Regular Polygon
User roiti
Language Python (2.7.3)
Score 100
Code Size 605 Byte
Status AC
Exec Time 1032 ms
Memory 3888 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 20
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt, subtask1_special01.txt, subtask1_special02.txt, subtask1_special03.txt, subtask1_special04.txt, subtask1_special05.txt, subtask1_special06.txt, subtask1_special07.txt, subtask1_special08.txt, subtask1_special09.txt, subtask1_special10.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 55 ms 3352 KB
subtask0_sample_02.txt AC 54 ms 3320 KB
subtask1_random01.txt AC 1018 ms 3836 KB
subtask1_random02.txt AC 1021 ms 3884 KB
subtask1_random03.txt AC 1007 ms 3888 KB
subtask1_random04.txt AC 997 ms 3876 KB
subtask1_random05.txt AC 113 ms 3696 KB
subtask1_random06.txt AC 154 ms 3760 KB
subtask1_random07.txt AC 999 ms 3884 KB
subtask1_random08.txt AC 1009 ms 3772 KB
subtask1_special01.txt AC 55 ms 3492 KB
subtask1_special02.txt AC 56 ms 3488 KB
subtask1_special03.txt AC 57 ms 3496 KB
subtask1_special04.txt AC 57 ms 3504 KB
subtask1_special05.txt AC 1032 ms 3816 KB
subtask1_special06.txt AC 214 ms 3828 KB
subtask1_special07.txt AC 205 ms 3620 KB
subtask1_special08.txt AC 256 ms 3884 KB
subtask1_special09.txt AC 1001 ms 3880 KB
subtask1_special10.txt AC 58 ms 3620 KB