21762022-12-29 01:09:03TuruTamasBürokrácia (40)cpp11Accepted 40/4050ms5804 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N; cin >> N;
    int * type = new int[N];
    for (int i = 0; i < N; i++)
    {
        char c; cin >> c;
        if (c == 'V') {
            int v; cin >> v;
            type[i] = v - 1;
        }
        else {
            type[i] = -1;
        }
    }
    bool * active = new bool[N];
    fill(active, active + N, true);
    vector<int> r;
    for (int i = N - 1; i >= 0; i--)
    {
        if (active[i]) {
            r.push_back(i);
            if (type[i] != -1) {
                active[type[i]] = false;
            }
        }
    }
    cout << r.size() << '\n';
    for (int i = r.size() - 1; i >= 0; i--)
    {
        cout << r[i] + 1 << ' ';
    }
    cout << endl;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1812 KiB
2Accepted1/12ms2056 KiB
3Accepted1/12ms2260 KiB
4Accepted1/12ms2516 KiB
5Accepted1/124ms4572 KiB
6Accepted1/148ms4288 KiB
7Accepted1/145ms4416 KiB
8Accepted2/246ms4620 KiB
9Accepted2/246ms4820 KiB
10Accepted2/246ms4896 KiB
11Accepted2/246ms5104 KiB
12Accepted2/225ms5484 KiB
13Accepted2/226ms5768 KiB
14Accepted2/243ms4932 KiB
15Accepted2/235ms5572 KiB
16Accepted2/225ms5572 KiB
17Accepted2/225ms5520 KiB
18Accepted2/226ms5644 KiB
19Accepted2/223ms5724 KiB
20Accepted2/223ms5664 KiB
21Accepted2/223ms5804 KiB
22Accepted2/248ms5084 KiB
23Accepted4/450ms5204 KiB