oj.uz

Submission #848615

# Submission time Handle Problem Language Result Execution time Memory
848615 2023-09-13T04:39:51 Z wakandaaa Special graph (IZhO13_specialg) C++17
0 / 100
 1000 ms 31828 KB 
#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n;
vector<int> adj[N];
int d[N];

int path(int x, int y) {
	for (int i = 1; i <= n; ++i) {
		d[i] = -1;
	}
	queue<int> q;
	d[x] = 0;
	q.push(x);
	while (q.size()) {
		int u = q.front(); q.pop();
		for (int v : adj[u]) if (d[v] == -1) {
			d[v] = d[u] + 1;
			q.push(v);
		}
	}
	return d[y];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n;
    for (int i = 1; i <= n; ++i) {
    	int x;
    	cin >> x;
    	if (x) adj[i].push_back(x);
    }

    int q;
    cin >> q;
    while (q--) {
    	int op;
    	cin >> op;
    	if (op == 1) {
    		int x;
    		cin >> x;
    		adj[x].clear();
    	}
    	else {
    		int u, v;
    		cin >> u >> v;
    		cout << path(u, v) << '\n';
    	}
    }

    return 0;
}

/*

*/

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 25644 KB Output is correct
2 Correct 7 ms 25688 KB Output is correct
3 Correct 8 ms 25944 KB Output is correct
4 Correct 14 ms 25772 KB Output is correct
5 Correct 7 ms 25688 KB Output is correct
6 Correct 73 ms 25936 KB Output is correct
7 Correct 81 ms 25936 KB Output is correct
8 Correct 89 ms 25912 KB Output is correct
9 Correct 72 ms 25936 KB Output is correct
10 Correct 90 ms 25928 KB Output is correct
11 Execution timed out 1034 ms 31828 KB Time limit exceeded
12 Halted 0 ms 0 KB -