77812024-01-11 09:53:46almadavBürokrácia (40)cpp17Accepted 40/4039ms14812 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    iostream::sync_with_stdio(0);
    cin.tie(0);
    int n;
    string be;
    cin >> n;
    int q;
    vector<bool>torvenyek(n,true);
    vector<vector<int>> mitmik(n);
    for(int i = 0; i < n; i++)
    {
        cin >> be;
        if(be == "V")
        {
            cin >> q;
            mitmik[q-1].push_back(i);
        }

    }
    for(int i = n-1; i >=0;i--)
    {
        for(auto x : mitmik[i])
        {
            if(torvenyek[x])
            {
                torvenyek[i] = false;
                break;
            }
        }
    }
    bool alma = true;
    int c =0;
    for(auto x : torvenyek)
    {
        if(x) c++;
    }
    cout << c << endl;
    c=0;
    for(auto x : torvenyek)
    {
        c++;
        if(x)
        {
            if(!alma)cout <<" ";
            alma = false;
            cout << c;
        }
    }
    cout << endl;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1824 KiB
2Accepted1/13ms2164 KiB
3Accepted1/13ms2316 KiB
4Accepted1/13ms2556 KiB
5Accepted1/121ms7180 KiB
6Accepted1/137ms13688 KiB
7Accepted1/135ms13100 KiB
8Accepted2/237ms11676 KiB
9Accepted2/239ms11320 KiB
10Accepted2/239ms11304 KiB
11Accepted2/237ms10888 KiB
12Accepted2/223ms8452 KiB
13Accepted2/223ms8440 KiB
14Accepted2/237ms11188 KiB
15Accepted2/230ms10224 KiB
16Accepted2/223ms8660 KiB
17Accepted2/223ms8868 KiB
18Accepted2/224ms8844 KiB
19Accepted2/220ms8428 KiB
20Accepted2/220ms8428 KiB
21Accepted2/220ms8300 KiB
22Accepted2/235ms14812 KiB
23Accepted4/439ms12660 KiB