200412025-12-31 10:53:14szjTáblajátékcpp17Partially correct 48/503ms572 KiB
#include <bits/stdc++.h>

using namespace std;
int main()
{
    vector<int> vec;
    int n, l, i;
    cin >> n;
    while(n--)
    {
        cin >> l;
        if(l==0)vec.push_back(0);
        else if(l==1)vec.push_back(1);
        else if(l==2 && !vec.empty())vec.pop_back();
        else if(l==3)
        {
            for(i=vec.size()-1; i>0; i--)
            {
                if(vec[i])
                {
                    vec[i]=0;
                    for(i=i+1; i<vec.size(); i++)vec[i]=1;
                    break;
                }
            }
        }
        else if(l==4)
        {
            for(i=vec.size()-1; i>=0; i--)
            {
                if(!vec[i])
                {
                    vec[i]=1;
                    for(i=i+1; i<vec.size(); i++)vec[i]=0;
                    break;
                }
            }
        }
    }
    bool kezd=0;
    cout << vec.size() << endl;
    for(i=0; i<vec.size(); i++)
    {
        if(vec[i])kezd=1;
        if(kezd)cout << vec[i];
    }
    if(!kezd)cout << 0;
}
SubtaskSumTestVerdictTimeMemory
base48/50
1Accepted0/01ms316 KiB
2Accepted0/01ms508 KiB
3Accepted3/31ms508 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms572 KiB
12Partially correct1/31ms316 KiB
13Accepted4/41ms316 KiB
14Accepted4/41ms316 KiB
15Accepted4/41ms316 KiB
16Accepted4/43ms552 KiB
17Accepted4/41ms316 KiB