8165 | 2024. 01. 12 15:18:50 | anon | Bürokrácia (40) | cpp17 | Elfogadva 40/40 | 39ms | 27080 KiB |
#include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long long ll;
bool solve(ll law, const vector<vector<ll>> &graph, vector<ll> &dp) {
ll &ans = dp[law];
if(ans != -1)
return ans;
ans = true;
for(const auto &x : graph[law])
ans &= !solve(x, graph, dp);
return ans;
}
int main() {
FastIO;
char c;
ll i, v, N;
cin >> N;
vector<vector<ll>> graph(N);
for(i = 0; i < N; i++) {
cin >> c;
if(c == 'R')
continue;
cin >> v;
graph[v - 1].push_back(i);
}
vector<ll> ans;
vector<ll> dp(N, -1);
for(i = 0; i < N; i++) {
if(solve(i, graph, dp))
ans.push_back(i + 1);
}
cout << ans.size() << '\n';
for(const auto &x : ans)
cout << x << ' ';
cout << '\n';
return 0;
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 40/40 | ||||||
1 | Elfogadva | 0/0 | 3ms | 1976 KiB | |||
2 | Elfogadva | 1/1 | 3ms | 2180 KiB | |||
3 | Elfogadva | 1/1 | 3ms | 2548 KiB | |||
4 | Elfogadva | 1/1 | 3ms | 2812 KiB | |||
5 | Elfogadva | 1/1 | 17ms | 11060 KiB | |||
6 | Elfogadva | 1/1 | 37ms | 26804 KiB | |||
7 | Elfogadva | 1/1 | 29ms | 17732 KiB | |||
8 | Elfogadva | 2/2 | 32ms | 17084 KiB | |||
9 | Elfogadva | 2/2 | 35ms | 17408 KiB | |||
10 | Elfogadva | 2/2 | 39ms | 18124 KiB | |||
11 | Elfogadva | 2/2 | 35ms | 18684 KiB | |||
12 | Elfogadva | 2/2 | 17ms | 17208 KiB | |||
13 | Elfogadva | 2/2 | 18ms | 17632 KiB | |||
14 | Elfogadva | 2/2 | 35ms | 20172 KiB | |||
15 | Elfogadva | 2/2 | 29ms | 20924 KiB | |||
16 | Elfogadva | 2/2 | 18ms | 19432 KiB | |||
17 | Elfogadva | 2/2 | 18ms | 19688 KiB | |||
18 | Elfogadva | 2/2 | 18ms | 20048 KiB | |||
19 | Elfogadva | 2/2 | 16ms | 19860 KiB | |||
20 | Elfogadva | 2/2 | 17ms | 20172 KiB | |||
21 | Elfogadva | 2/2 | 17ms | 20564 KiB | |||
22 | Elfogadva | 2/2 | 34ms | 27080 KiB | |||
23 | Elfogadva | 4/4 | 37ms | 25616 KiB |