← All problemsSign in

Graduate Work Matters

CodeChefRating 2493Open on judge ↗

To prove that writing graduate work is important, you decided to invent some interesting problem connected to it: You are given a weighted complete **undirected** graph on $N$ nodes. For every pair of vertices $(i, j)$ with $1 \le i \lt j \le N$ there is an edge with weight $D \cdot |i - j| + c_{ij}$ between them, with $0 \le c_{ij} \lt D$ (remember, that graph is undirected, so there will be edg

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start