Submission #588605

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
588605	2022-07-03T16:42:10 Z	MilosMilutinovic	Tropical Garden (IOI11_garden)	C++14	Compilation error	0 ms	0 KB

garden

/**
 *    author:  wxhtzdy
 *    created: 03.07.2022 18:28:39
**/
#include "garden.h"

#include <bits/stdc++.h>

using namespace std;

void count_routes(int n, int m, int p, int r[][2], int q, int k[]) {
  vector<vector<int>> e(n);
  for (int i = m - 1; i >= 0; i--) {
    if ((int) e[r[i][0]].size() < 2) {
      e[r[i][0]].push_back(i);
    }
    if ((int) e[r[i][1]].size() < 2) {
      e[r[i][1]].push_back(i);
    }
  }
  for (int i = 0; i < n; i++) {
    if ((int) e[i].size() == 1) {
      e[i].push_back(e[i][0]);
    }
  }
  vector<vector<int>> g(2 * n);
  function<void(int, int)> Add = [&](int v, int u) {
    g[v].push_back(u);
  };
  for (int i = 0; i < n; i++) {
    if (e[i][0] == e[e[i][0]][0]) {
      Add(i * 2, e[i][0] * 2 + 1);
    } else {
      Add(i * 2, e[i][0] * 2);
    }          
    if (e[i][1] == e[e[i][1]][0]) {
      Add(i * 2 + 1, e[i][0] * 2 + 1);
    } else {
      Add(i * 2 + 1, e[i][1] * 2);
    }
  }
  const int L = 32;
  vector<vector<int>> jump(n, vector<int>(L));
  for (int i = 0; i < n; i++) {
    jump[i][0] = g[i * 2][0];    
  }
  for (int j = 1; j < L; j++) {
    for (int i = 0; i < n; i++) {
      jump[i][j] = jump[jump[i][j - 1]][j - 1];
    }
  }
  for (int i = 0; i < q; i++) {
    int cnt = 0;
    for (int j = 0; j < n; j++) {
      int x = j;
      for (int l = L - 1; l >= 0; l--) {
        if (k[i] >> l & 1) {
          x = jump[x][l];
        }
      }
      if (x == p) {
        cnt += 1;
      }
    }            
    answer(cnt);
  }
}

Compilation message

garden.cpp: In function 'void count_routes(int, int, int, int (*)[2], int, int*)':
garden.cpp:65:5: error: 'answer' was not declared in this scope
   65 |     answer(cnt);
      |     ^~~~~~