Submission #3451484


Source Code Expand

N = int(input())
X = []
Y = []
M = []
ans = 0
for i in range(0,N):
  A = list(map(int,input().split()))
  X.append(A[0])
  Y.append(A[1])
  M.append(0)
  
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 = M[i] if M[i] != 0 else func(i)
      ans = max(a,ans)
  M[index] = ans + 1
  return ans + 1

print(func(N - 1))

Submission Info

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

Judge Result

Set Name Sample Subtask0 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 4
AC × 6
WA × 12
RE × 1
AC × 6
WA × 13
TLE × 14
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 53 ms 3064 KB
subtask0_1.txt WA 18 ms 3064 KB
subtask0_10.txt RE 210 ms 4044 KB
subtask0_11.txt AC 324 ms 3064 KB
subtask0_12.txt WA 274 ms 3064 KB
subtask0_13.txt WA 279 ms 3064 KB
subtask0_14.txt AC 370 ms 3064 KB
subtask0_2.txt WA 20 ms 3064 KB
subtask0_3.txt WA 29 ms 3064 KB
subtask0_4.txt WA 192 ms 3064 KB
subtask0_5.txt WA 21 ms 3064 KB
subtask0_6.txt WA 274 ms 3064 KB
subtask0_7.txt WA 302 ms 3064 KB
subtask0_8.txt WA 228 ms 3064 KB
subtask0_9.txt WA 49 ms 3064 KB
subtask1_0.txt TLE 2104 ms 8436 KB
subtask1_1.txt WA 842 ms 3188 KB
subtask1_10.txt TLE 2104 ms 11872 KB
subtask1_11.txt TLE 2104 ms 11784 KB
subtask1_12.txt TLE 2104 ms 11780 KB
subtask1_13.txt TLE 2108 ms 11808 KB
subtask1_14.txt TLE 2104 ms 12048 KB
subtask1_2.txt TLE 2104 ms 4824 KB
subtask1_3.txt TLE 2104 ms 10488 KB
subtask1_4.txt TLE 2104 ms 11796 KB
subtask1_5.txt TLE 2104 ms 4468 KB
subtask1_6.txt TLE 2104 ms 9580 KB
subtask1_7.txt TLE 2104 ms 6904 KB
subtask1_8.txt TLE 2104 ms 10584 KB
subtask1_9.txt TLE 2104 ms 7160 KB