Internet connection

input/code.cpp: In function 'void DFS(int, int)':
input/code.cpp:66:7: warning: unused variable 'a' [-Wunused-variable]
   int a = 10;
       ^

#include <bits/stdc++.h>
using namespace std;
#define N 1000

vector<int> g[N]; // g[i] represents all neighbors for node i

/*
//vector<int> g[N]; // g[i] represents all neighbors for node i
void bfs(int s) {
  // print bfstraversal starting at node s
  queue<int> q;
  vector<bool> vis(N);
  q.push(s);
  while(not q.empty()) {
    auto u = q.front();
    q.pop();
    if(not vis[u]) {
      cout << u << " ";
      vis[u] = true;
      for(auto v : g[u]) {
        q.push(v);
      }
    }
  }
}
*/

void printG() {
  cout << "G:" << endl;
  for (auto i: g) {
    cout << " ";
    for (auto j: i) {
      cout << j;
    }
  }
}

void remG(int a, int b) {
  //cout << "a:" << a << "b:" << b << endl;
  vector<int>::iterator pos = find(g[a].begin(), g[a].end(), b);
  if (pos != g[a].end())
      g[a].erase(pos);
}

bool DFSRec(int v, int f, bool visited[]) {
  //cout << v << " ";
  if (v == f) return true;

  visited[v] = true;

  list<int>::iterator i;
  for (auto i: g[v])
    if (!visited[i])
      if (DFSRec(i, f, visited)) {
        remG(v, i);
        return true;
      }
  return false;
}

void DFS(int s, int f) {
  bool *visited = new bool[N];
  for (int i = 0; i < N; i++)
    visited[i] = false;

  int a = 10;

  int paths = 0;

  while(DFSRec(s, f, visited)) {
    for (int i = 0; i < N; i++)
      visited[i] = false;
    paths++;
  }
  cout << paths;
}

int main() {
  int n, m;
  cin >> n >> m;
  for(int i=0; i<m; i++) {
    int v, w, x;
    cin >> v >> w >> x;
    for (int y=0; y<x; y++) {
      g[v].push_back(w);
      //g[w].push_back(v);
    }
  }

  //bfs(1);
  //printG();
  DFS(1, n);
  //printG();
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: RUNTIME ERROR

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: RUNTIME ERROR

Test 19

Verdict: RUNTIME ERROR

Test 20

Verdict: ACCEPTED

Test 21

Verdict: RUNTIME ERROR

Test 22

Verdict: RUNTIME ERROR