Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <queue> #include <vector> #include <fstream> using namespace std; const int maxn = 1e5 + 10; int n, m; vector<int> graph[maxn]; int main() { cin >> n >> m; vector<int> parent(n + 1, -1); for(int i = 2; i <= n; i++) { int x; cin >> x; parent[i] = x; } for(int i = 0; i < m; i++) { int x, k; cin >> x >> k; int ancestor = x; for(int j = 0; j < k; j++) { ancestor = parent[ancestor]; if(ancestor == -1) { break; } } cout << ancestor << endl; } return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
