11110 - Equidivisions/equi.cpp 11110 - Equidivisions/in.txt 11111 - Generalized Matrioshkas/in.txt 11111 - Generalized Matrioshkas/matri.cpp 11111 - Generalized Matrioshkas/matriosh.in 11111 - Generalized Matrioshkas/matriosh.out 116 - Undirectional TSP/116.cpp 116 - Undirectional TSP/in.txt @@ -1,10 +1,8 @@ /* - Problem: 10004 - Bicoloring - UVa online judge + Problem: 10004 - Bicoloring (UVa online judge) - Andrés Mejía-Posada + Author: Andrés Mejía-Posada (http://github.com/andmej/acm) Algorithm: Depth-first search - */ #include <iostream> #include <vector> 10004 - Bicoloring/10004.2.cpp @@ -3,7 +3,7 @@ Problem: 10986 - Sending email (UVa Online Judge) Andrés Mejía-Posada (http://github.com/andmej/acm) Verdict: Accepted -Algorithm: Dijkstra +Algorithm: Dijkstra's */ #include <iostream> 10986 - Sending email/10986.cpp @@ -1,6 +1,10 @@ /* + Problem: 572 - Oil deposits (UVa Online Judge) 1959 - Oil deposits (TJU Online Judge) + + Author: Andrés Mejía-Posada (http://github.com/andmej/acm) + Algorithm: Depth-first search */ #include <iostream> 572 - Oil deposits/1959.cpp @@ -1,3 +1,9 @@ +/* + Problem: 610 - Street directions (UVa online judge) + + Author: Andrés Mejía-Posada (http://github.com/andmej/acm) + Algorithm: Depth-first search + */ #include <iostream> using namespace std; @@ -5,17 +11,16 @@ using namespace std; const int MAXN = 1000; bool g[MAXN][MAXN], visited[MAXN]; -int n, p[MAXN]; +int n, p[MAXN]; //p[i] = nodo predecesor que me llevó al nodo i. void dfs(int u){ visited[u] = true; for (int v=0; v<n; ++v){ - //printf("g[%d][%d] = %d\n", u, v, g[u][v]); if (g[u][v]){ //hay arista if (visited[v] && v != p[u]){ //encontre un ciclo g[v][u] = false; int previous = u; - while(previous != v){ + while(previous != v){ //Volver de una sola vía todas las aristas del ciclo g[previous][p[previous]] = false; previous = p[previous]; } @@ -45,14 +50,6 @@ int main(){ g[u][v] = g[v][u] = true; } - /*for(int i=0; i<n; ++i){ - for (int j=0; j<n; ++j){ - printf("%d ",g[i][j]); - } - printf("\n"); - } - printf("\n");*/ - dfs(0); printf("%d\n\n", C++); for(int i=0; i<n; ++i){ 610 - Street directions/610.cpp 2d59e2f771aee9bb2bd46c507c0f33d854c2db3c Familia andmej@gmail.com http://github.com/andmej/acm/commit/51f38568ff7b743e2c745c5a3537abff44fa51e9 51f38568ff7b743e2c745c5a3537abff44fa51e9 2008-08-17T08:46:49-07:00 2008-08-17T08:46:49-07:00 11110 - Equidivisions (DFS, maratón colombiana) && 11111 - Generalized Matrioshkas (Maratón colombiana) && 116 - Undirectional TSP (Programación dinámica, DP, shortest path) 1a357c50fd878a15bb830c5dcff58315934d3a85 Familia andmej@gmail.com