200252025-12-31 09:55:26szjTáblajátékcpp17Wrong answer 18/501ms508 KiB
#include <bits/stdc++.h>

using namespace std;
vector<int> vec = {0};
short int n, l, sor=0;
void ossz()
{
    for(int i=0; i<vec.size(); i++)
    {
        if(vec[i])vec[i]=0;
        else
        {
            vec[i]=1;
            return;
        }
    }
    vec.push_back(1);
}
void kiv()
{
    for(int i=0; i<vec.size(); i++)
    {
        if(vec[i])
        {
            vec[i]=0;
            if(i==vec.size()-1 && i!=0) vec.erase(vec.begin()+vec.size()-1);
            return;
        }
        else vec[i]=1;
    }
}
void szor()
{
    if(vec.size()!=1 || vec[0]!=0)vec.insert(vec.begin(), 0);
    sor++;
}
void oszt()
{
    if(vec[0]==1)kiv();
    vec.erase(vec.begin());
    sor--;
}
int main()
{
    //ifstream cin("f.txt");
    cin >> n;
    while(n--)
    {
        cin >> l;
        if(l==0)szor();
        else if(l==1)
        {
            szor();
            ossz();
        }
        else if(l==2)oszt();
        else if(l==3)kiv();
        else if(l==4)ossz();
    }
    cout << sor << endl;
    bool kezd=0;
    for(int i=vec.size()-1; i>=0; i--)
    {
        if(vec[i])kezd=1;
        if(kezd)cout << vec[i] << " ";
    }
    if(!kezd)cout << 0;
}
SubtaskSumTestVerdictTimeMemory
base18/50
1Wrong answer0/01ms508 KiB
2Wrong answer0/01ms316 KiB
3Accepted3/31ms316 KiB
4Partially correct1/31ms316 KiB
5Partially correct1/31ms316 KiB
6Partially correct1/31ms316 KiB
7Partially correct1/31ms316 KiB
8Partially correct1/31ms368 KiB
9Accepted3/31ms356 KiB
10Partially correct1/31ms316 KiB
11Partially correct1/31ms316 KiB
12Partially correct1/31ms324 KiB
13Partially correct1/41ms316 KiB
14Partially correct1/41ms344 KiB
15Partially correct1/41ms316 KiB
16Partially correct1/41ms316 KiB
17Runtime error0/41ms316 KiB