Remembering the Days

AtCoder

IDabc317_c

Time2000ms

Memory256MB

Difficulty—

A region has $N$ towns numbered $1$ to $N$, and $M$ roads numbered $1$ to $M$. The $i$\-th road connects town $A_i$ and town $B_i$ bidirectionally with length $C_i$. Find the maximum possible total length of the roads you traverse when starting from a town of your choice and getting to another town without passing through the same town more than once. ## Constraints * $2 \leq N \leq 10$ * $1 \leq M \leq \frac{N(N-1)}{2}$ * $1 \leq A_i < B_i \leq N$ * The pairs $(A_i,B_i)$ are distinct. * $1\leq C_i \leq 10^8$ * All input values are integers. ## Input The input is given from Standard Input in the following format: $N$ $M$ $A_1$ $B_1$ $C_1$ $\vdots$ $A_M$ $B_M$ $C_M$ [samples]

Samples

Input #1

Output #1

1110

If you travel as $4\to 1\to 3\to 2$, the total length of the roads you traverse is $1110$.

Input #2

10 1
5 9 1

Output #2

1

There may be a town that is not connected to a road.

Input #3

Output #3

20

![image](https://img.atcoder.jp/abc317/06ac62d13dd1c4b2b469a524a60eb093.png)

API Response (JSON)

{
  "problem": {
    "name": "Remembering the Days",
    "description": {
      "content": "A region has $N$ towns numbered $1$ to $N$, and $M$ roads numbered $1$ to $M$. The $i$\\-th road connects town $A_i$ and town $B_i$ bidirectionally with length $C_i$. Find the maximum possible total le",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc317_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "A region has $N$ towns numbered $1$ to $N$, and $M$ roads numbered $1$ to $M$.\nThe $i$\\-th road connects town $A_i$ and town $B_i$ bidirectionally with length $C_i$.\nFind the maximum possible total le...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments