Submission #745382

Source Code Expand


num = []
tako = input()
for i in xrange(tako):
    num.append(map(int ,raw_input().split()))
num = sorted(num)
count, flag = [1]*tako, 0

for j in xrange(tako - 1):
    for i in xrange(j,tako - 1):
        if flag == 0:
            num1 = num[i]

        if num1[0] < num[i+1][0] and num1[1] < num[i+1][1]:
            count[j] += 1
            flag = 0
        else:
            flag = 1

print max(count)

Submission Info

Submission Time
Task D - プレゼント
User kakomon
Language Python (2.7.6)
Score 0
Code Size 432 Byte
Status WA
Exec Time 2107 ms
Memory 19644 KiB

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 4
AC × 6
WA × 13
AC × 2
WA × 14
TLE × 14
Set Name Test Cases
Sample sample0.txt, sample1.txt, sample2.txt, sample3.txt
Subtask0 subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, sample0.txt, sample1.txt, sample2.txt, sample3.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
sample0.txt AC 1980 ms 3592 KiB
sample1.txt AC 25 ms 2568 KiB
sample2.txt AC 25 ms 2568 KiB
sample3.txt AC 25 ms 2568 KiB
subtask0_0.txt WA 67 ms 2692 KiB
subtask0_1.txt WA 27 ms 2568 KiB
subtask0_10.txt AC 477 ms 2692 KiB
subtask0_11.txt AC 306 ms 2692 KiB
subtask0_12.txt WA 309 ms 2692 KiB
subtask0_13.txt WA 300 ms 2692 KiB
subtask0_14.txt WA 309 ms 2692 KiB
subtask0_2.txt WA 30 ms 2568 KiB
subtask0_3.txt WA 36 ms 2692 KiB
subtask0_4.txt WA 160 ms 2692 KiB
subtask0_5.txt WA 30 ms 2568 KiB
subtask0_6.txt WA 229 ms 2692 KiB
subtask0_7.txt WA 236 ms 2692 KiB
subtask0_8.txt WA 221 ms 2692 KiB
subtask0_9.txt WA 62 ms 2692 KiB
subtask1_0.txt TLE 2103 ms 13060 KiB
subtask1_1.txt WA 991 ms 2820 KiB
subtask1_10.txt TLE 2103 ms 19188 KiB
subtask1_11.txt TLE 2107 ms 19204 KiB
subtask1_12.txt TLE 2103 ms 19644 KiB
subtask1_13.txt TLE 2103 ms 19644 KiB
subtask1_14.txt TLE 2103 ms 19644 KiB
subtask1_2.txt TLE 2105 ms 5380 KiB
subtask1_3.txt TLE 2103 ms 17112 KiB
subtask1_4.txt TLE 2103 ms 19516 KiB
subtask1_5.txt TLE 2102 ms 4996 KiB
subtask1_6.txt TLE 2103 ms 15212 KiB
subtask1_7.txt TLE 2102 ms 9476 KiB
subtask1_8.txt TLE 2103 ms 17240 KiB
subtask1_9.txt TLE 2102 ms 10116 KiB