path-update.cpp

cin >> x >> u;  // input id for newly added node and its to-be manager

// lets assume we have the parent array created for us already 
// lets add parent for newly added node x
parent[x] = u;

// add 1 to all nodes on path towards root
int curr = x;
while(curr != -1){
  attending[curr]++;
  curr = parent[curr];
}