oj.uz

답안 #250262

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250262 2020-07-17T10:21:45 Z tutis File Paths (BOI15_fil) C++17
33 / 100
 1000 ms 20472 KB 
/*input
2 4 22
2
0 1
1 5
2 13
2 10
1 4
0 7

*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0), cerr.tie(0);
	int n, m, k, s;
	cin >> n >> m >> k >> s;
	s++;
	int p[n + 1], d[n + 1], l[n + 1];
	p[0] = -1;
	d[0] = 1;
	vector<int>D = {1};
	for (int i = 1; i <= n; i++)
	{
		cin >> p[i] >> l[i];
		d[i] = d[p[i]] + 1 + l[i];
		D.push_back(d[i]);
	}
	sort(D.begin(), D.end());
	vector<int>cikl[n + 1];
	for (int i = 0; i <= n; i++)
	{
		for (int j = i; j != -1; j = p[j])
		{
			cikl[j].push_back(d[i] - d[j] + s);
		}
	}
	for (int i = 0; i <= n; i++)
		sort(cikl[i].begin(), cikl[i].end());
	function<bool(int, int)>ok = [&](int v, int ilg)
	{
		if (d[v] == ilg)
			return true;
		if (ilg <= 0)
			return false;
		if (v != 0 && ok(p[v], ilg - 1 - l[v]))
			return true;
		if (binary_search(D.begin(), D.end(), ilg - s))
			return true;
		if (ilg <= d[v])
			return false;
		ilg -= d[v];
		for (int c = 1; c * c <= ilg; c++)
		{
			if (ilg % c == 0)
			{
				if (binary_search(cikl[v].begin(), cikl[v].end(), c))
					return true;
				if (binary_search(cikl[v].begin(), cikl[v].end(), ilg / c))
					return true;
			}
		}
		return false;
	};
	while (m--)
	{
		int p, l;
		cin >> p >> l;
		if (ok(p, k - l))
			cout << "YES\n";
		else
			cout << "NO\n";
	}
}

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 59 ms 812 KB Output is correct
5 Correct 65 ms 512 KB Output is correct
6 Correct 15 ms 404 KB Output is correct
7 Correct 255 ms 1024 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 8 ms 768 KB Output is correct

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 640 KB Output is correct
2 Correct 16 ms 640 KB Output is correct
3 Correct 14 ms 640 KB Output is correct
4 Correct 16 ms 692 KB Output is correct
5 Execution timed out 1093 ms 20472 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 59 ms 812 KB Output is correct
5 Correct 65 ms 512 KB Output is correct
6 Correct 15 ms 404 KB Output is correct
7 Correct 255 ms 1024 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 8 ms 768 KB Output is correct
13 Correct 17 ms 640 KB Output is correct
14 Correct 16 ms 640 KB Output is correct
15 Correct 14 ms 640 KB Output is correct
16 Correct 16 ms 692 KB Output is correct
17 Execution timed out 1093 ms 20472 KB Time limit exceeded
18 Halted 0 ms 0 KB -