fork download

copy

 
using namespace std;
#include <vector>
#include <stack>
 
typedef vector<int> Vi;
typedef vector<Vi> Gi;
typedef stack<int> Si;
typedef vector<bool> Vb;
 
Gi grafo, grafoRev;
Si pila, pilaRev;
Vb visitado, visitadoRev;
 
int N, M, u, v, p;
 
void DFS(int nodo)
{
visitado[nodo] = true;
 
for (int i = 0; i < grafo[nodo].size(); i++)
{
if (!visitado[grafo[nodo][i]])
DFS(grafo[nodo][i]);
}
 
pila.push(nodo);
}
 
void DFS_Rev(int nodo)
{
visitadoRev[nodo] = true;
 
for (int i = 0; i < grafoRev[nodo].size(); i++)
{
if (!visitadoRev[grafoRev[nodo][i]])
DFS_Rev(grafoRev[nodo][i]);
}
 
pilaRev.push(nodo);
}
 
int main()
{
/*
4 5
1 2 1
1 3 2
2 4 1
3 4 1
4 1 2
3 2
1 2 2
1 3 2
3 2
1 2 2
1 3 1
4 2
1 2 2
3 4 2
0 0
*/
 
while (true)
{
scanf("%d %d", &N, &M);
 
if (N == 0 && M == 0)
break;
 
grafo = Gi(N);
grafoRev = Gi(N);
 
visitado = Vb(N);
visitadoRev = Vb(N);
 
for (int i = 0;i < M;i++)
{
scanf("%d %d %d", &u, &v, &p);
 
u--; v--;
 
if (p == 1)
{
grafo[u].push_back(v);
grafoRev[v].push_back(u);
}
else {
grafo[u].push_back(v);
grafoRev[v].push_back(u);
grafo[v].push_back(u);
grafoRev[u].push_back(v);
}
}
 
 
for (int i = 0;i < N;i++)
{
if (!visitado[i])
DFS(i);
}
 
DFS_Rev(pila.top());
printf("%d\n", pilaRev.size == N ? 1 : 0);
}

prog.cpp: In function ‘int main()’:
prog.cpp:66:22: error: ‘scanf’ was not declared in this scope
 scanf("%d %d", &N, &M);
                      ^
prog.cpp:104:24: error: invalid use of member function ‘std::stack<_Tp, _Sequence>::size_type std::stack<_Tp, _Sequence>::size() const [with _Tp = int; _Sequence = std::deque<int, std::allocator<int> >; std::stack<_Tp, _Sequence>::size_type = long unsigned int]’ (did you forget the ‘()’ ?)
 printf("%d\n", pilaRev.size == N ? 1 : 0);
                ~~~~~~~~^~~~
prog.cpp:104:41: error: ‘printf’ was not declared in this scope
 printf("%d\n", pilaRev.size == N ? 1 : 0);
                                         ^
prog.cpp:105:1: error: expected ‘}’ at end of input
 }
 ^

Standard output is empty