Vector class problem
Program doesn't run with vector class matrix(
typedef vector<unsigned int> row;
typedef vector<row> matrix;
matrix a(40000, row(40000));
), but it does with normal array matrix(int a[100][100]). The problem is that I need a big matrix, and this is the only solution I found. Does anyone have any idea why the program runs fine with the normal array, whereas it doesn't even enter the main function with the vector class array? Any help would be appreciated. Thanks in advance!
Here's the code:
typedef vector<unsigned int> row;
typedef vector<row> matrix;
matrix a(40000, row(40000));
), but it does with normal array matrix(int a[100][100]). The problem is that I need a big matrix, and this is the only solution I found. Does anyone have any idea why the program runs fine with the normal array, whereas it doesn't even enter the main function with the vector class array? Any help would be appreciated. Thanks in advance!
Here's the code:
|
|
Last edited on
You request at least 40,000*40,000*4 = 6.4GB of memory.
Do you use 64bit OS, does your application is 64bit? In 32bit mode you can address just 2GB (or maybe 4Gb) of memory.
BTW, why do you need so heavy construct?
Do you use 64bit OS, does your application is 64bit? In 32bit mode you can address just 2GB (or maybe 4Gb) of memory.
BTW, why do you need so heavy construct?
I have windows 8 64 bit, visual studio 2012 64 bit.
It's a graph problem.
First you read two numbers, N and M. N is the size of the graph(the number of nodes) and M is the number of operations you need to read from the file and apply to the graph(initially there are no edges in the graph, just nodes). There are 4 kinds of operations: the first one adds an edge, the second one removes an edge, the third one displays all the nodes that are at a distance D from the node specified, and the fourth one lists the end nodes of the road(one edge cannot have more than two neighbors, and there cannot be any cycles in the graph). And the restrictions are:
• 1 ≤ N ≤ 40000
• 1 ≤ M ≤ 400000
• 0 ≤ D ≤ N-1
• 1 ≤ i,j ≤ N
P.S.: the first three operations have two parameters(for the first two it's the nodes, for the third one it's the node and the distance) and the fourth one only has one parameter(the node that's part of the road)
It's a graph problem.
First you read two numbers, N and M. N is the size of the graph(the number of nodes) and M is the number of operations you need to read from the file and apply to the graph(initially there are no edges in the graph, just nodes). There are 4 kinds of operations: the first one adds an edge, the second one removes an edge, the third one displays all the nodes that are at a distance D from the node specified, and the fourth one lists the end nodes of the road(one edge cannot have more than two neighbors, and there cannot be any cycles in the graph). And the restrictions are:
• 1 ≤ N ≤ 40000
• 1 ≤ M ≤ 400000
• 0 ≤ D ≤ N-1
• 1 ≤ i,j ≤ N
P.S.: the first three operations have two parameters(for the first two it's the nodes, for the third one it's the node and the distance) and the fourth one only has one parameter(the node that's part of the road)
Also, maximum execution time is 6.5 seconds, available memory is 64 MB, source max size is 20 KB and for 40% of the tests N≤5000 and M≤20000.
It means that you cannot have more than M edges.
You may use different representation of the graph, e.g. adjacency list.
If you still want to use adjacency matrix, you can switch to
All above advises are valid if the problem arises because of huge amount of allocated memory.
What is exact wording of the error message?
You may use different representation of the graph, e.g. adjacency list.
If you still want to use adjacency matrix, you can switch to
bool instead of int.All above advises are valid if the problem arises because of huge amount of allocated memory.
What is exact wording of the error message?
There is no error message, it opens the console and runs and runs and runs(haven't waited for it to stop, it would probably take a lot of time), but if I include <iostream> and put a cout<<1; at the beginning of the main function, it doesn't show 1 in the console, it still stays blank. There is no error, but it doesn't seem to work(or at least it takes too long to declare the matrix, if that's even possible).
cout<<1; doesn't print immediately on the screen.Try to use
cout<<1 << endl; or |
|
Also, please read a short page on graph structures:
http://en.wikipedia.org/wiki/Graph_%28abstract_data_type%29
I revised the code(had some mistakes in it), tried replacing
int with bool, still doesn't work with the vector class matrix. I also read the page on graph structures, didn't help much... are you suggesting I use something else to define the graph?(other than the adjacency matrix)
Topic archived. No new replies allowed.