codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

376B.md (2288B)


      1 Source: https://codeforces.com/problemset/problem/376/B
      2 
      3 B. I.O.U.
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 Imagine that there is a group of three friends: A, B and С. A owes B 20 rubles and B owes C 20 rubles. The total sum of the debts is 40 rubles. You can see that the debts are not organized in a very optimal manner. Let's rearrange them like that: assume that A owes C 20 rubles and B doesn't owe anything to anybody. The debts still mean the same but the total sum of the debts now equals 20 rubles.
     22 
     23 This task is a generalisation of a described example. Imagine that your group of friends has *n* people and you know the debts between the people. Optimize the given debts without changing their meaning. In other words, finally for each friend the difference between the total money he should give and the total money he should take must be the same. Print the minimum sum of all debts in the optimal rearrangement of the debts. See the notes to the test samples to better understand the problem.
     24 
     25 Input
     26 
     27 The first line contains two integers *n* and *m* (1 ≤ *n* ≤ 100; 0 ≤ *m* ≤ 104). The next *m* lines contain the debts. The *i*-th line contains three integers *a**i*, *b**i*, *c**i* (1 ≤ *a**i*, *b**i* ≤ *n*; *a**i* ≠ *b**i*; 1 ≤ *c**i* ≤ 100), which mean that person *a**i* owes person *b**i* *c**i* rubles.
     28 
     29 Assume that the people are numbered by integers from 1 to *n*.
     30 
     31 It is guaranteed that the same pair of people occurs at most once in the input. The input doesn't simultaneously contain pair of people (*x*, *y*) and pair of people (*y*, *x*).
     32 
     33 Output
     34 
     35 Print a single integer — the minimum sum of debts in the optimal rearrangement.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 5 3  
     43 1 2 10  
     44 2 3 1  
     45 2 4 1
     46 ```
     47 
     48 Output
     49 
     50 ```
     51 10
     52 ```
     53 
     54 Input
     55 
     56 ```
     57 3 0
     58 ```
     59 
     60 Output
     61 
     62 ```
     63 0
     64 ```
     65 
     66 Input
     67 
     68 ```
     69 4 3  
     70 1 2 1  
     71 2 3 1  
     72 3 1 1
     73 ```
     74 
     75 Output
     76 
     77 ```
     78 0
     79 ```
     80 
     81 Note
     82 
     83 In the first sample, you can assume that person number 1 owes 8 rubles to person number 2, 1 ruble to person number 3 and 1 ruble to person number 4. He doesn't owe anybody else anything. In the end, the total debt equals 10.
     84 
     85 In the second sample, there are no debts.
     86 
     87 In the third sample, you can annul all the debts.