Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Increasing triplets

    Given 3 arrays a, b, and c of length n, you are asked to find the number of triplets (i, j, k) such that .

    Input

    The first line of the input contains a single integer n (1 ≤ n ≤ ).
    The next line contains n integers (0 ≤ ≤ ).
    The second line contains n integers (0 ≤ ≤ ).
    Finally, the third line contains n integers (0 ≤ ≤ ).

    Output

    The program should print the number of increasing triplets.

    Examples

    Input
    Output
    4 13 6 8 3 1 3 5 8 9 15 7 5
    7

    Explanation

     

    Constraints

    Time limit: 2 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue