3410 | 2023. 02. 27 13:26:34 | Eyusie | Táblajáték | cpp17 | Elfogadva 50/50 | 3ms | 3824 KiB |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int lep;
int sor = 0;
vector<char> eredm;
cin >> lep;
int act;
eredm.push_back('0');
for(int i = 0, n = 0; i < lep; i++)
{
cin >> act;
if(act == 0)
{
eredm.push_back('0');
sor++;
}
if(act == 1)
{
eredm.push_back('1');
sor++;
}
if(act == 2)
{
eredm.pop_back();
sor--;
}
if(act == 3)
{
n=0;
while(eredm[eredm.size()-1] == '0' && eredm.size() > 0)
{
eredm.pop_back();
n++;
}
eredm.pop_back();
eredm.push_back('0');
for(int j = 0; j < n; j++)
{
eredm.push_back('1');
}
}
if(act == 4)
{
n=0;
while(eredm[eredm.size()-1] == '1' && eredm.size() > 0)
{
eredm.pop_back();
n++;
}
eredm.pop_back();
eredm.push_back('1');
for(int j = 0; j < n; j++)
{
eredm.push_back('0');
}
}
}
cout << sor << "\n";
int kezdet = 0;
for(int i = 0; i < eredm.size(); i++)
{
if(eredm[i] == '0') kezdet++;
else break;
}
for(int i = kezdet; i < eredm.size(); i++)
{
cout << eredm[i];
}
if(kezdet == eredm.size()) cout << "0\n";
else cout << "\n";
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 50/50 | ||||||
1 | Elfogadva | 0/0 | 3ms | 1808 KiB | |||
2 | Elfogadva | 0/0 | 3ms | 1904 KiB | |||
3 | Elfogadva | 3/3 | 3ms | 2108 KiB | |||
4 | Elfogadva | 3/3 | 3ms | 2320 KiB | |||
5 | Elfogadva | 3/3 | 3ms | 2552 KiB | |||
6 | Elfogadva | 3/3 | 3ms | 2612 KiB | |||
7 | Elfogadva | 3/3 | 3ms | 2756 KiB | |||
8 | Elfogadva | 3/3 | 3ms | 2812 KiB | |||
9 | Elfogadva | 3/3 | 3ms | 3052 KiB | |||
10 | Elfogadva | 3/3 | 3ms | 3176 KiB | |||
11 | Elfogadva | 3/3 | 3ms | 3264 KiB | |||
12 | Elfogadva | 3/3 | 3ms | 3384 KiB | |||
13 | Elfogadva | 4/4 | 3ms | 3464 KiB | |||
14 | Elfogadva | 4/4 | 3ms | 3532 KiB | |||
15 | Elfogadva | 4/4 | 3ms | 3800 KiB | |||
16 | Elfogadva | 4/4 | 3ms | 3704 KiB | |||
17 | Elfogadva | 4/4 | 3ms | 3824 KiB |