提出 #22839029
ソースコード 拡げる
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const ll modn = 1000000007;
int main()
{
int n, p;
cin >> n;
vector<vector<int> > dist(n+1, vector<int>(n+1, -1));
dist[1][1] = 0;
for (int i = 2; i <= n; i++) {
cin >> p;
for (int j = 1; j <= n; j++) {
dist[i][j] = (dist[p][j] == -1 ? -1 : dist[p][j] + 1);
}
dist[i][p] = 1;
dist[i][i] = 0;
}
int q, u, d, D;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> u >> d;
D = d - dist[u][1];
int res = 0;
for (int j = 1; j <= n; j++) {
if (dist[j][u] == D && dist[j][u] != -1) res++;
}
cout << res << endl;
}
return 0;
}
提出情報
| 提出日時 | |
|---|---|
| 問題 | E - Count Descendants |
| ユーザ | ameolp |
| 言語 | C++ (GCC 9.2.1) |
| 得点 | 0 |
| コード長 | 1223 Byte |
| 結果 | RE |
| 実行時間 | 2224 ms |
| メモリ | 3509616 KiB |
ジャッジ結果
| セット名 | Sample | All | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 0 / 500 | ||||||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | sample_00 |
| All | binary_00, binary_01, binary_02, binary_03, binary_04, binary_05, binary_06, binary_07, binary_08, binary_09, bound_00, bound_01, bound_02, bound_03, broomlike_00, broomlike_01, broomlike_02, broomlike_03, broomlike_04, random_00, random_01, random_02, random_03, random_04, random_05, random_06, random_07, random_08, random_09, sample_00 |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| binary_00 | RE | 2035 ms | 3507744 KiB |
| binary_01 | RE | 2106 ms | 3508280 KiB |
| binary_02 | RE | 2070 ms | 3508424 KiB |
| binary_03 | RE | 2023 ms | 3509532 KiB |
| binary_04 | RE | 2120 ms | 3509616 KiB |
| binary_05 | RE | 2070 ms | 3509296 KiB |
| binary_06 | RE | 2046 ms | 3508684 KiB |
| binary_07 | RE | 2053 ms | 3508252 KiB |
| binary_08 | RE | 2056 ms | 3508640 KiB |
| binary_09 | RE | 2006 ms | 3508812 KiB |
| bound_00 | RE | 2023 ms | 3508848 KiB |
| bound_01 | RE | 2052 ms | 3508900 KiB |
| bound_02 | AC | 338 ms | 5584 KiB |
| bound_03 | AC | 315 ms | 3400 KiB |
| broomlike_00 | RE | 2046 ms | 3508452 KiB |
| broomlike_01 | RE | 2049 ms | 3509596 KiB |
| broomlike_02 | RE | 2031 ms | 3509248 KiB |
| broomlike_03 | RE | 2062 ms | 3509296 KiB |
| broomlike_04 | RE | 2053 ms | 3509088 KiB |
| random_00 | RE | 2159 ms | 3509484 KiB |
| random_01 | RE | 2177 ms | 3508376 KiB |
| random_02 | RE | 2178 ms | 3508124 KiB |
| random_03 | RE | 2087 ms | 3508824 KiB |
| random_04 | RE | 2040 ms | 3508844 KiB |
| random_05 | TLE | 2224 ms | 658960 KiB |
| random_06 | RE | 2021 ms | 3508284 KiB |
| random_07 | RE | 1972 ms | 3508588 KiB |
| random_08 | RE | 2061 ms | 3508300 KiB |
| random_09 | RE | 2131 ms | 3507728 KiB |
| sample_00 | AC | 23 ms | 5356 KiB |