OJ Board

HI, the first case on the PDF, shouldn't be:
4 5
1 4 1
1 3 3
3 4 4
1 2 2
2 4 5
20 10

instead of:
4 5
1 4 1
1 3 3
3 4 4
1 2 2
2 4 5
20 1
?

The post was removed, i had an error in the way that i counted the intersections.

And we want to minimize the sum of the minimum distances from all the areas, but having into account the quantity of people living in each area. Because of this part of the statement i think that the sample output is the sum of the distances between an office to all the areas, but i can't find where...

Just a tip, especially for those who get TLE and RTE 1. A brute force O(n^3) approach can get Accepted (with use of scanf and good memory allocation) 2. Vertices in the input CAN be greater than n (check problem description) 3. You only need to count triangles up to vertex n About the first item: m...

anybody could explain this cases?

4
1
2 2 1
4
0 0 1
4 4 1
0 4 1
4 0 1
5
0 0 1
1 1 1
2 2 1
3 3 1
4 4 1
7
4 2 2
3 3 1
2 4 3
2 1 1
1 3 4
1 2 2
1 0 1

Its the cases of the problem, i want to know where the five areas stay in every test so i can understand this, the problem statement is not so clear.

i tested exhaustively but i still get WA. code: typedef long long int lld; int main(){ int n, m; char board[120][120]; while( scanf(" %d", &n ) != EOF ){ if(!n)break; scanf(" %d", &m ); int t = 0; memset(board,'0',sizeof(board)); for( int i = 1; i <= n; i++ ){ for( int j ...

AFf the PDF format version has not the statement: Output a blank line after each test case.
But the HTML format has.

i don't know why i'm getting TLE, i tested with all numbers in 10...9999999 and no one of the tests became in infinite loop.

code: I don't know where is the performance problem. Please help-me?

i had the same problem, but if you see when we close the recurrence formula, we know where to get the things on the table by the parameters of the function on the formula, example: http://www.geeksforgeeks.org/dynamic-programming-set-5-edit-distance/ on this formula we need to take the states that a...

How to indentify this kind of problem? In this problem: 12083 - Guardian of Decency I solved it because i had the spoiler on the competitive programming 3, the book says that we need to do the exactly the opposite of what the problem asks and them print V - MCBM. I want to know if the independent se...

if you save the best previous item of each item i think that in the and you will have the list, make some tests and reply.