6433 | 2023. 11. 28 22:39:56 | gergomiszori | Táblajáték | cpp17 | Elfogadva 50/50 | 3ms | 3404 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pll pair<ll,ll>
#define fs first
#define sc second
void solve()
{
ll k;
cin >> k;
ll ans1 = 0; string ans2 = "0";
for(ll i = 0; i < k; i++)
{
ll l;
cin >> l;
if(l == 0)
{
ans2 += "0";
ans1++;
}
else
if(l == 1)
{
ans2 += "1";
ans1++;
}
else
if(l == 2)
{
ans2.pop_back();
ans1--;
}
else
if(l == 3)
{
if(ans2[ans2.size()-1] == '1') ans2[ans2.size()-1] = '0';
else
{
ll index = 1;
while(ans2[ans2.size()-index] != '1')
{
ans2[ans2.size()-index] = '1';
index++;
}
ans2[ans2.size()-index] = '0';
}
}
else
if(l == 4)
{
ans2 = "0" + ans2;
if(ans2[ans2.size()-1] == '0') ans2[ans2.size()-1] = '1';
else
{
ll index = 1;
while(ans2[ans2.size()-index] != '0')
{
ans2[ans2.size()-index] = '0';
index++;
}
ans2[ans2.size()-index] = '1';
}
}
}
while(ans2[0] == '0') ans2.erase(ans2.begin());
if(ans2.size() == 0) ans2 = "0";
cout << ans1 << endl;
cout << ans2 << endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll t = 1;
//cin >> t;
while(t--)
{
solve();
}
return 0;
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 50/50 | ||||||
1 | Elfogadva | 0/0 | 3ms | 1700 KiB | |||
2 | Elfogadva | 0/0 | 3ms | 1860 KiB | |||
3 | Elfogadva | 3/3 | 3ms | 2096 KiB | |||
4 | Elfogadva | 3/3 | 3ms | 2312 KiB | |||
5 | Elfogadva | 3/3 | 3ms | 2524 KiB | |||
6 | Elfogadva | 3/3 | 3ms | 2608 KiB | |||
7 | Elfogadva | 3/3 | 3ms | 2732 KiB | |||
8 | Elfogadva | 3/3 | 3ms | 2816 KiB | |||
9 | Elfogadva | 3/3 | 3ms | 3080 KiB | |||
10 | Elfogadva | 3/3 | 3ms | 2940 KiB | |||
11 | Elfogadva | 3/3 | 2ms | 3028 KiB | |||
12 | Elfogadva | 3/3 | 3ms | 3128 KiB | |||
13 | Elfogadva | 4/4 | 3ms | 3180 KiB | |||
14 | Elfogadva | 4/4 | 3ms | 3280 KiB | |||
15 | Elfogadva | 4/4 | 3ms | 3364 KiB | |||
16 | Elfogadva | 4/4 | 3ms | 3404 KiB | |||
17 | Elfogadva | 4/4 | 3ms | 3356 KiB |