Submission #3451446


Source Code Expand

N = int(input())
X = []
Y = []
ans = 0
for i in range(0,N):
  A = list(map(int,input().split()))
  X.append(A[0])
  Y.append(A[1])

for i in range(0,N):
  for j in range(i + 1,N):
    if(X[i] > X[j] or (X[i] == X[j] and Y[i] > Y[j])):
      n = X[i]
      X[i] = X[j]
      X[j] = n
      n = Y[i]
      Y[i] = Y[j]
      Y[j] = n

def func(index):
  ans = 0
  for i in range(index - 1, -1 , -1):
    if X[index] > X[i] and Y[index] > Y[i]:
      a = func(i)
      ans = max(a,ans)
  return ans + 1

print(func(N - 1))

Submission Info

Submission Time
Task D - プレゼント
User darjeeling
Language Python (3.4.3)
Score 0
Code Size 545 Byte
Status RE
Exec Time 2108 ms
Memory 11252 KB

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 4
AC × 5
WA × 4
TLE × 9
RE × 1
AC × 5
WA × 4
TLE × 24
RE × 1
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 sample0.txt, sample1.txt, sample2.txt, sample3.txt, 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 17 ms 3064 KB
sample1.txt AC 17 ms 3064 KB
sample2.txt AC 17 ms 3064 KB
sample3.txt AC 17 ms 3064 KB
subtask0_0.txt WA 351 ms 3064 KB
subtask0_1.txt WA 82 ms 3064 KB
subtask0_10.txt RE 205 ms 4056 KB
subtask0_11.txt AC 328 ms 3064 KB
subtask0_12.txt TLE 2103 ms 3064 KB
subtask0_13.txt TLE 2103 ms 3064 KB
subtask0_14.txt TLE 2104 ms 3064 KB
subtask0_2.txt WA 20 ms 3064 KB
subtask0_3.txt TLE 2103 ms 3064 KB
subtask0_4.txt TLE 2104 ms 3064 KB
subtask0_5.txt WA 239 ms 3064 KB
subtask0_6.txt TLE 2103 ms 3064 KB
subtask0_7.txt TLE 2103 ms 3064 KB
subtask0_8.txt TLE 2103 ms 3064 KB
subtask0_9.txt TLE 2104 ms 3064 KB
subtask1_0.txt TLE 2104 ms 7956 KB
subtask1_1.txt TLE 2104 ms 3188 KB
subtask1_10.txt TLE 2104 ms 11252 KB
subtask1_11.txt TLE 2104 ms 11008 KB
subtask1_12.txt TLE 2104 ms 11036 KB
subtask1_13.txt TLE 2108 ms 11020 KB
subtask1_14.txt TLE 2104 ms 11204 KB
subtask1_2.txt TLE 2104 ms 4468 KB
subtask1_3.txt TLE 2104 ms 9864 KB
subtask1_4.txt TLE 2104 ms 11036 KB
subtask1_5.txt TLE 2103 ms 4340 KB
subtask1_6.txt TLE 2104 ms 9196 KB
subtask1_7.txt TLE 2104 ms 6268 KB
subtask1_8.txt TLE 2104 ms 9884 KB
subtask1_9.txt TLE 2104 ms 6892 KB