-
Notifications
You must be signed in to change notification settings - Fork 0
/
abc065_b.cc
48 lines (43 loc) · 1.01 KB
/
abc065_b.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, int(n) + 1)
#define RREP(i, n) RFOR(i, 0, n)
#define RREP1(i, n) RFOR(i, 1, int(n) + 1)
#define ALL(c) begin(c), end(c)
int _ = (
#ifndef LOCAL
std::cin.tie(nullptr), std::ios::sync_with_stdio(false),
#endif
std::cout.precision(10), std::cout.setf(std::ios::fixed));
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <typename T> using vec = std::vector<T>;
using namespace std;
int main() {
ll N;
cin >> N;
vec<ll> a(N);
REP(i, N) {
cin >> a[i];
a[i]--;
}
unordered_set<ll> s;
s.emplace(0);
ll res = 1;
for (ll next = a[0];; next = a[next], res++) {
if (next == 1) {
break;
} else if (s.count(next) > 0) {
res = -1;
break;
} else {
s.emplace(next);
}
}
cout << res << endl;
return 0;
}