# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1201530 | adiyer | Game (APIO22_game) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 11;
int n, ok;
int was[MAXN];
vector < int > g[MAXN];
void dfs(int v){
was[v] = 1;
for(int u : g[v]){
if(!was[u]) dfs(u);
else if(was[u] == 1) ok = 1;
}
was[v] = 2;
}
void init(int _n, int k) {
n = _n;
for(int i = 0; i < k - 1; i++) g[i].push_back(i + 1);
}
int add_teleporter(int u, int v){
g[u].push_back(v);
for(int i = 0; i < n; i++) was[i] = 0;
dfs(0);
return ok;
}
namespace {
int read_int() {
int x;
if (scanf("%d", &x) != 1) {
fprintf(stderr, "Error while reading input\n");
exit(1);
}
return x;
}
} // namespace
int main() {
int N = read_int();
int M = read_int();
int K = read_int();
std::vector<int> u(M), v(M);
for (int i = 0; i < M; ++i) {
u[i] = read_int();
v[i] = read_int();
}
init(N, K);
int i;
for (i = 0; i < M; ++i) {
int answer = add_teleporter(u[i], v[i]);
if (answer != 0 && answer != 1) {
i = -1;
break;
} else if (answer == 1) {
break;
}
}
printf("%d\n", i);
return 0;
}