{"problem":{"name":"Distinct Trio","description":{"content":"You are given a sequence of length $N$: $A=(A_1,A_2,\\ldots,A_N)$.   Find the number of triples $(i,j,k)$ that satisfy both of the following conditions. *   $1\\leq i \\lt j \\lt k \\leq N$ *   $A_i$, $A_","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc252_d"},"statements":[{"statement_type":"Markdown","content":"You are given a sequence of length $N$: $A=(A_1,A_2,\\ldots,A_N)$.  \nFind the number of triples $(i,j,k)$ that satisfy both of the following conditions.\n\n*   $1\\leq i \\lt j \\lt k \\leq N$\n*   $A_i$, $A_j$, and $A_k$ are distinct.\n\n## Constraints\n\n*   $3 \\leq N \\leq 2\\times 10^5$\n*   $1 \\leq A_i \\leq 2\\times 10^5$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc252_d","tags":[],"sample_group":[["4\n3 1 4 1","2\n\nThe two triples $(i,j,k)$ satisfying the conditions are $(1,2,3)$ and $(1,3,4)$."],["10\n99999 99998 99997 99996 99995 99994 99993 99992 99991 99990","120"],["15\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9","355"]],"created_at":"2026-03-03 11:01:14"}}